Cheat sensitive quantum bit commitment via pre- and post-selected quantum states

Li, Yanbing; Wen, Qiaoyan; Li, Zi‐Chen; Qin, Su‐Juan; Yang, Yatao

doi:10.1007/s11128-013-0566-0

Cited by 25 publications

(19 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The implementation of those protocols often uses quantum optical devices such as nanosecond pulse laser, single mode optical fiber, and Mach-Zehnder interferometer for the generation, communication, and operation of non-entangled photons. With the recent development on the generation and manipulation of entangled photons [53], in the future,we are also interested in implementing QBC protocols based on (low-dimensional) entangled states [9,16].…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

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%

“…Quantum bit commitment (QBC) [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16] protocol was first proposed by Bennett and Brassard in 1984 [1]. Later, several QBC protocols were designed to achieve unconditional security, such as those in [17,18].…”

Section: Introductionmentioning

confidence: 99%

Impossibility of Quantum Bit Commitment, a Categorical Perspective

Sun

Wang

2020

Axioms

View full text Add to dashboard Cite

show abstract

“…In short, this intercept-resend attack will be discovered in the honest test with the probability of 1 2 . That is, our scheme is cheat sensitive [19,20,21]. In order to further resist this intercept-resend attack, in principle the client can replace the encoded state | ⟩ = [19], where the phase is a parameter randomly and privately selected by the client.…”

Section: Discussionmentioning

confidence: 99%

An efficient quantum scheme for Private Set Intersection

Shi

Zhong

et al. 2015

Quantum Inf Process

View full text Add to dashboard Cite

Private Set Intersection allows a client to privately compute set intersection with the collaboration of the server, which is one of the most fundamental and key problems within the multiparty collaborative computation of protecting the privacy of the parties. In this paper, we first present a cheat-sensitive quantum scheme for Private Set Intersection. Compared with classical schemes, our scheme has lower communication complexity, which is independent of the size of the server's set. Therefore, it is very suitable for big data services in Cloud or large-scale client-server networks. Abstract. Private set intersection allows a client to privately compute set intersection with the collaboration of the server, which is one of the most fundamental and key problems within the multi-party collaborative computation of protecting the privacy of the parties. In this paper, we first present a cheat-sensitive quantum scheme for private set intersection. Compared with classical schemes, our scheme has lower communication complexity, which is independent of the size of the server's set. Therefore, it is very suitable for big data services in Cloud or large-scale client-server networks. Disciplines Engineering | Science and Technology Studies

show abstract

“…Several QBC protocols were proposed based on physical hypothesis, such as bounded-quantum-storage model [30,31], noisy-storage model [32][33][34] and technological limitations on non-demolition measurements [35], the security of these protocols is threatened by the development of techniques. Some QBC schemes with security requirements relaxed were put forward, such as cheat-sensitive QBC [36][37][38][39] and game theoretic secure QBC [40]. There are also some non-relativistic QBC schemes which are claimed to be unconditionally secure [41][42][43][44][45][46].…”

Section: Introductionmentioning

confidence: 99%

Practical Quantum Bit Commitment Protocol Based on Quantum Oblivious Transfer

Song

Yang

2018

Applied Sciences

View full text Add to dashboard Cite

Oblivious transfer (OT) and bit commitment (BC) are two-party cryptographic protocols which play crucial roles in the construction of various cryptographic protocols. We propose three practical quantum cryptographic protocols in this paper. We first construct a practical quantum random oblivious transfer (R-OT) protocol based on the fact that non-orthogonal states cannot be reliably distinguished. Then, we construct a fault-tolerant one-out-of-two oblivious transfer ( O T 1 2 ) protocol based on the quantum R-OT protocol. Afterwards, we propose a quantum bit commitment (QBC) protocol which executes the fault-tolerant O T 1 2 several times. Mayers, Lo and Chau (MLC) no-go theorem proves that QBC protocol cannot be unconditionally secure. However, we find that computing the unitary transformation of no-go theorem attack needs so many resources that it is not realistically implementable. We give a definition of physical security for QBC protocols and prove that the practical QBC we proposed is physically secure and can be implemented in the real world.

show abstract

Cheat sensitive quantum bit commitment via pre- and post-selected quantum states

Cited by 25 publications

References 29 publications

Impossibility of Quantum Bit Commitment, a Categorical Perspective

Impossibility of Quantum Bit Commitment, a Categorical Perspective

An efficient quantum scheme for Private Set Intersection

Practical Quantum Bit Commitment Protocol Based on Quantum Oblivious Transfer

Contact Info

Product

Resources

About