Results 211 to 220 of about 8,083 (242)

AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT

International Journal of Foundations of Computer Science, 2011
Assume that there are players and an eavesdropper Eve, where several pairs of players have shared secret keys beforehand. We regard each player as a vertex of a graph and regard each pair of players sharing a key as an edge. Consider the case where Eve knows some of the keys according to a certain probability distribution.
Takaaki Mizuki, Satoru Nakayama, Hideaki Sone   +2 more
openaire   +1 more source

Agreement of a restricted secret key

2012 IEEE International Symposium on Information Theory Proceedings, 2012
A secret key agreement problem is proposed with the additional restriction that the key is a function of a given secret source. An inner bound to the achievable rates, error and secrecy exponents is derived. The maximum key rate strongly achievable with positive exponents is characterized. The result leads to class of admissible restrictions on the key
openaire   +1 more source

Secret key agreement under sampling attack

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005
This paper considers the capacity for secret key agreement under a sampling attack. Given the number of the eavesdropper's sources, we evaluate the secret key capacity bound which is defined as the supremum of the secret key capacity divided by the description length of the alphabet, where the supremum is taken over a set of probability distributions ...
Jun Muramatsu
exaly   +2 more sources

From Chaos to Secret Key Agreement

2011 IEEE International Conference on Communications (ICC), 2011
A chaos-based key generation scheme is proposed and its performance analyzed. The method, the logistic map scheme, is applicable for use on wireless networks because it does not require devices to engage in computationally intensive algorithms. In addition, the method achieves reliability from the perspective of the communication agents, as well as ...
openaire   +1 more source

Secret key agreement: General capacity and second-order asymptotics [PDF]

2014 IEEE International Symposium on Information Theory, 2014
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, Himanshu Tyagi, Masahito Hayashi   +2 more
exaly   +3 more sources

Linear perfect secret key agreement

2011 IEEE Information Theory Workshop, 2011
A linear scheme is proposed for multiterminal secret key agreement under a private finite linear source model with public discussion. With a wiretapper observing the public discussion and a subset of the source components, it attains the secrecy capacity perfectly and non-asymptotically with a finite block length.
openaire   +1 more source

Multivariate Mutual Information Inspired by Secret-Key Agreement

Proceedings of the IEEE, 2015
The capacity for multiterminal secret-key agreement inspires a natural generalization of Shannon’s mutual information from two random variables to multiple random variables. Under a general source model without helpers, the capacity is shown to be equal to the normalized divergence from the joint distribution of the random sources to the product of ...
Tie Liu, Ali Al-Bashabsheh, Chung Chan   +2 more
exaly   +2 more sources

Delay of linear perfect secret key agreement

2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2011
Upper bounds are given on the block length required to attain the secrecy capacity by linear perfect secret key agreement. The bounds are universal to the source statistics and grow polynomially in the size of the network when the number of helpers is constant.
openaire   +1 more source

Conference Key Agreement from Secret Sharing

1999
The work proposes new conference key agreement protocols based on secret sharing. We discuss roles of the dealer and recovery algorithms in the trust structure which is the necessary condition for any key establishment protocol to achieve the intended security goals.
Chih-Hung Li, Josef Pieprzyk
openaire   +1 more source

A Secret-Key Exponential Key Agreement Protocol with Smart Cards

2007
The smart card based remote user authentication and key agreement protocol is a very practical solution to create a secure distributed computer environment. In this paper, we propose a smart card based secret-key exponential key agreement protocol called SEKA, which provides mutual authentication and key agreement over an insecure channel between user ...
Eun-Jun Yoon, Kee-Young Yoo
openaire   +1 more source