Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Acoustics Speech and Signal Processing

Secret key generation from multiple cooperative helpers by rate unlimited public communication

Bin Yang, Wenjie Wang, Qinye Yin

Published May 1, 2014• 5 citations
Publisher

Abstract

This paper investigates the secret key generation from multiple cooperative sources. We assume that the public communication between the legitimate users has unlimited capacity. In this case, the secret key rate is the upper bound of a practical system with limited public communication. The random signals from the multiple helpers can help to create correlated Gaussian sources for the legitimate users to generate secret key, and only local channel state information (CSI) is needed by the helpers to cooperate with others. The power allocation between the helpers is studied with a total transmit power constraint, which results in a non-convex optimization problem. A high efficiency sub-optimal solution is proposed. And even when the legitimate users have no idea about the eavesdropper, the scheme still can help the system to achieve fairly good performance.

DOI
10.1109/icassp.2014.6855196

Related papers

Cooperative Two-Key Generation in Source-Type Model With Partial-Trusted Helpers

Shixun Gong, Na Li, Huici Wu +1 more

This paper investigates the problem of generating two secret keys (SKs) simultaneously over a five-terminal system with terminals labelled as 1, 2, 3, 4 and 5. Each of terminal 2 and terminal 3 wishes to generate an SK with terminal 1 over a public channel wiretapped by a passive eavesdropper. Terminal 4 and terminal 5 respectively act as a trusted helper and an untrusted helper to assist the SK generation. All the terminals observe correlated source sequences from discrete memoryless sources (DMS) and can exchange information over a public channel with no rate constraint that the eavesdropper has access to. Based on the considered model, key capacity region is fully characterized and a source coding scheme that can achieve the capacity region is provided. Furthermore, expression for key leakage rate is obtained to analyze the security performance of the two generated keys.

IEEE/CIC International Conference on Communications in China (ICCC)•Aug 1, 2019•1 citation

Common randomness and secret key generation with a helper

Imre Csiszár, Prakash Narayan

We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a "helper" terminal. Each terminal observes a different component of a discrete memoryless multiple source. The helper aids the users by transmitting information to them over a noiseless public channel subject to a rate constraint. Furthermore, one of the users is allowed to transmit to the other user over a public channel under a similar rate constraint. We study the maximum rate of CR which can be thus generated, including under additional secrecy conditions when it must be concealed from a wiretapper. Lower bounds for the corresponding capacities are provided, and single-letter capacity formulas are obtained for several special cases of interest.

IEEE Transactions on Information Theory•Mar 1, 2000•302 citations

Secure Secret Key and Private Key Generation in Source-Type Model With a Trusted Helper

Shixun Gong, Xiaofeng Tao, Na Li +2 more

Encrypting information with pre-agreed key is an effective method to ensure information security. With the increasing requirement for key rate, this paper investigates the problem of simultaneously generating a secret key (SK) and a private key (PK) over three legitimate terminals with a trusted helper via public discussion that a passive eavesdropper completely access to. The legitimate terminals and the helper observe the correlated source sequences from the outputs of discrete memoryless source (DMS). The legitimate terminals wish to generate an SK that is concealed from the eavesdropper, and two designated legitimate terminals want to generate a PK that needs to be additionally keep secret from the third legitimate terminal. Under this model, the SK-PK capacity region is fully characterized, and the source coding scheme is further provided to show that the region is achievable. The security performance of the generated keys is analyzed in terms of key leakage rate.

IEEE Access•Jan 1, 2020•3 citations

Secret Key Generation from a Biometric Source with an Eavesdropping Jammer

Sebastian Baur, Holger Boche, Ning Cai

We consider secret key generation from a biometric source. We examine an information theoretic model where a legitimate user reads from the biometric source two times. A secret key is generated from the first output of the biometric source. From the second output of the biometric source this secret key is reconstructed. The corresponding outputs of the biometric source are modelled as jointly distributed random variables. We also assume that a helper message, generated after reading from the biometric source for the first time, is available to the legitimate user when reading from the biometric source for the second time. Additionally the helper message is assumed to be publicly available and an eavesdropper wants to learn the secret key from the helper message. We assume the biometric source is jammed before the legitimate user reads from the source for the second time. The jammer gets to know the public helper message too. Considering the secret key generation rate and the privacy leakage rate we characterize the corresponding capacity region taking into account protocols that guarantee perfect secrecy and uniform distribution of the key.

IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)•Apr 29, 2019•4 citations

Destination Assisted Secret Wireless Communication With Cooperative Helpers

Bin Yang, Wenjie Wang, Bobin Yao +1 more

This letter investigates a novel two-stage cooperative scheme to secure the communication system with one source, one destination and multiple helpers. Herein, the source mixes the confidential messages with the interferences transmitted by the helpers and destination. Since the helpers and destination serve to suppress interferences, the destination can acquire an interference-free signal, however the eavesdropper is still confused. This scheme can achieve positive secrecy rate even when the eavesdropper's channel is much better than the legitimate link, and only requires local channel state information (CSI) and a few parameters of the main link. An efficient sub-optimal algorithm for the majorization of system parameters is proposed to avoid global search and the practical case without eavesdropper's CSI is also considered. Simulation results demonstrate the effectiveness of the proposed scheme and algorithm.

IEEE Signal Processing Letters•Aug 16, 2013•19 citations

On Multiterminal Secrecy Capacities

Imre Csiszár, Prakash Narayan

Shannon-theoretic secret key generation by several parties is considered for source models in which the distinct components of a multiple source observed separately by multiple terminals, and for channel models in which a secure noisy channel with one input terminal and multiple output terminals, and, additionally in both cases, a public noiseless channel of unlimited capacity, are available for accomplishing this goal. The secret key is generated for a set A of terminals, with the remaining terminals (if any) cooperating in this task through their public communication. We show that for source models in which secrecy is required from an eavesdropper that observes only the public communication and perhaps also a set of terminals disjoint from A, secrecy capacity can be achieved with noninteractive communication, the key being generated by any chosen terminal in the secret key-seeking set A of terminals obliviously of the public communication. For models in which the eavesdropper also possesses side information that is not available to any of the terminals cooperating in secrecy generation, an upper bound for the secrecy capacity and a sufficient condition for its tightness are given. The latter partially fills a gap in the authors' previous work [6].

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•0 citations
This paper investigates the secret key generation from multiple cooperative sources. We assume that the public communication between the legitimate users has unlimited capacity. In this case, the secret key rate is the upper bound of a practical system with limited public communication. The random signals from the multiple helpers can help to create correlated Gaussian sources for the legitimate users to generate secret key, and only local channel state information (CSI) is needed by the helpers to cooperate with others. The power allocation between the helpers is studied with a total transmit power constraint, which results in a non-convex optimization problem. A high efficiency sub-optimal solution is proposed. And even when the legitimate users have no idea about the eavesdropper, the scheme still can help the system to achieve fairly good performance.
This paper investigates the problem of generating two secret keys (SKs) simultaneously over a five-terminal system with terminals labelled as 1, 2, 3, 4 and 5. Each of terminal 2 and terminal 3 wishes to generate an SK with terminal 1 over a public channel wiretapped by a passive eavesdropper. Terminal 4 and terminal 5 respectively act as a trusted helper and an untrusted helper to assist the SK generation. All the terminals observe correlated source sequences from discrete memoryless sources (DMS) and can exchange information over a public channel with no rate constraint that the eavesdropper has access to. Based on the considered model, key capacity region is fully characterized and a source coding scheme that can achieve the capacity region is provided. Furthermore, expression for key leakage rate is obtained to analyze the security performance of the two generated keys.
We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a "helper" terminal. Each terminal observes a different component of a discrete memoryless multiple source. The helper aids the users by transmitting information to them over a noiseless public channel subject to a rate constraint. Furthermore, one of the users is allowed to transmit to the other user over a public channel under a similar rate constraint. We study the maximum rate of CR which can be thus generated, including under additional secrecy conditions when it must be concealed from a wiretapper. Lower bounds for the corresponding capacities are provided, and single-letter capacity formulas are obtained for several special cases of interest.
Encrypting information with pre-agreed key is an effective method to ensure information security. With the increasing requirement for key rate, this paper investigates the problem of simultaneously generating a secret key (SK) and a private key (PK) over three legitimate terminals with a trusted helper via public discussion that a passive eavesdropper completely access to. The legitimate terminals and the helper observe the correlated source sequences from the outputs of discrete memoryless source (DMS). The legitimate terminals wish to generate an SK that is concealed from the eavesdropper, and two designated legitimate terminals want to generate a PK that needs to be additionally keep secret from the third legitimate terminal. Under this model, the SK-PK capacity region is fully characterized, and the source coding scheme is further provided to show that the region is achievable. The security performance of the generated keys is analyzed in terms of key leakage rate.
We consider secret key generation from a biometric source. We examine an information theoretic model where a legitimate user reads from the biometric source two times. A secret key is generated from the first output of the biometric source. From the second output of the biometric source this secret key is reconstructed. The corresponding outputs of the biometric source are modelled as jointly distributed random variables. We also assume that a helper message, generated after reading from the biometric source for the first time, is available to the legitimate user when reading from the biometric source for the second time. Additionally the helper message is assumed to be publicly available and an eavesdropper wants to learn the secret key from the helper message. We assume the biometric source is jammed before the legitimate user reads from the source for the second time. The jammer gets to know the public helper message too. Considering the secret key generation rate and the privacy leakage rate we characterize the corresponding capacity region taking into account protocols that guarantee perfect secrecy and uniform distribution of the key.
This letter investigates a novel two-stage cooperative scheme to secure the communication system with one source, one destination and multiple helpers. Herein, the source mixes the confidential messages with the interferences transmitted by the helpers and destination. Since the helpers and destination serve to suppress interferences, the destination can acquire an interference-free signal, however the eavesdropper is still confused. This scheme can achieve positive secrecy rate even when the eavesdropper's channel is much better than the legitimate link, and only requires local channel state information (CSI) and a few parameters of the main link. An efficient sub-optimal algorithm for the majorization of system parameters is proposed to avoid global search and the practical case without eavesdropper's CSI is also considered. Simulation results demonstrate the effectiveness of the proposed scheme and algorithm.
Shannon-theoretic secret key generation by several parties is considered for source models in which the distinct components of a multiple source observed separately by multiple terminals, and for channel models in which a secure noisy channel with one input terminal and multiple output terminals, and, additionally in both cases, a public noiseless channel of unlimited capacity, are available for accomplishing this goal. The secret key is generated for a set A of terminals, with the remaining terminals (if any) cooperating in this task through their public communication. We show that for source models in which secrecy is required from an eavesdropper that observes only the public communication and perhaps also a set of terminals disjoint from A, secrecy capacity can be achieved with noninteractive communication, the key being generated by any chosen terminal in the secret key-seeking set A of terminals obliviously of the public communication. For models in which the eavesdropper also possesses side information that is not available to any of the terminals cooperating in secrecy generation, an upper bound for the secrecy capacity and a sufficient condition for its tightness are given. The latter partially fills a gap in the authors' previous work [6].