Security of quantum bit string commitment depends on the information measure

DOI10.1103/PHYSREVLETT.97.250501MaRDI QIDQ3107821zbMATH OpenOpenAlexWikidataFDO

Authors Harry Buhrman, Matthias Christandl, Patrick Hayden, Hoi-Kwong Lo, S. Wehner

Publication date 26 December 2011

Published in Physical Review Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0609237

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68) Authentication, digital signatures and secret sharing (94A62)

Abstract: Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum world. However, when committing to a string of n bits at once, how far can we stretch the quantum limits? In this letter, we introduce a framework of quantum schemes where Alice commits a string of n bits to Bob, in such a way that she can only cheat on a bits and Bob can learn at most b bits of information before the reveal phase. Our results are two-fold: we show by an explicit construction that in the traditional approach, where the reveal and guess probabilities form the security criteria, no good schemes can exist: a+b is at least n. If, however, we use a more liberal criterion of security, the accessible information, we construct schemes where a=4 log n+O(1) and b=4, which is impossible classically. Our findings significantly extend known no-go results for quantum bit commitment.

Recommendations

• scientific article; zbMATH DE number 1302858
• scientific article; zbMATH DE number 1283995
• Quantum bit commitment with cheat sensitive binding and approximate sealing
• New binding-concealing trade-offs for quantum string commitment
• Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)

Cites work

• Coin flipping by telephone a protocol for solving impossible problems
• On the Power of Quantum Memory
• Quantum data hiding
• Quantum Oblivious Transfer
• Randomizing quantum states: constructions and applications
• Reversing quantum dynamics with near-optimal quantum and classical fidelity
• Uncertainty, Monogamy, and Locking of Quantum Correlations
• Why quantum bit commitment and ideal quantum coin tossing are impossible.

Cited in

(11)

• New binding-concealing trade-offs for quantum string commitment
• Unconditionally secure multi-party quantum commitment scheme
• Unbounded violation of tripartite Bell inequalities
• The locking-decoding frontier for generic dynamics
• A separation between divergence and Holevo information for ensembles
• Quantum entanglement
• Uncertainty relation for the discrete Fourier transform
• The Locking-Decoding Frontier for Generic Dynamics
• Composable Security in the Bounded-Quantum-Storage Model
• scientific article; zbMATH DE number 1283995 (Why is no real title available?)
• Quantum bit string commitment protocol using polarization of mesoscopic coherent states

This page was built for publication: Security of quantum bit string commitment depends on the information measure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107821)