Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?

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

Volumn 1462, Issue , 1998, Pages 424-441

  Cramer, Ronald ^a   Damgård, Ivan ^b  

^a ETH ZURICH   (Switzerland)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CRYPTOGRAPHY; LOGIC CIRCUITS;

ARITHMETIC CIRCUIT; COMMUNICATION COMPLEXITY; ERROR PROBABILITIES; FINITE FIELD ARITHMETIC; INTERACTIVE PROOF SYSTEM; NON-INTERACTIVE ZERO-KNOWLEDGE PROOFS; ONE-WAY GROUP HOMOMORPHISMS; ZERO KNOWLEDGE PROOF;

RECONFIGURABLE HARDWARE;

EID: 84957680703     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0055745     Document Type: Conference Paper

References (28)

1. D. Beaver: Efficient Multiparty Protocols Using Circuit Randomization, Proceedings of Crypto 91, Springer-Verlag LNCS, 1992, pp. 420-432.
2. L. Babai, L. Fortnow, L. Levin and M. Szegedi: Checking Computations in Poly-logarithmic Time, Proceedings of STOC '91.
3. M. Bellare and and O. Goldreich: On Defining Proofs of Knowledge, Proceedings of Crypto '92, Springer Verlag LNCS, vol. 740, pp. 390-420.
4. J. Boyar, G. Brassard and R. Peralta: Subquadratic Zero-Knowledge, Journal of the ACM, November 1995.
5. G. Brassard, D. Chaum and C. Crépeau: Minimum Disclosure Proofs of Knowledge, JCSS, vol.37, pp. 156-189, 1988.
6. M.Ben-Or, O.Goldreich, S.Goldwasser, J.Håstad, J.Kilian, S.Micali and P.Rogaway: Everything Provable is Provable in Zero-Knowledge, Proceedings of Crypto 88, Springer Verlag LNCS series, 37-56.
7. J. Benaloh: Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret, Proc. of Crypto 86, Springer Verlag LNCS series, 251-260.
8. R. Cramer and I. Damgård: Linear Zero-Knowledge, Proc. of STOC 97.
9. R. Cramer, I. Damgård and U. Maurer: Span Programs and General Secure Multiparty Computations, BRICS Report series RS-97-27, available from http: //www.brics.dk.
10. R. Cramer, I. Damgård and B. Schoenmakers: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols, Proceedings of Crypto '94, Springer verlag LNCS, vol. 839, pp. 174-187.
11. W. Diffie and M. Hellman: New Directions in Cryptography, IEEE Transactions on Information Theory IT-22 (6): 644-654, 1976.
12. De Santis, Di Crecenzo, Persiano and Yung, Proceedings of FOCS 1994.
13. I. Damgaård and B. Pfitzmann: Sequential Iteration of Interactive Arguments, Proc. of ICALP 98, Springer Verlag LNCS series.
14. T. ElGamal, A Public-Key Cryptosystem and a Signature Scheme based on Discrete Logarithms, IEEE Transactions on Information Theory, IT-31 (4): 469-472, 1985.
15. L.Fortnow: The complexity of Perfect Zero-Knowledge, Adv. in Computing Research, vol.5, 1989, 327-344.
16. E. Fujisaki and T. Okamoto: Statistical Zero-Knowledge Protocols to prove Modular Polynomial Relations, Proceedings of Crypto 97, Springer Verlag LNCS series.
17. O. Goldreich and A. Kahan: How to Construct Constant-Round Zero-Knowledge Proof Systems for NP, Journal of Cryptology, (1996) 9: 167-189.
18. S. Goldwasser and S. Micali: Probabilistic Encryption, JCSS, vol.28, 1984.
19. O. Goldreich, S. Micali and A. Wigderson: Proofs that yield Nothing but their Validity and a Methodology of Cryptographic Protocol Design, Proceedings of FOCS '86, pp. 174-187.
20. S. Goldwasser, S. Micali and C. Rackoff: The Knowledge Complexity of Interactive Proof Systems, SIAM J.Computing, Vol. 18, pp. 186-208, 1989.
21. R.Gennaro, T.Rabin and M.Rabin: Simplified VSS and Fast-Track Multiparty Computations, Proceedings of PODC '98.
22. J. Kilian: A note on Efficient Proofs and Arguments, Proceedings of STOC '92.
23. J. Kilian: Efficient Interactive Arguments, Proceedings of Crypto '95, Springer Verlag LNCS, vol. 963, pp. 311-324.
24. T. Pedersen: Non-Interactive and Information Theoretic Secure Verifiable Secret Sharing, proc. of Crypto 91, Springer Verlag LNCS, vol. 576, pp. 129-140.
25. C. P. Schnorr: Efficient Signature Generation by Smart Cards, Journal of Cryptology, 4 (3): 161-174, 1991.
26. A.Shamir: IP=PSPACE, Journal of the ACM, vol.39 (1992), 869-877.
27. A. Shen: IP=PSPACE, Simplified Proof, Journal of the ACM, vol.39 (1992), pp.878-880.
28. A. De Santis, S. Micali, G. Persiano: Non-interactive zero-knowledge with preprocessing, Advances in Cryptology-Proceedings of CRYPTO 88 (1989) Lecture Notes in Computer Science, Springer-Verlag pp. 269-282.