Results 251 to 260 of about 13,748 (278)

Asymptotic converse bound for secret key capacity in hidden Markov model

2017 IEEE International Symposium on Information Theory (ISIT), 2017
Secret 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, George Traian Amariucai, Zhengdao Wang, Shuangqing Wei, Jing Deng 0001   +4 more
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

On the Secret-Key Capacity Over Multipath Fading Channel

IEEE Transactions on Information Forensics and Security
Jibo Wei, Xiaoran Liu, Jun Xiong
exaly   +2 more sources

The secret key capacity for multiple terminals

Proceedings of the IEEE Information Theory Workshop, 2003
We 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

Secret Key and Private Key Capacities Over an Unauthenticated Public Channel

2019 IEEE Conference on Communications and Network Security (CNS), 2019
In 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

Optimal Pilots for Maximal Capacity of Secret Key Generation

2019 IEEE Global Communications Conference (GLOBECOM), 2019
Through 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

Secret key capacity: Talk or keep silent?

2015 IEEE International Symposium on Information Theory (ISIT), 2015
The 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, Yingbin Liang, Lifeng Lai   +2 more
openaire   +1 more source

Secret key-private key generation over three terminals: Capacity region

2014 IEEE International Symposium on Information Theory, 2014
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 ...
Huishuai Zhang, Lifeng Lai, Yingbin Liang, Hua Wang   +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), 2011
We 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, Vincent Y. F. Tan, Stark C. Draper   +2 more
openaire   +1 more source

Physical Layer Secret Key Capacity of Two Moving Terminals

2017 IEEE 85th Vehicular Technology Conference (VTC Spring), 2017
When 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, Mingliang Li, Liang Jin, Kaizhi Huang   +3 more
openaire   +1 more source

On the secret key capacity of the Harary graph PIN model

2013 National Conference on Communications (NCC), 2013
A 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, Manuj Mukherjee, Yogesh Sankarasubramaniam   +2 more
openaire   +1 more source