(Enter summary)
Abstract: Alice has made a decision in her mind. While she does not want to reveal it
to Bob at this moment, she would like to convince Bob that she is committed
to this particular decision and that she cannot change it at a later time. (Update)
Context of citations to this paper: More
.... [BCJL93] but those proofs were later discovered to be awed, since bit commitment was proven impossible [May96, LC97a, May97, LC96, LC97b, BCMS98] There have also been several works on quanutm coin tossing. Although arbitrarily small error is known to be impossible,...
Cited by: More
Multi-party Quantum Computation - Smith (2001)
(Correct)
Active bibliography (related documents): More All
2.5: Making an Empty Promise with a Quantum Computer - Chau, Lo (1997)
(Correct)
0.0: Converting the Flavor of a Quantum Bit Commitment - Legare (2000)
(Correct)
0.0: Converting the Flavor of a Quantum Bit - Commitment Frederic Legare
(Correct)
Similar documents based on text: More All
0.5: Efficient Quantum Key Distribution - Ardehali, Brassard, Chau, Lo
(Correct)
0.4: On the Existence of Bit Commitment Schemes and Zero-Knowledge.. - Damgård (1989)
(Correct)
0.4: Insecurity of Quantum Secure Computations - Hoi-Kwong Lo Brims (1997)
(Correct)
Related documents from co-citation: More All
2: Fault Tolerant Quantum Computation with Constant Error
- Aharonov, Ben-Or - 1997
BibTeX entry: (Update)
Hoi-Kwong Lo and H. F. Chau. Making an empty promise with a quantum computer. quant-ph/9709053. Also published in Fortschritte der Phys., October 1997. http://citeseer.ist.psu.edu/chau97making.html More
@misc{ lo97making,
author = "H. Lo and H. Chau",
title = "Making an empty promise with a quantum computer",
text = "Hoi-Kwong Lo and H. F. Chau. Making an empty promise with a quantum computer.
quant-ph/9709053. Also published in Fortschritte der Phys., October 1997.",
year = "1997",
url = "citeseer.ist.psu.edu/chau97making.html" }
Citations (may not include all citations):
704
Applied Cryptography (context) - Schneier - 1996
164
Polynomial-Time Algorithms for Prime Factorization and Discr..
- Shor
16
The Trouble with Quantum Bit Commitment
- Mayers
2
Pseudorandomness And Cryptographic Applications (context) - for, Luby - 1996
2
Optimal Eavesdropping in Quantum Cryptography. II. Quantum C.. (context) - Griffiths, Niu
2
Notices Am (context) - review, for et al. - 1996
2
A Quantum Bit Commitment Protocol Based on EPR States (context) - Ardehali
2
Optimal Eavesdropping in Quantum Cryptography (context) - Fuchs, Gisin et al.
1
manuscript written around (context) - Wiesner, News - 1970
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC