Zero-Knowledge arguments and public-Key cryptography

Information and Computation

Volumn 121, Issue 1, 1995, Pages 23-40

  Desantis, Alfredo ^a   Dicrescenzo, Giovanni ^a   Persiano, Giuseppe ^b  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF CATANIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1342318990     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1995.1121     Document Type: Article

References (41)

1. L. Adleman and M. A. Huang. "Pnmality Testing and Abelian Varieties Over Finite Fields." Lecture Notes in Mathematics, Vol. 1512, Springer-Verlag, Berlin New York.
2. M. Bellare and S. Micali, Non-interactive oblivious transfer and applications, in "Advances in Cryptology-CRYPTO 89" (G. Brassard, Ed.), pp. 547-557. Lecture Notes in Computer Science. Vol.435. Springer-Verlag, Berlin/New York.
3. M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computations, in "Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988." pp. 1-10.
4. M. Blum, Coin flipping by telephone, in "IEEE COMPCON 1982, " pp. 133-137.
5. M. Blum, Three applications of the oblivious transfer, unpublished manuscript.
6. M. Blum, How to prove a theorem so no one else can claim it. in "Proceedings of the International Congress of Mathematicians, Berkeley, California, 1986, " pp. 1444-1451.
7. M. Blum. A. De Santis. S. Micali, and G. Persiano, Non-interactive zero knowledge. SIAM J. Comput. 20. No. 6 (1991). 1084-1118.
8. M. Blum, P. Feldman, and S. Micali, Non-interactive zero-knowledge proof systems and applications, in "Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 1988, " pp. 364-383.
9. R. Boppana, J. Hastad, and S. Zachos, Does co-NP have short interactive proofs? Inform. Proc. Lett. 25 (1987), 127-132.
10. G. Brassard and C. Crepeau, Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond, in "Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, " pp. 188-195.
11. G. Brassard, C. Crepeau, and D. Chaum, Minimum disclosure proofs of knowledge, J. Comput. Sy stem Sci. 37. No. 2 (1988), 156-189.
12. G. Brassard, C. Crepeau, and J.-M. Robert, Information theoretic-reductions among disclosure problems, in "Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986." pp. 168-173.
13. G. Brassard, C. Crepeau, and M. Yung. Perfect zero-knowledge computationally convincing proofs for NP in constant rounds, Theoret. Comput. Sci. 84, No. 1 (1991), 23-52.
14. D. Chaum, Demonstrating that a public predicate can be satisfied without revealing any information about how, in "Advances in Cryp-tology-CRYPTO 86." pp. 195-199, Lecture Notes in Computer Science, Vol. 263, Springer-Verlag, Berlin/New York.
15. D. Chaum. C. Crepeau, and I. Damgard, Multiparty unconditionally secure protocols, in "Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, " pp. 11-19.
16. C. Crepeau, Equivalence between two flavors of oblivious transfer, in "Advances in Cryptology-CRYPTO 87, " pp. 350-354, Lecture Notes in Computer Science. Vol. 293, Springer-Verlag. Berlin/New York.
17. I. Damgard, Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing, in "Advances in Cryptology-EUROCRYPT 92" (R. Rueppel, Ed.), pp. 341-355, Lecture Notes in Computer Science. Vol. 658, Springer-Verlag, Berlin/New York.
18. A. De Santis, G. Di Crescenzo, and G. Persiano, The knowledge complexity of quadratic residuosity languages, Theoret. Comput. Sci., to appear.
19. A. De Santis, S. Micali, and G. Persiano, Non-interactive zero-knowledge proof systems, in "Advances in Cryptology-CRYPTO 87, " pp. 52-72, Lecture Notes in Computer Science. Vol. 293, Springer-Verlag, Berlin/New York.
20. A. De Santis, S. Micali, and G. Persiano, Non-interactive zero-knowledge proof-systems with preprocessing, in "Advances in Cryptology-CRYPTO 88" (S. Goldwasser, Ed.), pp. 269-282, Lecture Notes in Computer Science, Vol. 403, Springer-Verlag, Berlin/New York.
21. A. De Santis and G. Persiano, Zero-knowledge proofs of knowledge without interaction, in "Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, 1992." pp. 427-436.
22. A. De Santis and M. Yung, Cryptographic applications of the non-interactive metaproof and many-prover systems, in "Advances in Cryptology-CRYPTO 90, " pp. 366-377. Lecture Notes in Computer Science, Vol. 537, Springer-Verlag, Berlin/New York.
23. W. Diffie and M. E. Hellman. New directions in cryptography, IEEE Trans. Inform. Theory IT-22, No. 6 (1976), 644-654.
24. S. Even, O. Goldreich, and A. Lempel, A randomized protocol for signing contracts, Comm. ACM 28 (1985), 637-647.
25. U. Feige, A. Fiat, and A. Shamir, Zero-knowledge proofs of identity, J. Cryptol. 1 (1988), 77-94; preliminary version in "Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, " pp. 210-217.
26. U. Feige. D. Lapidot, and A. Shamir, Multiple non-interactive zero-knowledge proofs based on a single random string, in "Proceedings of 31st Annual Symposium on Foundations of Computer Science." pp. 308 -317, IEEE, New York. 1990.
27. M. Fischer, S. Micali, and C. Rackoff, A secure protocol for the oblivious transfer, in "Eurocrypt 1984."
28. L. Fortnow, The complexity of perfect zero-knowledge, in "Advances in Computing Research 5: Randomness and Computation, " (S. Micali, Ed.), pp. 327-343, JA1 Press, London, 1989; preliminary version in "Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, " pp. 204-209.
29. M. Garey and D. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness, " Freeman. New York, 1979.
30. O. Goldreich, S. Micali, and A. Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, Assoc. Comput. Mach. 38, No. 1 (1991) 691-729.
31. O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game, in "Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, " pp. 218-229.
32. O. Goldreich, R. Ostrovsky, and E. Petrank, Computational complexity and knowledge complexity, in "Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994, " pp. 534-543.
33. S. Goldwasser and S. Micali, Probabilistic encryption, J. Comput. System Sci. 28, No. 2 (1984), 270-299.
34. S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof-systems, SIAM J. Comput. 18, No. 1 (1989).
35. J. Halpern and M. O. Rabin, A logic to reason about likelihood. in "Proceedings of the 15th Annual Symposium on Theory of Computing, 1983, " pp. 310-319.
36. R. Impagliazzo and M. Yung, Direct minimum knowledge computations, in "Advances in Cryptology-CRYPTO 87, " pp. 40-51, Lecture Notes in Computer Science, Vol. 293, Springer-Verlag. Berlin/New York.
37. J. Kilian, Founding cryptography on oblivious transfer, in "Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 1988, " pp. 20-31.
38. J. Kilian, S. Micali, and R. Ostrovsky, Minimum-resource zero-knowledge proofs, in "Proceedings of the 30th IEEE Symposium on Foundation of Computer Science, 1989, " pp. 474-479.
39. I. Niven and H. S. Zuckerman, "An Introduction to the Theory of Numbers, " Wiley, New York, 1960.
40. R. Ostrovsky, R. Venkatesan, and M. Yung, Fair games against an all-powerful adversary, in "Sequences II: Methods in Communication, Security and Computer Science" (R. Capocelli, A. De Santis, and U. Vaccaro, Eds.), pp. 418-429, Springer-Verlag, Berlin/New York, 1993.
41. D. Shanks, "Solved and Unsolved Problems in Number Theory, " Chelsea, New York, 1976.