Secret-key agreement over unauthenticated public channels-part II: the simulatability condition

IEEE Transactions on Information TheoryPublished 1 April 2003

Ueli Maurer, Stefan Wolf

DOI10.1109/tit.2003.809560

Source URL

Citations100

SJR quartileQ1

SJR score1.46

SNIP1.76

TL;DR

A new formalism, based on a mechanical model for representing the involved quantities, that allows for dealing with discrete joint distributions of random variables and their manipulations by noisy channels, is introduced and it is shown that this representation leads to a simple and efficient characterization of the possibility of secret-key agreement secure against active adversaries.

Abstract

For pt.I see ibid., vol.49, no.4, p.822-31(2003). In the first part, we showed that when two parties, willing to generate a secret key, but connected only by a completely insecure communication channel, have access to independent repetitions of some random experiment, then the possibility of secret-key agreement depends on a certain property, called simulatability, of the probability distribution modeling the parties' initial knowledge. More generally, the simulatability condition is important in the context of identification and authentication among parties sharing some correlated but not necessarily identical partially secret keys. Unfortunately, this condition is a priori not very useful since it is not clear how to decide efficiently whether it is satisfied or not for a given distribution P/sub XYZ/. We introduce a new formalism, based on a mechanical model for representing the involved quantities, that allows for dealing with discrete joint distributions of random variables and their manipulations by noisy channels. We show that this representation leads to a simple and efficient characterization of the possibility of secret-key agreement secure against active adversaries.

Keywords

Computer ScienceBiochemistry, Genetics and Molecular BiologyEngineering

Bell System Technical JournalThe Wire-Tap Channel

6,990 Citations1975A.D. Wyner

This paper finds the trade-off curve between R and d, assuming essentially perfect (“error-free”) transmission, and implies that there exists a Cs > 0, such that reliable transmission at rates up to Cs is possible in approximately perfect secrecy.

IEEE Transactions on Information TheorySecret key agreement by public discussion from common information

2,008 Citations1993Ueli Maurer

It is shown that such a secret key agreement is possible for a scenario in which all three parties receive the output of a binary symmetric source over independent binary symmetric channels, even when the enemy's channel is superior to the other two channels.

IEEE Transactions on Information TheoryCommon randomness in information theory and cryptography. I. Secret sharing

1,339 Citations1993Rudolf Ahlswede, Imre Csiszár

As the first part of a study of problems involving common randomness at distance locations, information-theoretic models of secret sharing (generating a common random key at two terminals, without letting an eavesdropper obtain information about this key) are considered.

IEEE Transactions on Information TheoryUnconditionally secure key agreement and the intrinsic conditional information

275 Citations1999Ueli Maurer, Stefan Wolf

A new conditional mutual information measure is defined, 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).

IEEE Transactions on Information TheorySecret-key agreement over unauthenticated public channels-part I: definitions and a completeness result

163 Citations2003Ueli Maurer, Stefan Wolf

The important special case where the legitimate partners as well as the adversary have access to the outcomes of many independent repetitions of a fixed tripartite random experiment is considered, and the result characterizing the possibility of secret-key agreement secure against active adversaries is of all-or-nothing nature.

IEEE Transactions on Information TheorySecret-key agreement over unauthenticated public channels-part III: privacy amplification

157 Citations2003Ueli Maurer, Stefan Wolf

This work considers the special case where the legitimate partners already share a mutual string which might, however, be partially known to the adversary, and proposes two protocols, one based on universal hashing and onebased on extractors, allowing for privacy amplification secure against an adversary whose knowledge about the initial partially secret string is limited to one third of the length of this string.

Lecture notes in computer scienceInformation-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion

96 Citations1997Ueli Maurer

The goal of this paper is to investigate information-theoretic security even against active adversaries with complete control over the communication channel connecting the two parties who want to agree on a secret key.

View PDF

AlgorithmicaLinking Classical and Quantum Key Agreement: Is There a Classical Analog to Bound Entanglement?

37 Citations2002Gisin, Renner +1 more

It is proved that a quantum state between two parties is entangled if and only if the classical random variables resulting from optimal measurements provide some mutual classical information between the parties.

Lecture notes in computer scienceLinking Classical and Quantum Key Agreement: Is There “Bound Information”?

36 Citations2000Nicolas Gisin, Stefan Wolf

View PDF

A property of the intrinsic mutual information

34 Citations2003Matthias Christandl, Renato Renner +1 more

It is proved a property of this information measure which, in particular, strongly simplifies its computation, which is useful for analyzing the correlation of two random variables conditioned on a third one.