Quantum oblivious mutual identification

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

Volumn 921, Issue , 1995, Pages 133-146

  Crépeau, Claude ^a,b   Salvai, Louis ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; QUANTUM OPTICS; QUANTUM THEORY; SMART CARDS;

AMOUNT OF INFORMATION; COMPUTATIONAL ASSUMPTIONS; EFFICIENT PROTOCOLS; EXPONENTIAL NUMBERS; IDENTIFICATION TECHNIQUES; OF QUANTUM-INFORMATION;

CRYPTOGRAPHY;

EID: 84957700505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49264-X_11     Document Type: Conference Paper

References (26)

1. Anderson, R. J., “Why Cryptosystems Fail”, in Proceedings of the 1993 ACM Conference in Computer and Communications Security pp 215-227
2. Ash, R., Information Theory, John Wiley & Sons, 1965.
3. Bennett, C.H., G. Brassard, Quantum Cryptography: Public key distribution and coin tossing, Proc. of IEEE International Conference on Computers, Systems, and Signal Processing, Banglore, India, December 1984, pp. 175­-179.
4. Bennett, C.H., G. Brassard, J.-M. Robert, Privacy Amplification by Public Discussion, SIAM Journal on Computing, Vol. 17, No.2, 1988, pp. 210-229.
5. Brassard, G., C. Crepeau, R. Jozsa, D. Langlois, A quantum bit commitment scheme provably unbreakable by both parties, Proceeding of the 34t.h annual IEEE Symposium on Foundations of Computer Science, November 1993,pp. 362-371.
6. Bennett, C.H., G. Brassard, C. Crepeau, M.-H. Skubiszewska, Practical Quantum Oblivious Transfer, In proceedings of CRYPTO’91, Lecture Notes in Computer Science, vol 576, Springer Verlag, Berlin, 1992, pp 351-366.
7. Brassard, G., On computationally secure authentication tags requiring short secret shared keys, Advances in Cryptology: Proceedings of CRYPTO 82, Plenum Press, 1983, pp.79-86.
8. Brassard, G., Cryptology column — Quantum cryptography: A bibliography, Sigact News, vol. 24, no. 3, 1993, pp.16-20.
9. Carter, J.L., M. N. Wegman, New Hash Functions and Their Use in Authen­tication and Set Equality, Journal of Computer and System Sciences, Vol. 22, 1981, pp. 265-279.
10. Clior, B., O. Goldreich, J. Hastad, J. Freidman, S. Rudich, R. Smolensky, The bit extraction problem or t-resilient functions, Proc. 26th IEEE Symposium on Foundation of Computer Science, Portland, Oregon, 1985, pp.396-407.
11. Crepeau, C. and M. Santha. Efficient reductions among oblivious transfer protocols based on new self-intersecting codes. In Sequences II, Methods in Communications, Security, and Computer Science, pp. 360-368. Springer- Verlag, 1991.
12. Crepeau, C., Quantum Oblivious Transfer, Journal of Modern Optics, Dec. 1994.
13. Even, S., Goldreich, O. and Lempel, A., “A randomized protocol for signing contracts”, Communications of the ACM, vol. 28, 1985, pp.637-647.
14. Fagin, R., M. Naor and P. Winkler, Comparing Common Secret Information without Leaking it, submitted for publication, Communications of the ACM, 1994.
15. Fiat, A and A. Shamir. How to prove yourself: practical solutions to iden­tification and signature problems. In A. M. Odlyzko, editor, Proceedings CRYPTO 86, pages 186-194. Springer, 1987. Lecture Notes in Computer Science No. 263.
16. Forney, G.D., Concatenated Codes, The M.I.T. Press, 1966.
17. Goldreich, O., S. Goldwasser, and S. Micali. How to construct random func­tions. In Proceedings of the 25th IEEE Symposium on Foundations of Com­puter Science, pp. 464-479, Singer Island, 1984. IEEE.
18. Kilian, J., Founding cryptography on oblivious transfer. In Proc. 20th ACM Symposium on Theory of Computing, pp. 20-31, Chicago, 1988. ACM.
19. Knobloch, H.-J.,personal communication through T. Beth.
20. Mac Williams, F.J. and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1977.
21. Mayers, D., L. Salvail, Quantum Oblivious Transfer is Secure Against Indi­vidual Measurements, In the Proceedings of PHYSCOMP 94, Dallas, 1994, pp. 69-77.
22. Muller, A., Breguet, J. and Gisin, N., Experimental demonstration of quan­tum cryptography using polarized photons in optical fiber over more than 1 km In Europhysics Letters, vol. 23, no. 6, 20 August 1993, pp..383-388.
23. Rabin, M. O., How to exchange secrets by oblivious transfer, Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
24. Robert, J.-M., Detection et. correction d’erreur en crypt.ographie, Master the­sis, Departement d’informatique et de Recherche Operationnelle, Universite de Montreal, Montreal, Quebec, Canada, 1985.
25. Spielman, D., Linear-time Codable and Decodable Error-Correcting Codes. In Proc. 27th ACM Symposium on Theory of Computing, 1995. ACM.
26. One Less Thing to Believe In: Fraud at Fake Cash Machine, New York Times, 13 May 1993, pp. A1-B9.