Secret key agreement by public discussion from common information

Maurer, Ueli

doi:10.1109/18.256484

Cited by 1,769 publications

(1,731 citation statements)

References 12 publications

Supporting

Mentioning

1,718

Contrasting

Unclassified

Order By: Relevance

“…Christian Cachin and Ueli Maurer [16] demonstrated that CITSKA is possible in the bounded-storage model, in which the adversaries can only store a limited amount of data. Introducing the idea of advantage distillation, Maurer later generalized the previous models and showed that CITSKA is possible over a wide class of classical channels [17].…”

Section: Classical Public-key Cryptography and Secret Key Agreementmentioning

confidence: 99%

“…The existing work on (classical) secret key agreement by public discussion, studied in the framework of information-theoretic cryptography [17], has played an important role in QKD security proofs and it is interesting to see that QKD has conversely also triggered some important development in classical information-theoretic cryptography [37]. However, classical models are in general not sufficient to capture all the information that can be learnt by a quantum eavesdropper, and QKD security proofs must rely on elements of quantum information theory.…”

Section: Quantum Key Agreement -Quantum Key Distribution (Qkd)mentioning

confidence: 99%

See 1 more Smart Citation

Using quantum key distribution for cryptographic purposes: A survey

Alléaume

Branciard

Bouda

et al. 2014

Theoretical Computer Science

164

105

View full text Add to dashboard Cite

The appealing feature of quantum key distribution (QKD), from a cryptographic viewpoint, is the ability to prove the information-theoretic security (ITS) of the established keys. As a key establishment primitive, QKD however does not provide a standalone security service in its own: the secret keys established by QKD are in general then used by a subsequent cryptographic applications for which the requirements, the context of use and the security properties can vary. It is therefore important, in the perspective of integrating QKD in security infrastructures, to analyze how QKD can be combined with other cryptographic primitives.The purpose of this survey article, which is mostly centered on European research results, is to contribute to such an analysis. We first review and compare the properties of the existing key establishment techniques, QKD being one of them. We then study more specifically two generic scenarios related to the practical use of QKD in cryptographic infrastructures: 1) using QKD as a key renewal technique for a symmetric cipher over a point-to-point link ; 2) using QKD in a network containing many users with the objective of offering any-to-any key establishment service. We discuss the constraints as well as the potential interest of using QKD in these contexts. We finally give an overview of challenges relative to the development of QKD technology that also constitute potential avenues for cryptographic research.

show abstract

Section: Classical Public-key Cryptography and Secret Key Agreementmentioning

confidence: 99%

Section: Quantum Key Agreement -Quantum Key Distribution (Qkd)mentioning

confidence: 99%

Using quantum key distribution for cryptographic purposes: A survey

Alléaume

Branciard

Bouda

et al. 2014

Theoretical Computer Science

164

105

View full text Add to dashboard Cite

show abstract

“…Previous Work: Information-theoretically secure secret-key agreement from correlated information has first been proposed by Maurer in [11]. He considered a setting where Alice, Bob, and Eve hold many independent realizations of correlated random variables X, Y , and Z, respectively, with joint probability distribution P XY Z .…”

Section: Secret-key Agreementmentioning

confidence: 99%

“…For example, Wyner [20] and, subsequently, Csiszár and Körner [3] have studied a scenario where Alice and Bob are connected by a noisy channel on which an adversary has only limited access. Maurer [11] (cf. also [1]) proposed to consider a setting where a satellite broadcasts uniform random bits with low signal intensity, such that Alice, Bob, and also Eve cannot receive them perfectly.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption

Holenstein

Renner

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Secret-key agreement between two parties Alice and Bob, connected by an insecure channel, can be realized in an informationtheoretic sense if the parties share many independent pairs of correlated and partially secure bits. We study the special case where only one-way communication from Alice to Bob is allowed and where, for each of the bit pairs, with a certain probability, the adversary has no information on Alice's bit. We give an expression which, for this situation, exactly characterizes the rate at which Alice and Bob can generate secret key bits.This result can be used to analyze a slightly restricted variant of the problem of polarizing circuits, introduced by Sahai and Vadhan in the context of statistical zero-knowledge, which we show to be equivalent to secret-key agreement as described above. This provides us both with new constructions to polarize circuits, but also proves that the known constructions work for parameters which are tight.As a further application of our results on secret-key agreement, we show how to immunize single-bit public-key encryption schemes from decryption errors and insecurities of the encryption, a question posed and partially answered by Dwork, Naor, and Reingold. Our construction works for stronger parameters than the known constructions.

show abstract