Temporary assumptions - Quantum and classical

2005 IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security

Volumn 2005, Issue , 2005, Pages 31-33

  Müller Quade, Jörn ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750385121     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITWTPI.2005.1543952     Document Type: Conference Paper

References (6)

1. A. Ambainis, H. Buhrmann, Y. Dodis, and H. Röhrig. Multiparty quantum coin flipping. In IEEE Conference on Computational Complexity (CCC 2004), pages 250-259, Amherst, MA, USA, 2004. IEEE Computer Society.
2. Ran Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In Proceedings of 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, pages 136-145. IEEE Computer Society, 2001. Full version at http://eprint.iacr.org/2000/067.
3. O. Goldreich, S. Micali, and A. Wigderson. How to Play any Mental Game. 19th Symposium on Theory of Computing (STOC), pages 218-229, ACM, 1987.
4. E. Kushilevitz. Privacy and Communication Complexity. SIAM Journal Discrete Math., vol. 5, pages 273-284, 1992.
5. H.-K. Lo and H. F. Chau. Is quantum bit commitment really possible? Available on the Los Alamos preprint archive at xxx.lanl.gov, March 1996.
6. D. Mayers. Unconditionally secure bit commitment is impossible. Phys. Rev. Letters, 78:3414-3417, 1997. A previous version was published at PhysComp96.