Zero-knowledge sets

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2003-January, Issue , 2003, Pages 80-91

  Micali, S ^a   Rabin, M ^b   Kilian, J ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b HARVARD UNIVERSITY   (United States)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

Computer science; Laboratories; Mathematics; Modular construction; National electric code; Polynomials; Security; Upper bound

Indexed keywords

COMPUTER SCIENCE; LABORATORIES; MATHEMATICAL TECHNIQUES; MODULAR CONSTRUCTION; POLYNOMIAL APPROXIMATION;

FINITE SET; NATIONAL ELECTRIC CODE; POLYNOMIAL-TIME; RANDOM STRING; SECURITY; UPPER BOUND; ZERO KNOWLEDGE; ZERO-KNOWLEDGE SET;

POLYNOMIALS;

EID: 70350365723     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238183     Document Type: Conference Paper

References (22)

1. E. Bach. How to generate random integers with known factorization. In Proceedings of the fifteenth annual ACM Symposium on Theory of Computing, pages 184-188, ACM Press, 1983.
2. M. Blum, P. Feldman, and S. Micali. Proving security against chosen ciphertext attacks. InS. Goldwasser, editor, Proc. CRYPTO 88, pages 256-268. Springer-Verlag, 1988. Lecture Notes in Computer Science No. 403.
3. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudorandom bits. SIAM Journal on Computing, 13(4):850-864, 1984.
4. M. Blum, A. De Santis, S. Micali, and G. Persiano. Noninteractive zero-knowledge. SIAM J. Comput., 20(6):1084-1118, 1991.
5. I. B. Damgard, T. P. Pedersen, and B. Pfitzmann. On the existence of statistically hiding bit commitment schemes and fail-stop signatures. Lecture Notes in Computer Science, 773:250-??, 1994.
6. E. Fouvry. Theoreme de Brun-Titchmarsh; application au theoreme de Fermat. Invent. Math., 79:383-407, 1985.
7. S. Goldwasser, S. Micali, and C. Rackoff. "The Knowledge Complexity of Interactive Proof Systems", SIAM J. Comput., 18 (1):186-208, 1989.
8. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the Association for Computing Machinery, 33(4):792-807, October 1986.
9. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attack. SIAM Journal on Computing, 17:281-308, 1988.
10. S. Halevi and S. Micali. Practical and provably-secure commitment schemes from collision-free hashing. In Proc. 16th International Advances in Cryptology Conference - Crypto '96, pages201-215, 1996.
11. A. Kalai. Generating random factored numbers, easily. In Proceedings of the 13th Annual ACM-SIAM Symposium On Discrete Mathematics (SODA-02), pages 412-412, New York, January 6-8, 2002. ACM Press.
12. J. Kilian. A note on efficient zero-knowledge proofs and arguments. In Proc. 24th Ann. ACM Symp. on Theory of Computing, pages 723-732, Victoria, B.C., Canada, May 1992.
13. J. Kilian. Improved efficient arguments. In Proc. 15th International Advances in Cryptology Conference - CRYPTO '95, pages 311-324, 1995.
14. J. Kilian Efficiently Committing to Databases TR #97-040, NEC Research Institute, 1997.
15. R. C. Merkle. A certified digital signature. In G. Brassard, editor, Advances in Cryptology-CRYPTO '89, volume 435 ofLecture Notes in Computer Science, pages 218-238. Springer-Verlag, 1990, 20-24 August 1989.
16. S. Micali. Computationally Sound Proofs, In proceedings, 35th IEEE Symposium on Foundations of Computer Science, 1994.
17. S. Micali, M. Rabin Hashing on Strings, Cryptography, and Protection of Privacy. In Proceedings Compression and Complexity of Sequences IEEE Computer Society, Los Alamitos, CA, June 11-13, 1997, p. 1. (First presented at Berkeley Symp. on Randomness, 1996.)
18. National Institute of Standards and Technology. FIPS PUB 180-1: Secure Hash Standard. National Institute for Standards and Technology, Gaithersburg, MD, USA, April 1995. Supersedes FIPS PUB 180 1993 May 11.
19. R. Ostrovsky, C. Rackoff and A. Smith. Personal communication.
20. T. Pedersen. Noninteractive and information-theoretic secure verifiable secret sharing. Lecture Notes in Computer Science, 576:129-140, 1991.
21. R. Rivest. The MD5 Message-Digest Algorithm. RFC 1321, MIT, RSA Data Security, April 1992.
22. A. C. Yao. Theory and applications of trapdoor functions. In 23rd IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.