Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Theoretical Computer Science

WITHDRAWN: Quantum cryptography: Public key distribution and coin tossing

Charles H. Bennett, Gilles Brassard

Published Sep 1, 2011• 131 citations
Publisher
DOI
10.1016/j.tcs.2011.08.039

Related papers

Quantum Cryptography: Quantum Key Distribution And Coin Flipping

Neetu Rani

•Jan 1, 2017•0 citations

The quantum nature of cryptography: problems of public-key cryptography and the prospect of quantum key distribution

A. K. M. Harun-Ar-Rashid

Conference on Privacy, Security and Trust•Oct 30, 2006•0 citations

A Novel Quantum Coin Tossing Protocol Based on Quantum Public-Key Cryptosystem

Guanghui Liu, Dong Cao

Quantum coin tossing is a simple cryptographic primitive with many applications in more complicated tasks and plays a crucial role in complex quantum cryptography protocol design. Coin tossing protocols in classical environment are often based on bit commitment protocol. It has been proved that unconditionally secure quantum bit commitment schemes are insecure. Therefore, quantum coin tossing based on quantum bit commitment protocol isn't unconditionally secure. In general, quantum coin tossing is strictly weaker than bit commitment. In this paper, we have proposed a quantum coin tossing protocol based on quantum public-key cryptosystems. According to quantum CSS codes, we constructed a class of quantum quasi-cyclic low-density parity-check codes, and then proposed a novel quantum coin tossing protocol. Security analysis show that the proposed protocols are more secure.

International Conference on Internet Technology and Applications•Aug 1, 2011•0 citations

Quantum cryptography: Public key distribution and coin tossing

Charles H. Bennett, Gilles Brassard

When elementary quantum systems, such as polarized photons, are used to transmit digital information, the uncertainty principle gives rise to novel cryptographic phenomena unachievable with traditional transmission media, e.g. a communications channel on which it is impossible in principle to eavesdrop without a high probability of disturbing the transmission in such a way as to be detected. Such a quantum channel can be used in conjunction with ordinary insecure classical channels to distribute random key information between two users with the assurance that it remains unknown to anyone else, even when the users share no secret information initially. We also present a protocol for coin-tossing by exchange of quantum messages, which is secure against traditional kinds of cheating, even by an opponent with unlimited computing power, but ironically can be subverted by use of a still subtler quantum phenomenon, the Einstein-Podolsky-Rosen paradox.

arXiv:2003.06557•Theoretical Computer Science•Oct 8, 2014•8,930 citations

An Update on Quantum Cryptography

Charles H. Bennett, Gilles Brassard

Springer eBooks•Aug 12, 2007•149 citations

Measurement-device-independent quantum coin tossing

Liang-Yuan Zhao, Zhen−Qiang Yin, Shuang Wang +4 more

Quantum coin tossing (QCT) is an important primitive of quantum cryptography and has received continuous interest. However, in practical QCT, Bob's detectors can be subjected to detector-side channel attacks launched by dishonest Alice, which will possibly make the protocol completely insecure. Here, we report a simple strategy of a detector-blinding attack based on a recent experiment. To remove all the detector side channels, we present a solution of measurement-device-independent QCT (MDI-QCT). This method is similar to the idea of MDI quantum key distribution (QKD). MDI-QCT is loss tolerant with single-photon sources and has the same bias as the original loss-tolerant QCT under a coherent attack. Moreover, it provides the potential advantage of doubling the secure distance for some special cases. Finally, MDI-QCT can also be modified to fit the weak coherent-state sources. Thus, based on the rapid development of practical MDI-QKD, our proposal can be implemented easily.

arXiv:1512.09269•Physical Review A•Dec 14, 2015•14 citations
Quantum coin tossing is a simple cryptographic primitive with many applications in more complicated tasks and plays a crucial role in complex quantum cryptography protocol design. Coin tossing protocols in classical environment are often based on bit commitment protocol. It has been proved that unconditionally secure quantum bit commitment schemes are insecure. Therefore, quantum coin tossing based on quantum bit commitment protocol isn't unconditionally secure. In general, quantum coin tossing is strictly weaker than bit commitment. In this paper, we have proposed a quantum coin tossing protocol based on quantum public-key cryptosystems. According to quantum CSS codes, we constructed a class of quantum quasi-cyclic low-density parity-check codes, and then proposed a novel quantum coin tossing protocol. Security analysis show that the proposed protocols are more secure.
When elementary quantum systems, such as polarized photons, are used to transmit digital information, the uncertainty principle gives rise to novel cryptographic phenomena unachievable with traditional transmission media, e.g. a communications channel on which it is impossible in principle to eavesdrop without a high probability of disturbing the transmission in such a way as to be detected. Such a quantum channel can be used in conjunction with ordinary insecure classical channels to distribute random key information between two users with the assurance that it remains unknown to anyone else, even when the users share no secret information initially. We also present a protocol for coin-tossing by exchange of quantum messages, which is secure against traditional kinds of cheating, even by an opponent with unlimited computing power, but ironically can be subverted by use of a still subtler quantum phenomenon, the Einstein-Podolsky-Rosen paradox.
Quantum coin tossing (QCT) is an important primitive of quantum cryptography and has received continuous interest. However, in practical QCT, Bob's detectors can be subjected to detector-side channel attacks launched by dishonest Alice, which will possibly make the protocol completely insecure. Here, we report a simple strategy of a detector-blinding attack based on a recent experiment. To remove all the detector side channels, we present a solution of measurement-device-independent QCT (MDI-QCT). This method is similar to the idea of MDI quantum key distribution (QKD). MDI-QCT is loss tolerant with single-photon sources and has the same bias as the original loss-tolerant QCT under a coherent attack. Moreover, it provides the potential advantage of doubling the secure distance for some special cases. Finally, MDI-QCT can also be modified to fit the weak coherent-state sources. Thus, based on the rapid development of practical MDI-QKD, our proposal can be implemented easily.