REVIEW 1 cited by
A brief review on the impossibility of quantum bit commitment
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the first time thirteen years ago. Bit commitment is sufficient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment protocol was proposed together with a security proof. However, a basic flaw in the protocol was discovered by Mayers in 1995 and subsequently by Lo and Chau. Later the result was generalized by Mayers who showed that unconditionally secure bit commitment is impossible. A brief review on quantum bit commitment which focuses on the general impossibility theorem and on recent attempts to bypass this result is provided.
Forward citations
Cited by 1 Pith paper
-
The Hardness of Learning Quantum Circuits and its Cryptographic Applications
Secure quantum cryptography (one-way state generators, signatures, commitments, encryption) is constructed from new conjectures about the hardness of learning and cloning random quantum circuit outputs.
Discussion (0). Continue with ORCID to comment.