Coin tossing is strictly weaker than bit commitment

Physical Review Letters

Volumn 83, Issue 25, 1999, Pages 5382-5384

  Kent, Adrian ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0007908747     PISSN: 00319007     EISSN: 10797114     Source Type: Journal    
DOI: 10.1103/PhysRevLett.83.5382     Document Type: Article

References (11)

1. M. Blum, in Proceedings of the 24th IEEE Computer Conference, Compcon (IEEE, New York, 1982), pp. 133–137
2. J. Kilian, Uses of Randomness in Algorithms and Protocols (MIT Press, Cambridge, MA, 1990), p. 68
3. S. Wiesner, SIGACT News, 15, 78 (1983)
4. C. H. Bennett and G. Brassard, in Proceeedings of IEEE International Conference on Computers, Systems and Signal Processing (IEEE, New York,1984), p. 175
5. D. Mayers, Phys. Rev. Lett., 78, 3414 (1997)
6. D. Mayers, quant-ph/9603015
7. D. Mayers, in Proceedings of the Fourth Workshop on Physics and Computation (New England Complex System Inst., Boston,1996), p. 226
8. H.-K. Lo and H. Chau, Phys. Rev. Lett., 78, 3410 (1997)
9. H.-K. Lo and H. Chau, Physica (Amsterdam), 120D, 177 (1998)
10. A. Kent, Phys. Rev. Lett., 83, 1447–1450 (1999)
11. A. Kent, quant-ph/9906103 (to be published)