Invariant signatures and non-interactive zero-knowledge proofs are equivalent

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

Volumn 740 LNCS, Issue , 1993, Pages 228-245

  Goldwasser, Shafi ^a   Ostrovsky, Rafail ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; POLYNOMIAL APPROXIMATION;

EQUIVALENCE TO; NON-INTERACTIVE ZERO-KNOWLEDGE PROOFS; POLYNOMIAL-TIME COMPUTABLE FUNCTIONS; STANDARD DEFINITIONS;

CRYPTOGRAPHY;

EID: 85008172715     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48071-4_16     Document Type: Conference Paper

References (27)

1. Blum M., and S. Micali “How to Generate Cryptographically Strong Sequences Of Pseudo-Random Bits” SIAM J. on Computing, Vol 13, 1984, pp. 850-864, FOCS 1982.
2. Bellare, M., and S. Micali “How to Sign Given Any Trapdoor Function” STOC 88.
3. Blum M., P. Feldman, and S. Micali, “Non-interactive zero-knowledge proofs and their applications,” Proceedings of the 20th STOC. ACM, 1988.
4. Blum M., A. DeSantis, S. Micali and G. Persiano, “Non-Interactive Zero- Knowledge” SIAM J.Comp. 91
5. M. Bellare, S. Goldwasser “New Paradigms for digital signatures and Message Authentication based on Non-Interactive Zero Knowledge Proofs” Crypto 89 proceedings, pp. 194-211
6. Bellare, Yung, “Certifying Cryptographic Tools: The Case of Trapdoor Permutations” CRYPTO-92 proceedings.
7. De Santis, A., S. Micali and G. Persiano, “Non-Interactive Zero Knowledge Proof Systems,” CRYPTO-87
8. De Santis, A., S. Micali and G. Persiano, “Bounded-Interaction Zero- Knowledge proofs," CRYPTO-88.
9. W. Diffie, M. Heilman, “New directions in cryptography”, IEEE Trans, on Inf. Theory, IT-22, pp. 644-654, 1976.
10. Even S., O. Goldreich and S. Micali “On-line/Off-line Digital Signatures” CRYPTO 89.
11. Feige, U., D. Lapidot and A. Shamir, “Multiple Non-Interactive Zero- Knowledge Proofs Based on a Single Random String”, Proc. IEEE Symp. on Foundations of Computer Science, 1990.
12. Goldreich O., “Two remarks Concerning the GMR Signature Scheme” MIT Tech. Report 715, 1986.
13. Goldreich O., S. Goldwasser and S. Micali “How to Construct Random Functions” JASM V. 33 No 4. (October 1986) pp. 792-807.
14. Goldreich, O., and L. Levin “A Hard-Core Predicate for all One-Way Functions” Proc. 21st STOC, 1989, pp.25-32.
15. S. Goldwasser, S. Micali and C. Rackoff, “The Knowledge Complexity of Interactive Proof-Systems”, SIAM J. Comput. 18 (1989), pp. 186-208; (also in STOC 85, pp. 291-304.)
16. Goldwasser, S., S. Micali and R. Rivest “A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks” SIAM Journal of Computing vol 17, No 2, (April 1988), pp. 281-308.
17. Goldwasser S., S. Micali and A. Yao. “Strong Signature Schemes” STOC 83, pp.431-439.
18. Hastad, J., “Pseudo-Random Generators under Uniform Assumptions”, STOC 90.
19. R. Impagliazzo and M. Luby, "One-way Functions are Essential for Complexity-Based Cryptography” FOCS 89.
20. R. Impagliazzo and S. Rudich, “On the Limitations of certain One-Way Permutations”, Proc. ACM Symp. on Theory of Computing, pp 44-61, 1989.
21. R. Impagliazzo, R. L. Levin, and M. Luby ‘‘Pseudo-Random Generation from One-Way Functions,” STOC 89.
22. J. Kilian, S. Micali, R. Ostrovsky “Minimum Resource Zero-Knowledge Proofs”, FOCS-89.
23. M. Naor “Bit Commitment Using Pseudo-Randomness”, Crypto-89.
24. M. Naor and M. Yung, “Universal One-Way Hash Functions and their Cryptographic Applications”, STOC 89.
25. R. Ostrovsky, A. Wigdeson, “One-Way Functions are Essential for Non- Trivial Zero-Knowledge”, preliminary draft.
26. Rivest, R.L., Shamir, A. and Adleman, L., “A Method for Obtaining Digital Signatures and Public Key Cryptosystems” Comm.' ACM, Vol 21, No 2.1978.
27. J. Rompel “One-way Functions sire Necessary and Sufficient for Secure Signatures” STOC 90.