Results 221 to 230 of about 12,867 (247)
Some of the next articles are maybe not open access.
Optimal Pilots for Maximal Capacity of Secret Key Generation
2019 IEEE Global Communications Conference (GLOBECOM), 2019Through a wireless channel, two users can transmit pilot signals to each other, and then utilize the received signals to agree upon a secret key through communications in a public channel without leaking any secret about this key to anyone else. This paper addresses the optimization of the two pilots to maximize the capacity of secret key generation ...
Qiping Zhu, Yingbo Hua
openaire +1 more source
On the Computability of the Secret Key Capacity under Rate Constraints
ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2019Secret key generation refers to the problem of generating a common secret key without revealing any information about it to an eaves-dropper. All users observe correlated components of a common source and can further use a rate-limited public channel for discussion which is open to eavesdroppers.
Holger Boche +2 more
openaire +1 more source
Secret Key Capacity for Optimally Correlated Sources Under Sampling Attack
IEEE Transactions on Information Theory, 2006The capacity for secret key agreement for permutation-invariant and symmetric sources under a sampling attack is investigated. The supremum of the normalized secret key capacity is introduced, where the supremum is taken over all permutation-invariant sources or all symmetric sources and the normalized secret key capacity is the secret key capacity ...
J Muramatsu
exaly +2 more sources
Secret key capacity: Talk or keep silent?
2015 IEEE International Symposium on Information Theory (ISIT), 2015The problem of when all terminals must talk to achieve the secrecy capacity in the multiterminal source model is investigated. Two conditions under which respectively a given terminal does not need to and must talk to achieve the secrecy capacity are characterized.
Huishuai Zhang +2 more
openaire +1 more source
Secret key-private key generation over three terminals: Capacity region
2014 IEEE International Symposium on Information Theory, 2014The 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 ...
Huishuai Zhang +3 more
openaire +1 more source
The sender-excited secret key agreement model: Capacity theorems
2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2011We consider the fundamental limits of the secret key generation problem when the sources are excited by the sender. In many practical communication settings, the channel may be influenced by the parties involved. Similar to recent works on probing capacity and channels with action-dependent states, our system model captures such a scenario.
Tzu-Han Chou +2 more
openaire +1 more source
The Sender-Excited Secret Key Agreement Model: Capacity, Reliability, and Secrecy Exponents [PDF]
IEEE Transactions on Information Theory, 2015 We consider the secret key generation problem when sources are randomly excited by the sender and there is a noiseless public discussion channel. Our setting is thus similar to recent works on channels with action-dependent states where the channel state may be influenced by some of the parties involved.
Stark Draper, Vincent Tan
exaly +3 more sources
Physical Layer Secret Key Capacity of Two Moving Terminals
2017 IEEE 85th Vehicular Technology Conference (VTC Spring), 2017When extracting secret key from shared wireless channel between two legitimate moving terminals, its capacity is affected by the time difference of channel sampling, terminal's mobility, and additive noise. In order to quantitatively analyze their effects, a closed-form solution to physical layer secret key capacity in the time domain is derived over ...
Xu Wang +3 more
openaire +1 more source
On the secret key capacity of the Harary graph PIN model
2013 National Conference on Communications (NCC), 2013A pairwise independent network (PIN) model consists of pairwise secret keys (SKs) distributed among m terminals. The goal is to generate, through public communication among the terminals, a group SK that is information-theoretically secure from an eavesdropper.
Navin Kashyap +2 more
openaire +1 more source
Asymptotic converse bound for secret key capacity in hidden Markov model
2017 IEEE International Symposium on Information Theory (ISIT), 2017Secret key establishment from common randomness has been traditionally investigated under cartain limiting assumptions, of which the most ubiquitous appears to be that the information available to all parties comes in the form of independent and identically distributed (i.i.d.) samples of some correlated random variables.
Mohammad Reza Khalili Shoja +4 more
openaire +1 more source