Secret Key Agreement by Soft-decision of Signals in Gaussian Maurer’s Model∗Secret Key Agreement • November 6th, 2018
Secret-key Agreement with Channel State Information at the TransmitterSecret-Key Agreement • October 23rd, 2018
Secret-Key Agreement over Unauthenticated Public Channels – Part III: Privacy AmplificationSecret-Key Agreement • March 24th, 2022
nection with typical sequences, i.e., almost uniform dis- tributions. (Note that for uniform distributions, all the introduced entropy measures are equal.)
Secret Key Agreement Using Conferencing in State- Dependent Multiple Access Channels with An EavesdropperSecret Key Agreement • August 28th, 2018
Secret-Key Agreement over Non-Coherent Block-Fading Channels with Public DiscussionSecret-Key Agreement • August 4th, 2013
Fundamental limits of secret-key generation over a two-way, reciprocal and block fading wireless channel are investigated. Only statistical channel state information (CSI) of the main channel is assumed to be available, whereas the eavesdropper has perfect CSI of its own channel. We establish upper and lower bounds on the secret-key generation capacity with public discussion. The upper bound can be expressed as a sum of two terms — one of the terms arises due to channel reciprocity, while the other term arises due to the communication. In the limit of long coherence period, the contribution from channel reciprocity vanishes to zero, whereas the other term prevails. The lower bound involves a separation based scheme consisting of channel training followed by source emulation in each coherence block. The resulting rate also consists of the contribution from each phase. For Rayleigh fading channels, in the high signal- to-noise ratio (SNR) regime, the gap between the upper and lower bound
One-Way Secret-Key Agreement and Applications to Circuit PolarizationSecret-Key Agreement • June 11th, 2005
problem of polarizing circuits, introduced by Sahai and Vadhan in the context of statistical zero-knowledge, which we show to be equivalent to secret-key agreement as described above. This provides us both with new constructions to polarize circuits, but also proves that the known constructions work for parameters which are tight.
Abstract—For the multiterminal secret key agreement prob- lem, new single- letter lower bounds are obtained on the public discussion rate required to achieve any given secret key rate below the secrecy capacity. The results apply to general source...Secret Key Agreement • September 5th, 2018
If user 2 reveals F := Xa ⊕ Xb in public so that everyone can observe it, then user 3 can recover Xa as F ⊕ Xb. K := Xa is called a secret key bit generated by the public discussion
Secret key agreement from correlated data, with no prior informationSecret Key Agreement • January 9th, 2020
A fundamental question that has been studied in cryptography and in information theory is whether two parties can communicate confidentially using exclusively an open channel. We consider the model in which the two parties hold inputs that are correlated in a certain sense. This model has been studied extensively in information theory, and communication protocols have been designed which exploit the correlation to extract from the inputs a shared secret key. However, all the existing protocols are not universal in the sense that they require that the two parties also know some attributes of the correlation. In other words, they require that each party knows something about the other party’s input. We present a protocol that does not require any prior additional information. It uses space- bounded Kolmogorov complexity to measure correlation and it allows the two legal parties to obtain a common key that looks random to an eavesdropper that observes the communication and is restricted t
Unconditionally Secure Secret-Key Agreement and the Intrinsic Conditional Mutual InformationSecret-Key Agreement • January 26th, 2008
Note that > 1 is not possible. It is easy to see that the random variable Z can be obtained by sending Z over a channel speci ed by some conditional probability distribution PZjZ . We
Secret key agreement for hypergraphical sources with limited total discussionSecret Key Agreement • November 27th, 2019
respectively for the unconstrained secrecy capacity with un- bounded discussion rate, and the communication complexity to attain the unconstrained the secrecy capacity.
Secret Key Agreement from Vector Gaussian Sources by Rate Limited Public CommunicationSecret Key Agreement • December 8th, 2024
Abstract—We investigate the secret key agreement from corre- lated vector Gaussian sources in which the legitimate parties can use the public communication with limited rate. For the class of protocols with the one-way public communication, we show that the optimal trade-off between the rate of key generation and the rate of the public communication is characterized as an optimization problem of a Gaussian random variable. The characterization is derived by using the enhancement technique introduced by Weingarten et. al. for MIMO Gaussian broadcast channel.
Secret Key Agreement: General CapacitySecret Key Agreement • July 31st, 2021
Secret-Key Agreement over Non-Coherent Block-Fading Channels with Public DiscussionSecret-Key Agreement • December 26th, 2014
Motivated by recent interest in physical-layer secret-key generation over wireless fading channels, we study the non-coherent secret-key generation capacity of a block-fading wireless channel with channel reciprocity and bi-directional (two-way) commu- nication. We assume a non-coherent main channel, i.e., the realization of channel gains on the main channel is not known to any terminal. The eavesdropper is assumed to have both perfect CSI of its own channel and orthogonal observations from the forward and backward channels. As our main result we establish new upper and lower bounds on the secret-key generation capacity with public discussion, which are structurally similar.
Ueli M. Maurer 2, Member, IEEESecret Key Agreement • November 7th, 2007
Abstract. The problem of generating a shared secret key S by two parties knowing de- pendent random variables X and Y , respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution PXY Z , can also receive all messages exchanged by the two parties over a public channel. The goal of a protocol is that the enemy obtains at most a negligible amount of information about S. Upper bounds on H(S) as a function of PXY Z are presented. Lower bounds on the rate H(S)=N (as N ! 1) are derived for the case where X = [X1; : : : ; XN ], Y = [Y1; : : : ; YN ] and Z = [Z1; : : : ; ZN ] result from N independent executions of a random experiment generating Xi; Yi and Zi, for i = 1; : : :; N . In particular it is shown that such secret key agreement is possible for a scenario where all three parties receive the output of a binary symmetric source over independent binary symmetric
Secret-key Agreement over Spatially Correlated Fast-Fading Multiple-Antenna Channels with Public DiscussionSecret-Key Agreement • April 19th, 2015
A bound on secret key length via binary hypothesis testingSecret Key Agreement • February 13th, 2014
Secret Key Agreement Using Correlated Sources over the Generalized Multiple Access ChannelSecret Key Agreement • October 31st, 2018
Abstract—A secret key agreement setup between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. The three users observe i.i.d. outputs of correlated sources and there is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 for communication between the users. The secret key agreement is established using the correlated sources and the GDMMAC. In this setup, inner and outer bounds of the secret key capacity region are investigated. Moreover, for a special case where the channel inputs and outputs and the sources form Markov chains in some order, the secret key capacity region is derived. Also a Gaussian case is considered in this setup.
Secret-Key Agreement over a Non-Coherent Block-Fading MIMO Wiretap ChannelSecret-Key Agreement • June 18th, 2012
This rate is achieved by quantizing Bob’s observations (YB, Hˆ B) into a quantization codebook generated by auxil- iary random variables (UY, UH) and using Wyner-Ziv coding
Secret-Key Agreement Using Physical Identifiers for Degraded and Less Noisy Authentication ChannelsSecret-Key Agreement • November 15th, 2022
Abstract—Secret-key agreement based on biometric or physical identifiers is a promising security protocol for authenticating users or devices with small chips due to its lightweight security. In previous studies, the fundamental limits of such a protocol were analyzed, and the results showed that two auxiliary random variables were involved in the capacity region expressions. How- ever, with these two auxiliary random variables, the complexity of computing the capacity regions may be prohibitively high. To deal with this problem, we explore classes of authentication channels that require only one auxiliary random variable in the expressions of the capacity regions. It is revealed that for the classes of degraded and less noisy authentication channels, a single auxiliary random variable is sufficient to express the capacity regions. As specific examples, we derive the closed-form expressions for binary and Gaussian sources. Also, numerical calculations for Gaussian sources are provided
Università degli Studi di PadovaSecret Key Agreement • July 31st, 2013
This article is made available under terms and conditions applicable to Open Access Guidelines, as described at http://www.unipd.it/download/file/fid/55401 (Italian only)
Ergodic Secret-Key Agreement over Spatially Correlated Multiple-Antenna Channels with Public DiscussionSecret-Key Agreement • March 22nd, 2015
Secret Key Agreement:Secret Key Agreement • August 5th, 2020
SECRET KEY AGREEMENT ON WIRETAP CHANNELS WITH TRANSMITTER SIDE INFORMATIONSecret Key Agreement • June 30th, 2010
Secret-Key Agreement over Spatially Correlated Multiple-Antenna Channels in the Low-SNR RegimeSecret-Key Agreement • August 4th, 2015
