1. Barenco, A.,C.H. Bennett, R. Cleve, D.P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin andH. Weinfurter, “Elementary Gates for Quantum Computation”,Physical Review A, vol. 52, no 5, November 1995, pp. 3457–3467.

   Article  Google Scholar 

2. Bennett, C.H.,F. Bessette, G. Brassard, L. Salvail andJ. Smolin, “Experimental Quantum Cryptography”,Journal of Cryptology, vol. 5, no. 1, 1992, pp. 3–28.

   Article MATH  Google Scholar 

3. Bennett, C. H. andG. Brassard, “Quantum Cryptography: Public Key Distribution and Coin Tossing”,Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India, December 1984, pp. 175–179.

   Google Scholar 

4. Bennett, C. H.,G. Brassard, C. Crépeau andM.-H. Skubiszewska, “Practical Quantum Oblivious Transfer”,Advances in Cryptology: CRYPTO’ 91: Proceedings, Lecture Notes in Computer Science, no 576, Springer-Verlag, August 1992, pp. 362–371.

   Google Scholar 

5. Brassard, G.,D. Chaum andC. Crépeau, “Minimum Disclosure Proofs of Knowledge”,Journal of Computer and System Sciences, vol. 37, 1988, pp. 156–189.

   Article MATH MathSciNet  Google Scholar 

6. Damgård, I., personal communication, December 1998.

   Google Scholar 

7. DiVincenzo, D.P., “Two-Bit Gates Are Universal For Quantum Computation”,Physical Review A, vol. 51, no 2, February 1995, pp. 1015–1022.

   Article MathSciNet  Google Scholar 

8. Impagliazzo, R. andS. Rudich, “Limits on Provable Consequences of One-Way Permutations”,Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, May 1989, pp. 44–61.

   Google Scholar 

9. Lo, H.-K. andH. F. Chau, “Is quantum Bit Commitment Really Possible?”,Physical Review Letters, vol. 78, no 17, April 1997, pp. 3410–3413.

   Article  Google Scholar 

10. Luby, M.,Pseudorandomness and Cryptographic Applications, Princeton University Press, 1996.

    Google Scholar 

11. Mayers, D., “The Trouble With Quantum Bit Commitment”,http://xxx.lanl.gov/abs/quant-ph/9603015, March 1996.

12. Mayers, D., “Quantum Key Distribution and String Oblivious Transfer in Noisy Channels”,Advances in Cryptology: CRYPTO’ 96: Proceedings, Lecture Notes in Computer Science, no 1109, Springer-Verlag, August 1996, pp. 343–357.

    Google Scholar 

13. Mayers, D., “Unconditionally Secure Quantum Bit Commitment is Impossible”,Physical Review Letters, vol. 78, no 17, April 1997, pp. 3414–3417.

    Article  Google Scholar 

14. Mayers, D., “Unconditional Security in Quantum Cryptography”,http://xxx.lanl.gov/abs/quant-ph/9802025, February 1998.

15. Naor, M.,R. Ostrovsky, R. Ventkatesan andM. Young, “Perfect Zero-Knowledge Arguments For NP Using Any One-Way Permutation”,Journal of Cryptology, vol. 11, no 2, 1998, pp. 87–108.

    Article MATH MathSciNet  Google Scholar 

16. Salvail, L., “Quantum Bit Commitment From a Physical Assumption”,Advances in Cryptology: CRYPTO’ 98: Proceedings, Lecture Notes in Computer Science, no 1462, Springer-Verlag, August 1998, pp. 338–353.

    Chapter  Google Scholar 

17. Shor, P., “Algorithms for Quantum Computation: Discrete Logarithms and Factoring”,Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 124–134.

    Google Scholar 

18. van de Graaf, J.,Torwards a Formal Definition of Security for Quantum Protocols, Ph.D. thesis, Département d’informatique et de recherche opérationelle, Université de Montréal, 1997.

    Google Scholar 

19. Yao, A. C.-C., “Security of Quantum Protocols Against Coherent Measurements”,Proceedings of the Twenty-seventh Annual ACM Symposium on Theory of Computing, May 1995, pp. 67–75.

    Google Scholar 

Download references