Results 211 to 220 of about 12,867 (247)
Common Information and Secret Key Capacity [PDF]
We study the generation of a secret key of maximum rate by a pair of terminals observing correlated sources and with the means to communicate over a noiseless public com- munication channel. Our main result establishes a structural equivalence between the generation of a maximum rate secret key and the generation of a common randomness that renders the
Himanshu Tyagi
exaly +3 more sources
Noncoherent Capacity of Secret-Key Agreement With Public Discussion [PDF]
We study the noncoherent capacity of secret-key agreement with public discussion over independent identically distributed (i.i.d.) Rayleigh fading wireless channels, where neither the sender nor the receivers have access to instantaneous channel state information (CSI). We present two results.
Zouheir Rezki, Mohamed-Slim Alouini
exaly +3 more sources
Capacity of a shared secret key [PDF]
Shannon theoretic shared secret key generation by multiple terminals is considered for a source model in which the components of a discrete memoryless multiple source and a noiseless public channel of unlimited capacity are available for accomplishing this goal.
Prakash Narayan
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Secret Key Capacity and Advantage Distillation Capacity
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006Secret key agreement is a procedure for agreeing on a secret key by exchanging messages over a public channel when a sender, a legitimate receiver and an eavesdropper have access to correlated sources. Maurer, IEEE Trans. Inf. Theory 1993 defined secret key capacity, which is the least upper bound of the key generation rate of the secret key agreement,
Jun Muramatsu, Kazuyuki Yoshimura
exaly +2 more sources
Wiretap Secret Key Capacity of Tree-PIN [PDF]
We consider the problem of multiterminal secret key agreement (SKA) in wiretapped source model where terminals have access to samples of correlated random variables from a publicly known joint probability distribution. The adversary has access to a side information variable, that is correlated with terminals' variables.
Reihaneh Safavi-Naini
exaly +3 more sources
Secret key agreement: General capacity and second-order asymptotics [PDF]
We revisit the problem of secret key agreement using interactive public communication for two parties and propose a new secret key agreement protocol. The protocol attains the secret key capacity for general observations and attains the second-order asymptotic term in the maximum length of a secret key for independent and identically distributed ...
Shun Watanabe +2 more
exaly +3 more sources
The secret key capacity for multiple terminals
Proceedings of the IEEE Information Theory Workshop, 2003We consider the problem of characterizing the secret key (SK)-capacity [Maurer 1993, Ahlswede-Csiszar 1993, Csiszar-Narayan 2000] for an arbitrary number of terminals, each of which observes a distinct component of a discrete memoryless multiple source, with unconstrained public communication allowed between these terminals.
Imre Csiszár, Prakash Narayan
openaire +1 more source
The Capacity Region of the Source-Type Model for Secret Key and Private Key Generation [PDF]
The problem of simultaneously generating a secret key (SK) and private key (PK) pair among three terminals via public discussion is investigated, in which each terminal observes a component of correlated sources. All three terminals are required to generate a common secret key concealed from an eavesdropper that has access to public discussion, while ...
Lifeng Lai +2 more
exaly +3 more sources
On the Secret-Key Capacity Over Multipath Fading Channel
IEEE Transactions on Information Forensics and SecurityDongtang Ma, Xiaoran Liu, Jun Xiong
exaly +2 more sources
Secret Key and Private Key Capacities Over an Unauthenticated Public Channel
2019 IEEE Conference on Communications and Network Security (CNS), 2019In this paper, the problem of key generation over an unauthenticated public channel in a network setup is considered. The considered model consists of four terminals: two legitimate terminals who need to share a key, a helper and an active adversary.
Wenwen Tu, Lifeng Lai
openaire +1 more source

