Giovanni Di Crescenzo
Moti Yung
- 1.M. Abadi, J. Feigenbaum, and J. Kilian, On Hiding Information from an Oracle, in Proceedings of STOC 87.]] Google Scholar
Digital Library
- 2.M. Bellaxe and O. Goldreich, On Defining Proofs of Knowledge, in Proceedings of CRYPTO '92.]] Google ScholarDigital Library
- 3.M. Bellare, S. Micali, and R. Ostrovsky, Perfect Zero Knowledge in Constant Rounds, in Proceedings of STOC 90.]] Google ScholarDigital Library
- 4.M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hfistad, j. Kilian, S. Micali, and P. Rogaway, Everything Provable is Provable in Zero Knowledge, in Proceedings of CRYPTO 88.]] Google ScholarDigital Library
- 5.M. Blum, Coin Flipping by Phone, IEEE Spring COM- PCOM, pp. 133--137, 1982.]]Google Scholar
- 6.M. Blum and S. Kannan, Designing Programs that Check their Work, in Proceedings of STOC 89.]] Google ScholarDigital Library
- 7.J. Boyar, K. Friedl, and C. Lund, Practical Zero- Knowledge Proofs: Giving Hints and Using Deficiencies, Journal of Cryptology, n. 4, 1991.]]Google Scholar
- 8.I. Dasnga~d, Interactive Hashing can simplify Zero- Knowledge Protocol Design without Complexity Assumptions, in Proceedings of CRYPTO 92.]]Google Scholar
- 9.A. De Santis, G. Di Crescenzo, G. Persiano and M. Yung, On Monotone Formula Closure of SZK, in Proceedings of FOCS 94.]]Google Scholar
- 10.A. De Santis, G. Di Crescenzo, G. Persiano and M. Yung, Image Density is Complete for Non-Interactive- SZK, in Procee&ngs of ICALP 98.]] Google ScholarDigital Library
- 11.G. Di Crescenzo and R. Impagliazzo, Proofs of Membership vs. Proofs of Knowledge, in Proceedings of Computational Complexity 98.]] Google ScholarDigital Library
- 12.G. Di Crescenzo, K. Sakurai and M. Yung, Zero- Knowledge Proofs of Decision Power: New Protocols and Optimal Round-Complexity, in Proceedings of ICICS 98.]] Google ScholarDigital Library
- 13.G. Di Crescenzo, K. Sakurai and M. Yung, Result- Indistinguishable Zero-Knowledge Proofs: Increased Power and Constant Round Protocols, in Proceedings of STACS 98.]] Google ScholarDigital Library
- 14.G. Di Crescenzo, K. Sakurai and M. Yung, Checking Programs Discreetly: Demonstrating Result- Correctness Efficiently while Concealing it, in Proceedings of ISAAC 98.]] Google ScholarDigital Library
- 15.U. Feige, A. Fiat, and A. Shamir, Zero-Knowledge Proofs of Identity, Journal of Cryptology, vol. 1, 1988, pp. 77-94. (previous version STOC 87)]] Google ScholarDigital Library
- 16.A. Fiat and A. Shamir, How to Prove yourself: Practical Solutions to Identifications and Signature Problems, in Proceedings of CRYPTO 86.]] Google ScholarDigital Library
- 17.Z. Galil, S. Haber, and M. Yung, Minimum-Knowledge Interactive Proofs for Decision Problems, SIAM Journal on Computing, vol. 18, n.4, pp. 711-739 (previous version in FOCS 85).]] Google ScholarDigital Library
- 18.O. Goldreich and E. Kushilevitz, A Perfect Zero- Knowledge Proof System for a Problem Equivalent to Discrete Logarithm, in Journal of Cryptology, 1993.]]Google Scholar
- 19.O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but their Validity or All Languages in NP Have Zero-Knowledge Proof Systems Journal of the ACM, vol. 38, n. 1, 1991.]] Google ScholarDigital Library
- 20.O. Goldreich and S. Vadhan, Comparing Entropies in Statistical Zero-Knowledge, with Applications to the Structure of SZK, in Proceedings of Computational Complexity 1999 (and Electronic Colloquium on Cornputational Complexity 1999).]] Google ScholarDigital Library
- 21.S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof. Systems, SIAM Journal on Computing, vol. 18, n. 1, February 1989.]] Google ScholarDigital Library
- 22.R. Impagliazzo and M. Yung, Direct Minimum Knowledge Computations, in Proceedings of CRYPTO 87.]] Google ScholarDigital Library
- 23.T. Itoh, Y. Ohta, and H. Shizuya, A Language- Dependent Cryptographic Primitive, in Journal of Cryptology, vol. 10, n. 1, 1997, pp. 37-49.]]Google ScholarDigital Library
- 24.M. Naor, Bit Commitment using Pseudo-Randomness, in Proceedings of CRYPTO 91.]] Google ScholarDigital Library
- 25.M. Naor, R. Ostrovsky, It. Venkatesan, and M. Yung, Perfect Zero-Knowledge Arguments for NP can be based on general complexity assumptions, in Proceedings of CRYPTO 92.]] Google ScholarDigital Library
- 26.A. Shamir, IP-PSPA CE, Journal of the ACM, vol. 39, n. 4.]] Google ScholarDigital Library
- 27.T. Okamoto, On Relationships between Statistical Zero- Knowledge Proofs, in Proceedings of STOC 96.]] Google ScholarDigital Library
- 28.It. Ostrovsky and A. Wigderson, One Way Functions are Essential for Non-2}~ivial Zero Knowledge, in Proceedings of ISTCS 93.]]Google Scholar
- 29.A. Sahai and S. Vadhan, A Promise Problem Complete for Statistical Zero. Knowledge, in Proceedings of FOCS 97.]] Google ScholarDigital Library
- 30.M. Tompa and H. Woll, Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information, in Proceedings of FOCS 87.]]Google Scholar
- 31.M. Yung, Zero-Knowledge Proofs of Computational Power, in Proceedings of EUROCItYPT 89.]] Google ScholarDigital Library
Index Terms
- On zero-knowledge proofs (extended abstract): “from membership to decision”
Recommendations
Zero-knowledge proofs of knowledge without interaction
SFCS '92: Proceedings of the 33rd Annual Symposium on Foundations of Computer ScienceA zero-knowledge proof system of knowledge is a protocol between two parties called the prover and the verifier. The prover wants to convince the verifier that he 'knows' the proof of a given theorem without revealing any additional information. This is ...
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