Unconditionally Secure Bit Commitment

@article{Kent1999UnconditionallySB,
  title={Unconditionally Secure Bit Commitment},
  author={Adrian Kent},
  journal={Physical Review Letters},
  year={1999},
  volume={83},
  pages={1447-1450}
}
  • A. Kent
  • Published 22 October 1998
  • Physics, Computer Science
  • Physical Review Letters
We describe a new classical bit commitment protocol based on cryptographic constraints imposed by special relativity. The protocol is unconditionally secure against classical or quantum attacks. It evades the no-go results of Mayers, Lo and Chau by requiring from Alice a sequence of communications, including a post-revelation verification, each of which is guaranteed to be independent of its predecessor. 

Topics from this paper

Quantum Bit Commitment Protocol Based on Counterfactual Quantum Cryptography
TLDR
The protocol is simple, and probably gives a new way of constructing QBC protocol, which can resist the attack presented by QBC's no-go theorem. Expand
Why classical certification is impossible in a quantum world
  • A. Kent
  • Computer Science, Physics
  • Quantum Inf. Process.
  • 2012
We give a simple proof that it is impossible to guarantee the classicality of inputs into any mistrustful quantum cryptographic protocol. The argument illuminates the impossibility of unconditionallyExpand
Quantum bit commitment under Gaussian constraints
Quantum bit commitment has long been known to be impossible. Nevertheless, just as in the classical case, imposing certain constraints on the power of the parties may enable the construction ofExpand
Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
  • A. Kent
  • Computer Science, Medicine
  • Physical review letters
  • 2012
TLDR
A new unconditionally secure bit commitment scheme based on Minkowski causality and the properties of quantum information is proposed based on Bennett-Brassard 1984 qubits and the impossibility of superluminal signalling. Expand
Unconditionally secure quantum bit commitment really is impossible
TLDR
The bit commitment theorem is reviewed here and the central conceptual point, that an ”Einstein-PodolskyRosen’ attack or cheating strategy can always be applied, is clarified and the question of whether following such a cheat strategy can ever be disadvantageous to the cheater is considered and answered in the negative. Expand
Deterministic Relativistic Quantum Bit Commitment
TLDR
New unconditionally secure bit commitment schemes whose security is based on Minkowski causality and the monogamy of quantum entanglement are described, and it is shown that these schemes still offer near-perfect security in the presence of losses and errors. Expand
Strong no-go theorem for Gaussian quantum bit commitment
Unconditionally secure bit commitment is forbidden by quantum mechanics. We extend this no-go theorem to continuous-variable protocols where both players are restricted to use Gaussian states andExpand
A brief review on quantum bit commitment
In classical cryptography, the bit commitment scheme is one of the most important primitives. We review the state of the art of bit commitment protocols, emphasizing its main achievements andExpand
The Quantum Bit Commitment Theorem
  • J. Bub
  • Mathematics, Computer Science
  • 2000
TLDR
The quantum bit commitment theorem is reviewed here and the central conceptual point, that an “Einstein–Podolsky–Rosen” attack or cheating strategy can always be applied, is clarified and the question of whether following such a cheat strategy can ever be disadvantageous to the cheater is considered and answered in the negative. Expand
Cryptanalysis and improvement of "Game theoretic security of quantum bit commitment"
TLDR
A cryptanalysis strategy for the QBC protocol is proposed and it is demonstrated that the sender can successfully change her commitment without being detected by the recipient with a probability 1 - ( 1 / 2 ) n. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
Modern Cryptology: A Tutorial
TLDR
This paper presents a meta-modelling architecture suitable for quantum cryptography that combines public-key and secret-key systems and shows the architecture’s need for future generations of quantum computers. Expand
Advances in Cryptology: Proceedings Of Crypto 83
TLDR
Some Public-Key Crypto-Functions as Intractable as Factorization as well as Cryptosystems and Other Hard Problems. Expand
Phys
  • Rev. Lett. 78
  • 1997
Phys
  • Rev. Lett. 78
  • 1997
Phys. Rev. Lett
  • Phys. Rev. Lett
  • 1997
Proceedings of the fourth workshop on Physics and computation
Phys. Rev. Lett
  • Phys. Rev. Lett
  • 1997
Proceedings of the 26th Annual ACM Symposium on the Theory of Computing
  • Proceedings of the 26th Annual ACM Symposium on the Theory of Computing
  • 1995
in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing
  • Montreal, 1994
  • 1994
Proceedings of the 34th Annual IEEE Symposium on the Foundation of Computer Science
  • Proceedings of the 34th Annual IEEE Symposium on the Foundation of Computer Science
  • 1993
...
1
2
3
...