Unconditional security in quantum cryptography

Mayers, Dominic

doi:10.1145/382780.382781

Cited by 854 publications

(662 citation statements)

References 18 publications

(44 reference statements)

Supporting

Mentioning

652

Contrasting

Unclassified

Order By: Relevance

“…Such a bound turns out to be very pessimistic: this is the price to pay for its generality 5 . When considering some specific protocols, there can be other, more efficient ways to obtain i.i.d.…”

Section: Security Analysis Against General Attacksmentioning

confidence: 99%

See 1 more Smart Citation

Security Bounds for Quantum Cryptography with Finite Resources

Scarani

Renner

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. A practical quantum key distribution (QKD) protocol necessarily runs in finite time and, hence, only a finite amount of communication is exchanged. This is in contrast to most of the standard results on the security of QKD, which only hold in the limit where the number of transmitted signals approaches infinity. Here, we analyze the security of QKD under the realistic assumption that the amount of communication is finite. At the level of the general formalism, we present new results that help simplifying the actual implementation of QKD protocols: in particular, we show that symmetrization steps, which are required by certain security proofs (e.g., proofs based on de Finetti's representation theorem), can be omitted in practical implementations. Also, we demonstrate how two-way reconciliation protocols can be taken into account in the security analysis. At the level of numerical estimates, we present the bounds with finite resources for "device-independent security" against collective attacks.

show abstract

Section: Security Analysis Against General Attacksmentioning

confidence: 99%

“…Most unconditional security proofs of QKD have provided an asymptotic bound for the secret key rate r, valid only in the limit of infinitely long keys [4,5,6,7,8]. This reads in general [9] r = S(X|E) − H(X|Y ) ,…”

Section: Introductionmentioning

confidence: 99%

Security Bounds for Quantum Cryptography with Finite Resources

Scarani

Renner

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This framework also allows to carry out the security analysis with a finite number of signals [42], as it was also the case in the earlier works of Mayers [35] and Biham et. al.…”

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

confidence: 90%

“…In contrast to public-key cryptography, it has been proven to be unconditionally secure, i.e. secure irrespectively of the computing power that may be used by an attacker [35,34,36].…”

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

158

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

“…On the other hand, quantum cryptography and quantum communication have made rapid progress already with the commercial deployment of the first secure cryptography systems [12,13]. It has been mathematically proven that quantum cryptographic systems are unconditionally secure [14] but this doesn't provide a formal assurance to the security when these systems are implemented as a whole unit which may also include classical components. Therefore, there is still the need to develop techniques that verify the correctness of these systems.…”

Section: Introductionmentioning

confidence: 99%

Equational Reasoning About Quantum Protocols

Puthoor

2015

Reversible Computation

View full text Add to dashboard Cite

Abstract. Communicating Quantum Processes (CQP) is a quantum process calculus that applies formal techniques from classical computer science to concurrent and communicating systems that combine quantum and classical computation. By employing the theory of behavioural equivalence between processes, it is possible to verify the correctness of a system in CQP. The equational theory of CQP helps us to analyse quantum systems by reducing the need to explicitly construct bisimulation relations. We add three new equational axioms to the existing equational theory of CQP, which helps us to analyse various quantum protocols by proving that the implementation and specification are equivalent. We summarise the necessary theory and demonstrate its application in the analysis of quantum secret sharing. Also, we illustrate the approach by verifying other interesting and important practical quantum protocols such as superdense coding, quantum error correction and remote CNOT.

show abstract

Unconditional security in quantum cryptography

Cited by 854 publications

References 18 publications

Security Bounds for Quantum Cryptography with Finite Resources

Security Bounds for Quantum Cryptography with Finite Resources

Using quantum key distribution for cryptographic purposes: A survey

Equational Reasoning About Quantum Protocols

Contact Info

Product

Resources

About