Practical quantum bit commitment protocol

Danan, A.; Vaidman, Lev

doi:10.1007/s11128-011-0284-4

Cited by 24 publications

(16 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several practically secure QBC protocols have been devised and experimentally implemented in the last decade [50][51][52]. The security of those protocols typically relies on the current technological limitation on non-demolition measurement and long-term quantum memory.…”

Section: Discussionmentioning

confidence: 99%

Impossibility of Quantum Bit Commitment, a Categorical Perspective

Sun

Wang

2020

Axioms

View full text Add to dashboard Cite

Bit commitment is a cryptographic task in which Alice commits a bit to Bob such that she cannot change the value of the bit after her commitment and Bob cannot learn the value of the bit before Alice opens her commitment. According to the Mayers-Lo-Chau (MLC) no-go theorem, ideal bit commitment is impossible within quantum theory. In the information theoretic-reconstruction of quantum theory, the impossibility of quantum bit commitment is one of the three information-theoretic constraints that characterize quantum theory. In this paper, we first provide a very simple proof of the MLC no-go theorem and its quantitative generalization. Then, we formalize bit commitment in the theory of dagger monoidal categories. We show that in the setting of dagger monoidal categories, the impossibility of bit commitment is equivalent to the unitary equivalence of purification.Axioms 2020, 9, 28 2 of 12 with quantitative bounds on the degree of concealment and bindingness. D'Ariano et al. [27] provided a strengthened and explicit impossibility proof exhausting all conceivable protocols in which not only quantum information, but also classical information is exchanged between the two parties. However, the considerable length of the proof in [27] makes it still hard to follow. Chiribella et al. [28] simplified the proof in [27]. In the works of Cohn-Gordon [29] and Heunen and Kissinger [30], a clear and rigorous formalization of QBC is developed in the setting of categorical quantum mechanics. also provided a proof of the no-go theorem. While this proof is already simpler than all previous proofs, we find there is still room for simplification and extension.In Clifton et al.'s information theoretic-reconstruction of quantum theory [31], the impossibility of bit commitment is conceived as one of the three fundamental information-theoretic constraints that characterize quantum theory. In [31], the authors partially proved that the impossibility of bit commitment is equivalent to the existence of entangled, or nonlocal, states. This result was questioned by Heunen and Kissinger [30], who demonstrated that, in the categorical setting, the impossibility of bit commitment is not equivalent to the existence of entangled states. Which quantum feature is the one that is equivalent to the impossibility of bit commitment is left unanswered in [30].The contributions of this paper are ass follows.

show abstract

Section: Discussionmentioning

confidence: 99%

Impossibility of Quantum Bit Commitment, a Categorical Perspective

Sun

Wang

2020

Axioms

View full text Add to dashboard Cite

show abstract

“…We have analysed the cheating strategies for the practical two-state and four-state bit-commitment protocols presented in [10] and [4], respectively. We showed that by introducing the "post-processing" of the raw experimental data, one can improve the naïve cheating strategy based on the measurement in the Breidbart basis, originally studied in [10].…”

Section: Discussionmentioning

confidence: 99%

“…Quantifying the impact of these difficulties and studying their solutions is thus of utmost importance if quantum cryptography is to become a widespread reality. As a step towards this goal, we here study the feasibility of several different attacks on a practical two-state quantum bit-commitment (BC) protocol [10,1,2] and its original four-state variant [4] in a noisy environment. By practical, we mean that cheating is subjected to current technological constraints: the lack of long-term quantum memories and, in the case of the currently predominant optical realisations, the non-existence of photon non-demolition measurements.…”

Section: Introductionmentioning

confidence: 99%

Security of two-state and four-state practical quantum bit-commitment protocols

Loura¹,

Arsenović²,

Paunković³

et al. 2016

Phys. Rev. A

View full text Add to dashboard Cite

We study cheating strategies against a practical four-state quantum bit-commitment protocol [A. Danan and L. Vaidman, Quant. Info. Proc. 11, 769 (2012)] and its two-state variant [R. Loura et al., Phys. Rev. A 89, 052336 (2014)] when the underlying quantum channels are noisy and the cheating party is constrained to using single-qubit measurements only. We show that simply inferring the transmitted photons' states by using the Breidbart basis, optimal for ambiguous (minimum-error) state discrimination, does not directly produce an optimal cheating strategy for this bit-commitment protocol. We introduce a strategy, based on certain postmeasurement processes, and show it to have better chances at cheating than the direct approach. We also study to what extent sending forged geographical coordinates helps a dishonest party in breaking the binding security requirement. Finally, we investigate the impact of imperfect single-photon sources in the protocols. Our study shows that, in terms of the resources used, the four-state protocol is advantageous over the two-state version. The analysis performed can be straightforwardly generalised to any finite-qubit measurement, with the same qualitative results. * npaunkov@math.tecnico.ulisboa.pt arXiv:1609.08562v2 [quant-ph]

show abstract

“…Nevertheless, when Bob is limited to bounded or noisy quantum storages, secure QOT can be made possible in practice with two approaches. On one hand, with this technological constraint BCCC can be obtained [66][67][68][69][70][71][72][73][74]. This is because Bob can no longer keep system C in Eq.…”

Section: Summary and Discussionmentioning

confidence: 99%

Can relativistic bit commitment lead to secure quantum oblivious transfer?

2015

Eur. Phys. J. D

View full text Add to dashboard Cite

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.

show abstract

Practical quantum bit commitment protocol

Cited by 24 publications

References 9 publications

Impossibility of Quantum Bit Commitment, a Categorical Perspective

Impossibility of Quantum Bit Commitment, a Categorical Perspective

Security of two-state and four-state practical quantum bit-commitment protocols

Can relativistic bit commitment lead to secure quantum oblivious transfer?

Contact Info

Product

Resources

About