Ran Canetti
Oded Goldreich
Shafi Goldwasser
Silvio Micali
- 1.M. Bellaxe and O. Goldreich, Proofs of Computational Ability. Crypto '92, August 1992. Full version available on the Theo~ of C~ptogr~phy Lib~'a~y, http://philby .ucsd. sdu/01d, html, Record Arc-03.Google Scholar
- 2.G. Brassard, D. Chaum and C. Cr~peau. Minimum Disclosure Proofs of Knowledge. JCSS, Vol. 37, No. 2, pages 156-189, 1988. Google ScholarDigital Library
- 3.R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali. Resettable Zero-Knowledge. BCC'C', TR99-042, 1999.Also available from the Theory of Cryptography Library. Google ScholarDigital Library
- 4.I. Damg&rd. Concurrent Zero-Knowledge in Easy in Practics. Theory of Cryptography Library, 99-14, 3une 1999. http: } }philby. ucsd. e du/crypt 01 ib/1999, html.Google Scholar
- 5.I. Damg~-rd. Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. Eurocrypt 2000. Google ScholarDigital Library
- 6.D. Dolev, C. Dwork, and M. Naor. Non-Malleable Cryptography. In ~S,d STOC, pages 542-552, 1991. Google ScholarDigital Library
- 7.C. Dwork, and A. Sahai. Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. In Crypto98, Springer LNCS 1462. Google ScholarDigital Library
- 8.C. Dwork, M. Naor, and A. Sahai. Concurrent Zero- Knowledge. In $0th STOC, pages 409-418, 1998. Google ScholarDigital Library
- 9.U. Feige. Ph.D. thesis, Weizmann Institute of Science.Google Scholar
- 10.U. Feige, A. Fiat and A. Shamir. Zero-Knowledge Proofs of Identity. Jour"nal of Cryl~tology, Vol. 1, 1988, pages 77-94. Google ScholarDigital Library
- 11.U. Feige and A. Sharnir. Witness Indistinguishability and Witness Hiding Protocols. In ,~nd $TOC, pages 416-426, 1990. Google ScholarDigital Library
- 12.A. Fiat and A. Shamir. How to Prove Yourself: Practical Solution to Identification and Signature Problems. In CRYPT086, Springer-Verlag LNCS263, pages 186-189, 1987. Google ScholarDigital Library
- 13.O. Goldreich. Foundation of C~jptography - F, ag- ~'nentz of a Book. February 1996. Revised version, January 1998. Both versions axe available from http://theory, lcs. mi~. sdu/~oded/frag, h~ml.Google Scholar
- 14.O. Goldreich, S. Goldwa~ser, and S. Micadi. How to Construct Random Functions. JACM, Vol. 33, No. 4, pages 792-807, 1986. Google ScholarDigital Library
- 15.O. Goldreich, S. Goldwasser, and S. Micali. Interleaved Zero-Knowledge in the Public-Key Model. ECCC, TR99- 024, 1999. Also available from the Theor~j of Cr~yptography Library.Google Scholar
- 16.O. Goldreich and A. Kahan. How to Construct Constant- Round Zero-Knowledge Proof Systems for NP.Jour. of Cryptology, Vol. 9, No. 2, pages 167-189, 1996.Google ScholarDigital Library
- 17.O. Goldreich and H. Krawcsyk. On the Composition of Zero- Knowledge Proof Systems. SIAM J. Computing, Vol. 25, No. 1, pages 169-192, 1996. Google ScholarDigital Library
- 18.O. Goldreich and L.A. Levin. Haxd-core Predicates for any One-Way Function. In 215t STOC, pages 25-32, 1989. Google ScholarDigital Library
- 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. JACM, Vol. 38, No. 1, pp. 691-729, 1991. Google ScholarDigital Library
- 20.O. Goldreich and Y. Oren. Definitions and Properties of Zero-Knowledge Proof Systems. Jour. of Cryptology, Vol. 7, No. 1, pages 1-32, 1994.Google ScholarDigital Library
- 21.S. Goldwasser and S. Micali. Patent applications on Inand Internet Zero-Knotvledge and Lo~v-Knotoledge Proofs ~.d P~oto~oZ, (6/ll/sg).Google Scholar
- 22.S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput., Vol. 18, No. 1, pp. 186-208, 1989. Google ScholarDigital Library
- 23..1. H~stad, R. Impagliazzo, L.A. Levin and M. Luby. Construction of Pseudorandom Generator from any One.Way Function. SIAM Jour. on C'o~r~p~ting, Vol. 28 (4), pages 1364-1396, 1999. Google ScholarDigital Library
- 24.3. Kilian, E. Petrank, and C. Rackoff. Lower Bounds for Zero-Knowledge on the Internet. In Sgth FOC$, pages 484- 492, 1998. Google ScholarDigital Library
- 25.M. Naor. Bit Commitment using Pseudorandom Generators. Jolt. of Cryptology, Vol. 4, pages 151-158, 1991.Google ScholarDigital Library
- 26.It. Richardson and 3. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In B~.o(Tr~p~99, Springer LNCS 1592, pages 415-413. Google ScholarDigital Library
- 27.M. Tompa and H. Woll. Random Self-Reducibility and Zero- Knowledge Interactive Proofs of Possession of Information. In 28th FOC$, pages 472-482, 1987.Google Scholar
- 28.A.C. Yao. Theory and Application of Trapdoor Functions. In 23~d FO C$, pages 80-91, 1982.Google Scholar
Index Terms
- Resettable zero-knowledge (extended abstract)
Recommendations
Concurrently-secure credential ownership proofs
ASIACCS '07: Proceedings of the 2nd ACM symposium on Information, computer and communications securityWe address the case in credential systems where a credential owner wants to show her credential to a verifier without taking the risk that the ability to prove ownership of the same (and any other) credential is transferred to the verifier. We define ...
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives
CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications SecurityWe propose a new class of post-quantum digital signature schemes that: (a) derive their security entirely from the security of symmetric-key primitives, believed to be quantum-secure, and (b) have extremely small keypairs, and, (c) are highly ...
Comments