Can relativistic bit commitment lead to secure quantum oblivious transfer?
arXiv:1210.5681 · doi:10.1140/epjd/e2015-50882-4
Abstract
While unconditionally secure bit commitment (BC) is considered impossible within the quantum framework, it can be obtained under relativistic or experimental constraints. Here we study whether such BC can lead to secure quantum oblivious transfer (QOT). The answer is not completely negative. On one hand, we provide a detailed cheating strategy, showing that the "honest-but-curious adversaries" in some of the existing no-go proofs on QOT still apply even if secure BC is used, enabling the receiver to increase the average reliability of the decoded value of the transferred bit. On the other hand, it is also found that some other no-go proofs claiming that a dishonest receiver can always decode all transferred bits simultaneously with reliability 100% become invalid in this scenario, because their models of cryptographic protocols are too ideal to cover such a BC-based QOT.
arXiv commentPublished version. This paper generalized some results in Sec. V of arXiv:1101.4587, and pointed out the limitation of the proof in arXiv:quant-ph/9611031
References in corpus (33)
- Unconditionally secure quantum bit commitment is impossible
- Is Quantum Bit Commitment Really Possible?
- Insecurity of Quantum Secure Computations
- Probabilistic theories with purification
- Quantum Data Hiding
- Degrees of concealment and bindingness in quantum bit commitment protocols
- Unconditionally Secure Bit Commitment
- Superselection rules and quantum protocols
- Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible
- Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
- Reexamination of Quantum Bit Commitment: the Possible and the Impossible
- Experimental bit commitment based on quantum communication and special relativity
- Cheat Sensitive Quantum Bit Commitment
- Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
- Unconditionally Secure Bit Commitment with Flying Qudits
- The Impossibility Of Secure Two-Party Classical Computation
- Experimental implementation of bit commitment in the noisy-storage model
- An Experimental Implementation of Oblivious Transfer in the Noisy Storage Model
- Possibility, Impossibility and Cheat-Sensitivity of Quantum Bit String Commitment
- Experimental unconditionally secure bit commitment
- Implementation of two-party protocols in the noisy-storage model
- Simple Protocols for Oblivious Transfer and Secure Identification in the Noisy-Quantum-Storage Model
- A short impossibility proof of Quantum Bit Commitment
- Strong no-go theorem for Gaussian quantum bit commitment
- The quantum bit commitment theorem
- Quantum key distribution based on orthogonal states allows secure quantum bit commitment
- Remote preparation of arbitrary ensembles and quantum bit commitment
- Unconditionally Secure Commitment of a Certified Classical Bit is Impossible
- Noise and measurement errors in a practical two-state quantum bit commitment protocol
- Making An Empty Promise With A Quantum Computer
- The relationship between two flavors of oblivious transfer at the quantum level
- Quantum bit commitment under Gaussian constraints
- The cryptographic power of misaligned reference frames