Unconditionally Secure Quantum Bit Commitment is Impossible

Mayers, Dominic

doi:10.1103/physrevlett.78.3414

Cited by 625 publications

(678 citation statements)

References 7 publications

Supporting

Mentioning

663

Contrasting

Order By: Relevance

“…Since essentially no interesting two-party task can be implemented securely by a quantum protocol against unbounded quantum attacks [20,19,18,16], one typically has to put some restriction upon the dishonest player's capabilities, like to limit his quantum-storage capabilities [8,7,9,28] or the size of coherent measurements he can do [24]. Throughout, we let A and B be subfamilies of all possible strategies A and B of a dishonest Alice and a dishonest Bob, respectively.…”

Section: The Security Definitionmentioning

confidence: 99%

Composing Quantum Protocols in a Classical Environment

Fehr

Schaffner

2009

Theory of Cryptography

View full text Add to dashboard Cite

Abstract. We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple quantuminformation-theoretic conditions which must be satisfied by the protocol to be secure. The conditions are uniquely determined by the ideal functionality F defining the cryptographic task to be implemented. We then show the following composition result. If quantum protocols π1, . . . , π securely implement ideal functionalities F1, . . . , F according to our security definition, then any purely classical two-party protocol, which makes sequential calls to F1, . . . , F , is equally secure as the protocol obtained by replacing the calls to F1, . . . , F with the respective quantum protocols π1, . . . , π . Hence, our approach yields the minimal security requirements which are strong enough for the typical use of quantum protocols as subroutines within larger classical schemes. Finally, we show that recently proposed quantum protocols for secure identification and oblivious transfer in the bounded-quantum-storage model satisfy our security definition, and thus compose in the above sense.

show abstract

Section: The Security Definitionmentioning

confidence: 99%

Composing Quantum Protocols in a Classical Environment

Fehr

Schaffner

2009

Theory of Cryptography

View full text Add to dashboard Cite

show abstract

“…It turns out that this sort of EPR cheating strategy will always be available for any quantum bit-commitment protocol (Lo and Chau (1997); Mayers (1997); see Bub (1993), prefigured in Schrödinger (1936), which tells us that for a bipartite quantum system, any mixture of states on one system may be prepared by performing a suitable measurement (which may involve an ancilla) on the other system, when the pair are in an appropriate entangled state (viz., one giving the correct reduced state for the first system). Following Schrödinger (1935aSchrödinger ( , 1936 this phenomenon associated with entanglement is often called remote steering.…”

Section: The Settingmentioning

confidence: 99%

Quantum Information Theory and the Foundations of Quantum Mechanics

Timpson¹

2013

View full text Add to dashboard Cite

of Thesis Submitted for the Degree of Doctor of PhilosophyThis thesis is a contribution to the debate on the implications of quantum information theory for the foundational problems of quantum mechanics. In Part I an attempt is made to shed some light on the nature of information and quantum information theory. It is emphasized that the everyday notion of information is to be firmly distinguished from the technical notions arising in information theory;however it is maintained that in both settings 'information' functions as an abstract noun, hence does not refer to a particular or substance. The popular claim 'Information is Physical' is assessed and it is argued that this proposition faces a destructive dilemma. Accordingly, the slogan may not be understood as an ontological claim, but at best, as a methodological one. A novel argument is provided against Dretske's (1981) attempt to base a semantic notion of information on ideas from information theory.The function of various measures of information content for quantum systems is explored and the applicability of the Shannon information in the quantum context maintained against the challenge of Brukner and Zeilinger (2001). The phenomenon of quantum teleportation is then explored as a case study serving to emphasize the value of recognising the logical status of 'information' as an abstract noun: it is argued that the conceptual puzzles often associated with this phenomenon result from the familiar error of hypostatizing an abstract noun.The approach of Deutsch and Hayden (2000) to the questions of locality and information flow in entangled quantum systems is assessed. It is suggested that the approach suffers from an equivocation between a conservative and an ontological reading; and the differing implications of each is examined. Some results are presented on the characterization of entanglement in the Deutsch-Hayden formalism.Part I closes with a discussion of some philosophical aspects of quantum computation.In particular, it is argued against Deutsch that the Church-Turing hypothesis is not underwritten by a physical principle, the Turing Principle. Some general morals are drawn concerning the nature of quantum information theory.In Part II, attention turns to the question of the implications of quantum information theory for our understanding of the meaning of the quantum formalism. Following some preliminary remarks, two particular information-theoretic approaches to the foundations of quantum mechanics are assessed in detail. It is argued that Zeilinger's (1999) Foundational Principle is unsuccessful as a foundational principle for quantum mechanics. The information-theoretic characterization theorem of Clifton, is assessed more favourably, but the generality of the approach is questioned and it is argued that the implications of the theorem for the traditional foundational problems in quantum mechanics remains obscure.

show abstract

“…However, Mayers [16] has shown that, even in the quantum setting, statistically secure commitment schemes do not exist, not even with respect to security notions much weaker than quantum-UC-security. In the light of this result, the reader may wonder whether our result is not vacuous.…”

Section: How To Interpret Our Resultsmentioning

confidence: 99%

Universally Composable Quantum Multi-party Computation

Unruh

2010

Lecture Notes in Computer Science

104

213

View full text Add to dashboard Cite

Abstract. The Universal Composability model (UC) by Canetti (FOCS 2001) allows for secure composition of arbitrary protocols. We present a quantum version of the UC model which enjoys the same compositionality guarantees. We prove that in this model statistically secure oblivious transfer protocols can be constructed from commitments. Furthermore, we show that every statistically classically UC secure protocol is also statistically quantum UC secure. Such implications are not known for other quantum security definitions. As a corollary, we get that quantum UC secure protocols for general multi-party computation can be constructed from commitments.

show abstract

Unconditionally Secure Quantum Bit Commitment is Impossible

Cited by 625 publications

References 7 publications

Composing Quantum Protocols in a Classical Environment

Composing Quantum Protocols in a Classical Environment

Quantum Information Theory and the Foundations of Quantum Mechanics

Universally Composable Quantum Multi-party Computation

Contact Info

Product

Resources

About