Experimental implementation of bit commitment in the noisy-storage model

Ng, Nelly Huei Ying; Joshi, Siddarth Koduru; Ming, Chia Chen; Kurtsiefer, Christian; Wehner, Stephanie

doi:10.1038/ncomms2268

Cited by 68 publications

(122 citation statements)

References 34 publications

Supporting

Mentioning

121

Contrasting

Order By: Relevance

“…To construct combined protocols for quantum coin flipping, we apply the following general lines: We discern three stages, as in the commonly used protocols against bounded adversaries, including classical protocols employing one-way functions 3 and quantum protocols in the noisy quantum storage model 26,35 . In the first stage (commit), which remains unchanged from the protocols against bounded adversaries, Alice and Bob exchange classical or quantum messages such that at the end of this stage each party has almost perfectly committed to one bit, S and T, respectively.…”

Section: Article Nature Communications | Doi: 101038/ncomms4717mentioning

confidence: 99%

“…However, although in principle the cheating probability bound in this protocol is independent of losses, a gain was shown in practice for a distance of a few metres. The closely related primitives of quantum bit commitment and oblivious transfer were experimentally demonstrated in the noisy storage model, where adversaries have access to an imperfect quantum memory 26,27 ; however, these protocols do not offer security against all-powerful adversaries. Finally, quantum bit commitment with relativistic constraints was also recently implemented 28,29 .…”

mentioning

confidence: 99%

See 1 more Smart Citation

Experimental plug and play quantum coin flipping

et al. 2014

View full text Add to dashboard Cite

Performing complex cryptographic tasks will be an essential element in future quantum communication networks. These tasks are based on a handful of fundamental primitives, such as coin flipping, where two distrustful parties wish to agree on a randomly generated bit. Although it is known that quantum versions of these primitives can offer informationtheoretic security advantages with respect to classical protocols, a demonstration of such an advantage in a practical communication scenario has remained elusive. Here we experimentally implement a quantum coin flipping protocol that performs strictly better than classically possible over a distance suitable for communication over metropolitan area optical networks. The implementation is based on a practical plug and play system, developed by significantly enhancing a commercial quantum key distribution device. Moreover, we provide combined quantum coin flipping protocols that are almost perfectly secure against bounded adversaries. Our results offer a useful toolbox for future secure quantum communications.

show abstract

Section: Article Nature Communications | Doi: 101038/ncomms4717mentioning

confidence: 99%

mentioning

confidence: 99%

Experimental plug and play quantum coin flipping

et al. 2014

View full text Add to dashboard Cite

show abstract

“…• Experimental implementations Experimental implementations of quantum cryptography are mostly focused on QKD (see [8]), but also include quantum coin flipping [31,182,189], quantum secret sharing [212], delegated quantum computation [17,114], limited-quantumstorage cryptography [105,188], and device-independent randomness generation [75,194].…”

Section: Further Topicsmentioning

confidence: 99%

“…This difference allows experimenters to optimize some parameters (such as the rate) differently for secure-computation protocols. The experimental feasibility of these protocols was analyzed theoretically in [232] and demonstrated practically in [105,188].…”

Section: Implementationsmentioning

confidence: 99%

Quantum cryptography beyond quantum key distribution

Broadbent

Schaffner

2015

Des. Codes Cryptogr.

181

112

View full text Add to dashboard Cite

Quantum cryptography is the art and science of exploiting quantum mechanical effects in order to perform cryptographic tasks. While the most well-known example of this discipline is quantum key distribution (QKD), there exist many other applications such as quantum money, randomness generation, secure two-and multi-party computation and delegated quantum computation. Quantum cryptography also studies the limitations and challenges resulting from quantum adversaries-including the impossibility of quantum bit commitment, the difficulty of quantum rewinding and the definition of quantum security models for classical primitives. In this review article, aimed primarily at cryptographers unfamiliar with the quantum world, we survey the area of theoretical quantum cryptography, with an emphasis on the constructions and limitations beyond the realm of QKD.

show abstract

“…They are typically based on BB84 [17] or six-state [7] encodings, and indeed the first implementation of a bit commitment protocol has recently been performed experimentally [23]. So far it was known that there exist protocols that send n qubits encoded in either the BB84 or six-state encoding, and that are secure as long as the adversary can only store strictly less than n/2 or 2n/3 noise-free qubits respectively.…”

mentioning

confidence: 99%

Achieving the Limits of the Noisy-Storage Model Using Entanglement Sampling

Dupuis

Fawzi

Wehner

2013

Advances in Cryptology – CRYPTO 2013

Self Cite

View full text Add to dashboard Cite

Abstract.A natural measure for the amount of quantum information that a physical system E holds about another system A = A1, ..., An is given by the min-entropy Hmin(A|E). Specifically, the min-entropy measures the amount of entanglement between E and A, and is the relevant measure when analyzing a wide variety of problems ranging from randomness extraction in quantum cryptography, decoupling used in channel coding, to physical processes such as thermalization or the thermodynamic work cost (or gain) of erasing a quantum system. As such, it is a central question to determine the behaviour of the minentropy after some process M is applied to the system A. Here we introduce a new generic tool relating the resulting min-entropy to the original one, and apply it to several settings of interest, including sampling of subsystems and measuring in a randomly chosen basis. The results on random measurements yield new high-order entropic uncertainty relations with which we prove the optimality of cryptographic schemes in the bounded quantum storage model. This is an abridged version of the paper; the full version containing all proofs and further applications can be found in [13].

show abstract

Experimental implementation of bit commitment in the noisy-storage model

Cited by 68 publications

References 34 publications

Experimental plug and play quantum coin flipping

Experimental plug and play quantum coin flipping

Quantum cryptography beyond quantum key distribution

Achieving the Limits of the Noisy-Storage Model Using Entanglement Sampling

Contact Info

Product

Resources

About