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
  • Computer Science, Mathematics
  • 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. 

Promising the Impossible: Classical Certification in a Quantum World

  • A. Kent
  • Computer Science, Mathematics
  • 2004
I 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 unconditionally

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.

Quantum bit commitment under Gaussian constraints

TLDR
A quantum bit commitment protocol is introduced and it is proved that it is asymptotically secure if cheating is restricted to Gaussian operations.

Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes

  • A. Kent
  • Computer Science
    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.

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.

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 and

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.

The Quantum Bit Commitment Theorem

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.

Coin Tossing is Strictly Weaker than Bit Commitment

  • A. Kent
  • Computer Science, Mathematics
  • 1999
TLDR
It is shown that, under standard cryptographic assumptions, coin tossing is strictly weaker than bit commitment, and no unconditionally secure bit commitment protocol can be built from a finite number of invocations of a secure coin-tossing black box together with finitely many additional classical or quantum information exchanges.
...

References

SHOWING 1-10 OF 20 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.

Advances in Cryptology: Proceedings Of Crypto 83

  • D. Chaum
  • Computer Science, Mathematics
  • 1985
TLDR
Some Public-Key Crypto-Functions as Intractable as Factorization as well as Cryptosystems and Other Hard Problems.

Phys. Rev. Lett

  • Phys. Rev. Lett
  • 1997

Phys

  • Rev. Lett. 78
  • 1997

Phys

  • Rev. Lett. 78
  • 1997

Proceedings of the fourth workshop on Physics and computation

Proceedings of IEEE International Conference on Computers, Systems and Signal Processing

  • Proceedings of IEEE International Conference on Computers, Systems and Signal Processing
  • 1984

in Proceedings of the 20th Annual ACM Symposium on the Theory of Computing

  • Chicago, 1988
  • 1991

in Proceedings of the 20th Annual ACM Symposium on the Theory of Computing

  • Chicago, 1988
  • 1991

Proceedings of the 20th Annual ACM Symposium on the Theory of Computing

  • Proceedings of the 20th Annual ACM Symposium on the Theory of Computing
  • 1988