Ronald Cramer
- 1.L. Babai, L. Fortnow, L. Levin and M. Szegedi: Checking Computations in Poly-logarithmic Time, Proceedings of STOC '91. Google Scholar
Digital Library
- 2.M. Bellare, S. Micali and R. Ostrovsky: The (True) Complexity of Statistical Zero-Knowledge, Proceedings of STOC '90, pp. 494-502. Google ScholarDigital Library
- 3.M. Bellare and O. Goldreich: On Defining Proofs of Knowledge, Proceedings of Crypto '92, Springer Verlag LNCS, vol. 740, pp. 390-420. Google ScholarDigital Library
- 4.J. Boyar, G. Brassard and R. Peralta: Subquadratic Zero-Knowledge, Journal of the ACM, November 1995. Google ScholarDigital Library
- 5.G. Brassard, D. Chaum and C. Cr~peau: Minimum Disclosure Proofs of Knowledge, JCSS, vol.37, pp. 156- 189, 1988. Google ScholarDigital Library
- 6.D. Chaum, I. Damg~rd and J. van de Graaf: Multiparty Computations ensuring Privacy of each Party's input and Correctness of the Result, Proceedings of Crypto '87, Springer Verlag LNCS, vol. 293, pp. 87-119. Google ScholarDigital Library
- 7.C. Cr~peau, J. van de Graaf and A. Tapp: Comitted Oblivious 7kansfer and Private Multiparty Computation, Proceedings of Crypto 95, Springer Verlag LNCS series, vol. 963. Google ScholarDigital Library
- 8.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. Google ScholarDigital Library
- 9.R. Cramer: Modular Design of Secure yet Practical Cryptographic Protocols, Ph.D.-thesis, CWI & Uni. of Amsterdam, January 1997.Google Scholar
- 10.I. Damg&rd, O. Goldreich, T. Okamoto and A. Wigderson: Honest Verifier vs. Dishonest Verifier in Public Coin Zero Knowledge Proofs, Proceedings of Crypto '95, Springer Verlag LNCS, vol. 963, pp. 325-338. Google ScholarDigital Library
- 11.I. Damg&rd and B. Pfitzmann: On Soundness of Iterated Interactive Arguments and an Ej~icient Zero- Knowledge Argument for NP, manuscript, February 1997.Google Scholar
- 12.I.Damg~d, T.P. Pedersen and B.Pfitzmann: Statistical Secrecy and Multi-Bit Commitments, BRICS report series RS-96-45, available at http://www.brics.dk. To appear in IEEE Trans. Info.TheoryGoogle Scholar
- 13.V. Dime and M. Hellman: New Directions in Cryptography, IEEE Transactions on Information Theory IT-22 (6): 644-654, 1976.Google Scholar
- 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.Google ScholarCross Ref
- 15.U. Feige and A. Shamir: Witness Indistinguishable and Witness Hiding Protocols, Proceedings of STOC '90, pp. 416-426. Google ScholarDigital Library
- 16.U. Feige and A. Shamir: Zero-Knowledge Proofs of Knowledge in Two Rounds, Proceedings of Crypto '89, Springer Verlag LNCS, vol. 435, pp. 526-544. Google ScholarDigital Library
- 17.U. Feige, A. Fiat and A. Shamir: Zero-Knowledge Proofs of Identity, Journal of Cryptology i (1988) 77- 94. Google ScholarDigital Library
- 18.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. Google ScholarDigital Library
- 19.O. Goldreich, S. Micali and A. Wigderson: How to Play Any Mental Game or a Completeness Theorem for Protocols with Honest Majority, Proceedings of STOC '87, ACM, pp. 218-229. Google ScholarDigital Library
- 20.O. Goldreich and A. Kahan: How to Construct Constant-Round Zero-Knowledge Proof Systems for NP, Journal of Cryptology, (1996) 9: 167-189.Google ScholarCross Ref
- 21.S. Goldwasser, S. Micali and C. Rackoff: The Knowledge Complexity of Interactive Proof Systems, SIAM J.Computing, Vol. 18, pp. 186-208, 1989. Google ScholarDigital Library
- 22.J. Kilian, S. Micali, and R. Ostrovsky: Minimum resource zero-knowledge proofs, Proceedings of FOCS '89, pp. 474-479. Google ScholarDigital Library
- 23.M. Naor: Bit commitment using randomness, Journal of Cryptology, (1991) 4: 151-158.Google Scholar
- 24.J. Kilian: A note on E. Oicient Proofs and Arguments, Proceedings of STOC '92.Google Scholar
- 25.J. Kilian: Ei}icient Interactive Arguments, Proceedings of Crypto '95, Springer Verlag LNCS, vol. 963, pp. 311- 324. Google ScholarDigital Library
- 26.T. Okamoto: Provably Secure and Practical identification Schemes and Corresponding Signature Schemes, Proceedings of Crypto '92, Springer Verlag LNCS, vol. 740, pp. 31-53. Google ScholarDigital Library
- 27.A. De Santis, G. Di Crescenzo, G. Persiano and M. Yung: On Monotone Formula Closure of SZK, Proceedings of FOCS '94, pp. 454-465. Google ScholarDigital Library
- 28.C. P. Schnorr: E.O%ient Signature Generation by Smart Cards, Journal of Cryptology, 4 (3): 161-174, 1991.Google Scholar
- 29.A. Yao: How to generate and exchange secrets, Proceedings of FOCS '86, pp. 162-167. Google ScholarDigital Library
Index Terms
- Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments
Recommendations
Constant-round adaptive zero-knowledge proofs for NP
Secure two-party computation allows two parties with private inputs to securely compute some function of their inputs, even in the presence of a malicious adversary. In this work, we revisit zero-knowledge proofs and focus on adaptive adversaries, which ...
On Relationships between Statistical Zero-Knowledge Proofs
This paper solves several fundamental open problems about statistical zero-knowledge interactive proofs (SZKIPs). The following two theorems are proven: If language L has a statistical zero-knowledge interactive proof against an honest verifier, then L ...
Comments