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

Controllable Identifier Measurements for Private Authentication with Secret Keys

Günlü, O.; Kittichokechai, K.; Schaefer, R. F.; Caire, G.

Published Apr 15, 2018• 23 citations
OpenAlex

Abstract

The problem of secret-key based authentication under a privacy constraint on the source sequence is considered. The identifier measurements during authentication are assumed to be controllable via a cost-constrained "action" sequence. Single-letter characterizations of the optimal trade-off among the secret-key rate, storage rate, privacy-leakage rate, and action cost are given for the four problems where noisy or noiseless measurements of the source are enrolled to generate or embed secret keys. The results are relevant for several user-authentication scenarios including physical and biometric authentications with multiple measurements. Our results include, as special cases, new results for secret-key generation and embedding with action-dependent side information without any privacy constraint on the enrolled source sequence.

Related papers

Private authentication with controllable measurement

Kittipong Kittichokechai, Onur Günlü, Rafael F. Schaefer +1 more

We consider the problem of secret key-based authentication under a privacy constraint on the enrolled source data. The user's measurement in the authentication phase is assumed to be controllable via a cost-constrained “action” sequence. We provide a single-letter characterization of the optimal tradeoff among the secret key rate, storage rate, leakage rate, and action cost. The result can be relevant for several user-authentication scenarios including hardware-based and biometric authentication with multiple measurements. Moreover, our result includes, as a special case, a new result for secret-key generation with action-dependent side information where there is no privacy constraint on the source sequence.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2016•2 citations

Biometric and Physical Identifiers with Correlated Noise for Controllable Private Authentication

Onur Günlü, Rafael F. Schaefer, H. Vincent Poor

The problem of secret-key based authentication under privacy and storage constraints on the source sequence is considered. The identifier measurement channels during authentication are assumed to be controllable via a cost-constrained action sequence. Single-letter inner and outer bounds for the keyleakage-storage-cost regions are derived for a generalization of a classic two-terminal key agreement model with an eavesdropper that observes a sequence that is correlated with the sequences observed by the legitimate terminals. The additions to the model are that the encoder observes a noisy version of a remote source, and the noisy output and the remote source output together with an action sequence are given as inputs to the measurement channel at the decoder. Thus, correlation is introduced between the noise components on the encoder and decoder measurements. The model with a secret key generated by an encoder is extended to the randomized models, where a secret-key is embedded to the encoder. The results are relevant for several user and device authentication scenarios including physical and biometric identifiers with multiple measurements that provide diversity and multiplexing gains. To illustrate the behavior of the rate region, achievable (secret-key rate, storage-rate, cost) tuples are given for binary identifiers and measurement channels that can be represented as a mixture of binary symmetric subchannels. The gains from using an action sequence such as a large secret-key rate at a significantly small hardware cost, are illustrated to motivate the use of low-complexity transform-coding algorithms with cost-constrained actions.

arXiv:2001.00847•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•13 citations

Controllable Key Agreement With Correlated Noise

Onur Günlü, Rafael F. Schaefer

The problem of secret-key-based authentication under privacy and storage constraints on the source sequence is considered. Identifier measurement channels during authentication are assumed to be controllable via a cost-constrained action sequence. Inner and outer bounds for the key-leakage-storage-cost regions are derived for a generalization of the classic two-terminal key agreement model. Additions to the model are that the encoder observes a noisy version of a remote source, and this noisy output and the remote source output together with an action sequence are given as inputs to the measurement channel at the decoder. Thus, correlation is introduced between the noise components on the encoder and decoder measurements. The model with a key generated by an encoder is extended to the randomized models, where a key is embedded to the encoder. The results are relevant for several user and device authentication scenarios including physical and biometric identifiers with multiple measurements that provide diversity and multiplexing gains. Achievable (key, storage, cost) tuples are evaluated for binary identifiers and measurement channels represented as a mixture of binary symmetric subchannels. Significant gains from using an action sequence are illustrated to motivate the use of low-complexity transform-coding algorithms with cost-constrained actions.

IEEE Journal on Selected Areas in Information Theory•Jan 25, 2021•6 citations

Secret-Key Generation with PUFs and Biometric Identifiers for Compound Authentication Channels

Vamoua Yachongka, Rémi A. Chou

In this study, we investigate the fundamental limits of secret-key generation with physical identifiers for compound authentication channels. Our contributions in this paper are the derivations of inner and outer bounds on the optimal tradeoff of secret-key, storage, and privacy-leakage rates for general discrete sources, and we show that these bounds are tight for Gaussian sources. In special cases, our characterizations reduce to existing results derived in previous works.

IEEE Information Theory Workshop (ITW)•Nov 24, 2024•2 citations

Secret-Key Generation From Private Identifiers Under Channel Uncertainty

Vamoua Yachongka, Rémi A. Chou

This study investigates secret-key generation for device authentication using physical identifiers, such as responses from physical unclonable functions (PUFs). The system includes two legitimate terminals (encoder and decoder) and an eavesdropper (Eve), each with access to different measurements of the identifier. From the device identifier, the encoder generates a secret key, which is securely stored in a private database, along with helper data that is saved in a public database accessible by the decoder for key reconstruction. Eve, who also has access to the public database, may use both her own measurements and the helper data to attempt to estimate the secret key and identifier. Our setup focuses on authentication scenarios where channel statistics are uncertain, with the involved parties employing multiple antennas to enhance signal reception. Our contributions include deriving inner and outer bounds on the optimal trade-off among secret-key, storage, and privacy-leakage rates for general discrete sources, and showing that these bounds are tight for Gaussian sources.

arXiv:2503.08632•IEEE Transactions on Information Forensics and Security•Jan 1, 2025•4 citations

Secret-Key Agreement Using Physical Identifiers for Degraded and Less Noisy Authentication Channels

Vamoua Yachongka, Hideki Yagi, Hideki Ochiai

Secret-key agreement based on biometric or physical identifiers is a promising security protocol for authenticating users or devices with small chips and has been extensively studied recently. Kittichokechai and Caire (2015) investigated the optimal trade-off in a secret-key agreement model with physical identifiers, where the structure of the authentication channels is similar to the wiretap channels, from information theoretic approaches. Later, the model was extended by Günlü et al. (2018) introducing noise in the enrollment phase and cost-constrained actions at the decoder. The results of these studies show that two auxiliary random variables are involved in the expressions of the optimal rate regions of secret-key, storage, and privacy-leakage rates. However, with these two auxiliary random variables, the complexity of computing the rate region may be prohibitively high. Due to this problem, we are interested in exploring classes of authentication channels that need only one auxiliary random variable in the capacity region expression for discrete source settings. The result shows for the class of degraded and less noisy authentication channels, a single auxiliary random variable is sufficient to express the capacity region of the model. As an example, we also derive the capacity region of secret-key, storage, and privacy-leakage rates for binary sources. Furthermore, the capacity region for scalar Gaussian sources is derived under Gaussian authentication channels.

arXiv:2208.10478•IEEE Information Theory Workshop (ITW)•Nov 1, 2022•3 citations
The problem of secret-key based authentication under a privacy constraint on the source sequence is considered. The identifier measurements during authentication are assumed to be controllable via a cost-constrained "action" sequence. Single-letter characterizations of the optimal trade-off among the secret-key rate, storage rate, privacy-leakage rate, and action cost are given for the four problems where noisy or noiseless measurements of the source are enrolled to generate or embed secret keys. The results are relevant for several user-authentication scenarios including physical and biometric authentications with multiple measurements. Our results include, as special cases, new results for secret-key generation and embedding with action-dependent side information without any privacy constraint on the enrolled source sequence.
We consider the problem of secret key-based authentication under a privacy constraint on the enrolled source data. The user's measurement in the authentication phase is assumed to be controllable via a cost-constrained “action” sequence. We provide a single-letter characterization of the optimal tradeoff among the secret key rate, storage rate, leakage rate, and action cost. The result can be relevant for several user-authentication scenarios including hardware-based and biometric authentication with multiple measurements. Moreover, our result includes, as a special case, a new result for secret-key generation with action-dependent side information where there is no privacy constraint on the source sequence.
The problem of secret-key based authentication under privacy and storage constraints on the source sequence is considered. The identifier measurement channels during authentication are assumed to be controllable via a cost-constrained action sequence. Single-letter inner and outer bounds for the keyleakage-storage-cost regions are derived for a generalization of a classic two-terminal key agreement model with an eavesdropper that observes a sequence that is correlated with the sequences observed by the legitimate terminals. The additions to the model are that the encoder observes a noisy version of a remote source, and the noisy output and the remote source output together with an action sequence are given as inputs to the measurement channel at the decoder. Thus, correlation is introduced between the noise components on the encoder and decoder measurements. The model with a secret key generated by an encoder is extended to the randomized models, where a secret-key is embedded to the encoder. The results are relevant for several user and device authentication scenarios including physical and biometric identifiers with multiple measurements that provide diversity and multiplexing gains. To illustrate the behavior of the rate region, achievable (secret-key rate, storage-rate, cost) tuples are given for binary identifiers and measurement channels that can be represented as a mixture of binary symmetric subchannels. The gains from using an action sequence such as a large secret-key rate at a significantly small hardware cost, are illustrated to motivate the use of low-complexity transform-coding algorithms with cost-constrained actions.
The problem of secret-key-based authentication under privacy and storage constraints on the source sequence is considered. Identifier measurement channels during authentication are assumed to be controllable via a cost-constrained action sequence. Inner and outer bounds for the key-leakage-storage-cost regions are derived for a generalization of the classic two-terminal key agreement model. Additions to the model are that the encoder observes a noisy version of a remote source, and this noisy output and the remote source output together with an action sequence are given as inputs to the measurement channel at the decoder. Thus, correlation is introduced between the noise components on the encoder and decoder measurements. The model with a key generated by an encoder is extended to the randomized models, where a key is embedded to the encoder. The results are relevant for several user and device authentication scenarios including physical and biometric identifiers with multiple measurements that provide diversity and multiplexing gains. Achievable (key, storage, cost) tuples are evaluated for binary identifiers and measurement channels represented as a mixture of binary symmetric subchannels. Significant gains from using an action sequence are illustrated to motivate the use of low-complexity transform-coding algorithms with cost-constrained actions.
This study investigates secret-key generation for device authentication using physical identifiers, such as responses from physical unclonable functions (PUFs). The system includes two legitimate terminals (encoder and decoder) and an eavesdropper (Eve), each with access to different measurements of the identifier. From the device identifier, the encoder generates a secret key, which is securely stored in a private database, along with helper data that is saved in a public database accessible by the decoder for key reconstruction. Eve, who also has access to the public database, may use both her own measurements and the helper data to attempt to estimate the secret key and identifier. Our setup focuses on authentication scenarios where channel statistics are uncertain, with the involved parties employing multiple antennas to enhance signal reception. Our contributions include deriving inner and outer bounds on the optimal trade-off among secret-key, storage, and privacy-leakage rates for general discrete sources, and showing that these bounds are tight for Gaussian sources.
Secret-key agreement based on biometric or physical identifiers is a promising security protocol for authenticating users or devices with small chips and has been extensively studied recently. Kittichokechai and Caire (2015) investigated the optimal trade-off in a secret-key agreement model with physical identifiers, where the structure of the authentication channels is similar to the wiretap channels, from information theoretic approaches. Later, the model was extended by Günlü et al. (2018) introducing noise in the enrollment phase and cost-constrained actions at the decoder. The results of these studies show that two auxiliary random variables are involved in the expressions of the optimal rate regions of secret-key, storage, and privacy-leakage rates. However, with these two auxiliary random variables, the complexity of computing the rate region may be prohibitively high. Due to this problem, we are interested in exploring classes of authentication channels that need only one auxiliary random variable in the capacity region expression for discrete source settings. The result shows for the class of degraded and less noisy authentication channels, a single auxiliary random variable is sufficient to express the capacity region of the model. As an example, we also derive the capacity region of secret-key, storage, and privacy-leakage rates for binary sources. Furthermore, the capacity region for scalar Gaussian sources is derived under Gaussian authentication channels.