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 Conference on Computer Communications Workshops (INFOCOM WKSHPS)

Secret Key Generation from a Biometric Source with an Eavesdropping Jammer

Sebastian Baur, Holger Boche, Ning Cai

Published Apr 29, 2019• 4 citations
Publisher

Abstract

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.

DOI
10.1109/infocomwkshps47286.2019.9093770

Related papers

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

Privacy leakage in biometric secrecy systems

Tanya Ignatenko, F.M.J. Willems

Motivated by Maurer [1993], Ahlswede and Csiszar [1993] introduced the concept of secret sharing. In their source model two terminals observe two correlated sequences. It is the objective of both terminals to form a common secret by interchanging a public message (helper data), that should contain only a negligible amount of information about the secret. Ahlswede and Csiszar showed that the maximum secret key rate that can be achieved in this way is equal to the mutual information between the two source outputs. In a biometric setting, where the sequences correspond to the enrollment and authentication data, it is crucial that the public message leaks as little information as possible about the biometric data, since compromised biometric data cannot be replaced. We investigate the fundamental trade-offs for four biometric settings. The first one is the standard (Ahlswede-Csiszar) secret generation setting, for which we determine the secret key rate - privacy leakage region. Here leakage corresponds to the mutual information between helper data and biometric enrollment sequence conditional on the secret. In the second setting the secret is not generated by the terminals but independently chosen, and transmitted using a public message. Again we determine the region of achievable rate - leakage pairs. In setting three and four we consider zero-leakage, i.e. the public message contains only a negligible amount of information about the secret and the biometric enrollment sequence. To achieve this a private key is needed which can be observed only by the terminals. We consider again both secret generation and secret transmission and determine for both cases the region of achievable secret key rate - private key rate pairs.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2008•23 citations

Secret Key Generation from a Two Component Compound Source with Rate Constrained One Way Communication: Perfect Secrecy

Sebastian Baur, Ning Cai, Moritz Wiese +1 more

Secret key generation at two terminals is considered. Each terminal observes one of the outputs of a two component source. The two source outputs are correlated. Additionally one terminal can send a message to the second terminal via a noiseless public channel. It is assumed that this message is rate constrained. An eavesdropper with access to the public communication should be kept ignorant of the secret key. The maximum secret key rate that can be achieved such that the key is uniformly distributed and meets the perfect secrecy requirement is determined. This result is established for a compound source model.

IEEE International Workshop on Information Forensics and Security•Dec 1, 2019•4 citations

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

Bin Yang, Wenjie Wang, Qinye Yin

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.

IEEE International Conference on Acoustics Speech and Signal Processing•May 1, 2014•5 citations

Secret-key and identification rates for biometric identification systems with protected templates

Tanya Ignatenko, Fmj Frans Willems

In this paper we consider secret generation in biometric identification systems\nwith protected templates. This problem is closely related to the study of the bio\nmetric identification capacity [Willems et al., 2003] and [O’Sullivan and Sclmmid,\n2002] and the common randomness generation scheme [Ahlswede and Csiszár.\n1993]. In our system two terminals observe biometric enrollment and identifi\ncation sequences of a number of individuals. It is the goal of these terminals\nto form a common secret for the sequences that belong to the same individual\nby interchanging public (helper) messages for all individuals in such a way that\nthe information leakage about the secrets from these helper messages is negli\ngible. Moreover, based on the helper data produced by the first terminal, the\nsecond terminal has to establish tIme identity of the individual who presented his\nbiometric sequence.

•Jan 1, 2010•5 citations

Fundamental limits for biometric identification with a database containing protected templates

Tanya Ignatenko, F.M.J. Willems

In this paper we analyze secret generation in biometric identification systems with protected templates. This problem is closely related to the study of the biometric identification capacity of Willems et al. 2003 and O'Sullivan and Schmid 2002 and the common randomness generation of Ahlswede and Csiszár 1993. In our system two terminals observe biometric enrollment and identification sequences of a number of individuals. It is the goal of these terminals to form a common secret for the sequences that belong to the same individual by interchanging public (helper) messages for all individuals in such a way that the information leakage about the secrets from these helper messages is negligible. It is important to realize that biometric data are unique for individuals and cannot be replaced if compromised. Therefore the helper messages should contain as little as possible information about the biometric data. On the other hand, the second terminal has to establish the identity of the individual who presented his biometric sequence, based on the helper data produced by the first terminal. In this paper we determine the fundamental tradeoff between secret-key rate, identification rate and privacy-leakage rate in biometric identification systems.

International Symposium on Information Theory and its Applications•Oct 1, 2010•10 citations
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.
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.
Motivated by Maurer [1993], Ahlswede and Csiszar [1993] introduced the concept of secret sharing. In their source model two terminals observe two correlated sequences. It is the objective of both terminals to form a common secret by interchanging a public message (helper data), that should contain only a negligible amount of information about the secret. Ahlswede and Csiszar showed that the maximum secret key rate that can be achieved in this way is equal to the mutual information between the two source outputs. In a biometric setting, where the sequences correspond to the enrollment and authentication data, it is crucial that the public message leaks as little information as possible about the biometric data, since compromised biometric data cannot be replaced. We investigate the fundamental trade-offs for four biometric settings. The first one is the standard (Ahlswede-Csiszar) secret generation setting, for which we determine the secret key rate - privacy leakage region. Here leakage corresponds to the mutual information between helper data and biometric enrollment sequence conditional on the secret. In the second setting the secret is not generated by the terminals but independently chosen, and transmitted using a public message. Again we determine the region of achievable rate - leakage pairs. In setting three and four we consider zero-leakage, i.e. the public message contains only a negligible amount of information about the secret and the biometric enrollment sequence. To achieve this a private key is needed which can be observed only by the terminals. We consider again both secret generation and secret transmission and determine for both cases the region of achievable secret key rate - private key rate pairs.
Secret key generation at two terminals is considered. Each terminal observes one of the outputs of a two component source. The two source outputs are correlated. Additionally one terminal can send a message to the second terminal via a noiseless public channel. It is assumed that this message is rate constrained. An eavesdropper with access to the public communication should be kept ignorant of the secret key. The maximum secret key rate that can be achieved such that the key is uniformly distributed and meets the perfect secrecy requirement is determined. This result is established for a compound source model.
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.
In this paper we consider secret generation in biometric identification systems\nwith protected templates. This problem is closely related to the study of the bio\nmetric identification capacity [Willems et al., 2003] and [O’Sullivan and Sclmmid,\n2002] and the common randomness generation scheme [Ahlswede and Csiszár.\n1993]. In our system two terminals observe biometric enrollment and identifi\ncation sequences of a number of individuals. It is the goal of these terminals\nto form a common secret for the sequences that belong to the same individual\nby interchanging public (helper) messages for all individuals in such a way that\nthe information leakage about the secrets from these helper messages is negli\ngible. Moreover, based on the helper data produced by the first terminal, the\nsecond terminal has to establish tIme identity of the individual who presented his\nbiometric sequence.
In this paper we analyze secret generation in biometric identification systems with protected templates. This problem is closely related to the study of the biometric identification capacity of Willems et al. 2003 and O'Sullivan and Schmid 2002 and the common randomness generation of Ahlswede and Csiszár 1993. In our system two terminals observe biometric enrollment and identification sequences of a number of individuals. It is the goal of these terminals to form a common secret for the sequences that belong to the same individual by interchanging public (helper) messages for all individuals in such a way that the information leakage about the secrets from these helper messages is negligible. It is important to realize that biometric data are unique for individuals and cannot be replaced if compromised. Therefore the helper messages should contain as little as possible information about the biometric data. On the other hand, the second terminal has to establish the identity of the individual who presented his biometric sequence, based on the helper data produced by the first terminal. In this paper we determine the fundamental tradeoff between secret-key rate, identification rate and privacy-leakage rate in biometric identification systems.