Journal of China Institute of Communications

The secret-key rate of unconditionally-secure secret-key agreement based on smooth entropy

Ma Hua

Published Jan 1, 2002• 0 citations

Abstract

This paper investigates secret-key rate when two legitimate parties agree an unconditionally- secure secret-key based on smooth entropy, the condition under which two legitimate parties can agree unconditionally-secure secret-key with respect to the strong secret-key rate is given.

Related papers

Distillation of Unconditionally-Secure Secret-Key Based on Smooth Entropy

Yumin Wang

This paper investigates the effect of side-information,obtained by the opponent through an initial reconciliation step,on the size of the secret-key that can be distilled safely by subsequent privacy amplification in uncoditionally-secure secret-key agreement protocol based on smooth entropy,and obtains the size of the secret-key with some probability.

Dianzi xuebaoJan 1, 20012 citations

Unconditionally secure secret key agreement and the intrinsic conditional mutual information

Ueli M. Maurer, Stefan Wolf

This paper is concerned with secret-key agreement by public discussion: two parties Alice and Bob and an adversary Eve have access to independent realizations of random variables X , Y , and Z, respectively, with joint distribution PXY Z . The secret key rate S(X ; Y jjZ) has been defined as the maximal rate at which Alice and Bob can generate a secret key by communication over an insecure, but authenticated channel such that Eve's information about this key is arbitrarily small. We define a new conditional mutual information measure, the intrinsic conditional mutual information between X and Y when given Z, denoted by I(X ; Y#Z), which is an upper bound on S(X ; Y jjZ). The special scenarios where X , Y , and Z are generated by sending a binary random variable R, for example a signal broadcast by a satellite, over independent channels, or where Z is generated by sending X and Y over erasure channels, are analyzed. In the first scenario it can be shown that the secret key rate is str...

May 1, 19971 citation

Unconditionally secure key agreement and the intrinsic conditional information

Ueli M. Maurer, Stefan Wolf

This paper is concerned with secret-key agreement by public discussion. Assume that two parties Alice and Bob and an adversary Eve have access to independent realizations of random variables X, Y, and Z, respectively, with joint distribution P/sub XYZ/. The secret-key rate S(X;Y/spl par/Z) has been defined as the maximal rate at which Alice and Bob can generate a secret key by communication over an insecure, but authenticated channel such that Eve's information about this key is arbitrarily small. We define a new conditional mutual information measure, the intrinsic conditional mutual information between S and Y when given Z, denoted by I(X;Y/spl darr/Z), which is an upper bound on S(X;Y/spl par/Z). The special scenarios are analyzed where X, Y, and Z are generated by sending a binary random variable R, for example a signal broadcast by a satellite, over independent channels, or two scenarios in which Z is generated by sending X and Y over erasure channels. In the first two scenarios it can be shown that the secret-key rate is strictly positive if and only if I(X;Y/spl darr/Z) is strictly positive. For the third scenario, a new protocol is presented which allows secret-key agreement even when all the previously known protocols fail.

IEEE Transactions on Information TheoryMar 1, 1999274 citations

Distillation of unconditionally-secure secret-key against active adversaries based on Rényi entropy and extractor

Weiyi Yin

This paper investigates the distillation of unconditionally-secure secret-key against active adversaries over an insecure and not even authentic channel based on Renyi entropy and extractor. First we discuss unconditionally secure authentication based on Renyi entropy where the common key is only partially secret, then the authentication method is used to secret-key agreement against active opponents and obtains Renyi entropy of the secret-key with some probability.

Journal of China Institute of CommunicationsJan 1, 20020 citations

Distillation of Unconditionally Secure Secret Key

Liu Sheng

With the help of Universal hash and Renyi entropy,this paper shows the relation between the length of the distilled secret key and information reconcilition privacy amplification in unconditionally secure secret key agreement protocol.

Dianzi xuebaoJan 1, 19990 citations

Information-theoretical Secret-key agreement and Bound information

Martin Kreißig

One big problem of the communication between two parties is the secrecy. That means how\nmuch information a third party can obtain by intercepting the messages transmitted from\none honest party to the other one. Therefore cryptography offers a wide range of protocols\nto ensure security with assumptions on the eavesdropper. So one was looking for an\ninformation-theoretical description of the scenario to get unconditional secure communication.\nIn this scenario we are considering two honest parties that want to communicate over\nan authenticated channel that the eavesdropper is wiretapping. This scenario introduced the definition of the intrinsic information and the secret-key rate which are a measure of the secrecy in this setting. Later because of strong analogies to quantum mechanics it turned out that this description was lacking a phenomena called bound information which is the disability of a probability distribution to create a secret-key even though it has predicted secrecy.\nNearly ten years of research have shown the existence of bound information for the multipartite case where several parties are communicating but not yet for the bipartite case.\nHence the approach of non-distillability seems a very promising one to find this conjecture.\nMotivated by this the approach we implemented this tool and simulated some distributions that have conjectured bound information. Thereby we improved the tool to reduce its calculationtime and to get closer to the aim.

Feb 25, 20091 citation