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.
A brief review on the impossibility of quantum bit commitment
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
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.