Perfectly concealing quantum bit commitment from any quantum one-way permutation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1807, Issue , 2000, Pages 300-315

  Dumais, Paul ^a   Mayers, Dominic ^b   Salvail, Louis ^c  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b NEC LABORATORIES AMERICA   (United States)

^c AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM COMPUTERS;

COMMUNICATION COMPLEXITY; ONE-WAY PERMUTATION; QUANTUM BITS; SECURITY PARAMETERS; UNCONDITIONALLY SECURE;

QUANTUM CRYPTOGRAPHY;

EID: 84948989963     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45539-6_21     Document Type: Conference Paper

References (19)

1. Barenco, A., C.H. Bennett, R. Cleve, D.P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin and H. Weinfurter, “Elementary Gates for Quantum Computation”, Physical Review A, vol. 52, no 5, November 1995, pp. 3457-3467.
2. Bennett, C.H., F. Bessette, G. Brassard, L. Salvail and J. Smolin, “Experimental Quantum Cryptography”, Journal of Cryptology, vol. 5, no. 1, 1992, pp. 3-28.
3. Bennett, C. H. and G. 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.
4. Bennett, C. H., G. Brassard, C. Crépeau and M.-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.
5. Brassard, G., D. Chaum and C. Crépeau, “Minimum Disclosure Proofs of Knowledge”, Journal of Computer and System Sciences, vol. 37, 1988, pp. 156-189.
6. Damgård, I., personal communication, December 1998.
7. DiVincenzo, D.P., “Two-Bit Gates Are Universal For Quantum Computation”, Physical Review A, vol. 51, no 2, February 1995, pp. 1015-1022.
8. Impagliazzo, R. and S. 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.
9. Lo, H.-K. and H. F. Chau, “Is quantum Bit Commitment Really Possible?”, Physical Review Letters, vol. 78, no 17, April 1997, pp. 3410-3413.
10. Luby, M., Pseudorandomness and Cryptographic Applications, Princeton University Press, 1996.
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.
13. Mayers, D., “Unconditionally Secure Quantum Bit Commitment is Impossible”, Physical Review Letters, vol. 78, no 17, April 1997, pp. 3414-3417.
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 and M. Young, “Perfect Zero-Knowledge Arguments For NP Using Any One-Way Permutation”, Journal of Cryptology, vol. 11, no 2, 1998, pp. 87-108.
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.
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.
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.
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.