Cryptography Reference
In-Depth Information
[96] O. Goldreich. Notes on Levin's Theory of Average-Case Complexity.
ECCC
, TR97-058,
December 1997.
[97] O. Goldreich.
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
. Algo-
rithms and Combinatorics Series (Vol. 17), Springer-Verlag, 1999.
[98] O. Goldreich.
Secure Multi-Party Computation
. (In preparation, 1998. Working draft avail-
able from
http://theory.lcs.mit.edu/
∼
oded/gmw.html
.)
[99] O. Goldreich.
Encryption Schemes - Fragments of a Chapter
. (December 1999. Available
from
http://www.wisdom.weizmann.ac.il/
oded/foc-book.html.
)
[100] O. Goldreich.
Signature Schemes - Fragments of a Chapter
. (May 2000. Available from
http://www.wisdom.weizmann.ac.il/
∼
oded/foc-book.html.
)
[101] O. Goldreich, S. Goldwasser, and S. Halevi. Collision-Free Hashing from Lattice Prob-
lems.
ECCC
, TR95-042, 1996.
[102] O. Goldreich, S. Goldwasser, and S. Micali. How to Construct Random Functions.
Journal
of the ACM
, Vol. 33, No. 4, pages 792-807, 1986.
[103] O. Goldreich, S. Goldwasser, and S. Micali. On the Cryptographic Applications of Random
Functions. In
Crypto84
, Springer-Verlag Lecture Notes in Computer Science (Vol. 263),
pages 276-288, 1985.
[104] O. Goldreich, R. Impagliazzo, L.A. Levin, R. Venkatesan, and D. Zuckerman. Security
Preserving Amplification of Hardness. In
31st IEEE Symposium on Foundations of Com-
puter Science
, pages 318-326, 1990.
[105] O. Goldreich and A. Kahan. How to Construct Constant-Round Zero-Knowledge Proof
Systems for NP.
Journal of Cryptology
, Vol. 9, No. 2, pages 167-189, 1996. (Preliminary
versions date to 1988.)
[106] O. Goldreich and H. Krawczyk. On the Composition of Zero-Knowledge Proof Systems.
SIAM Journal on Computing
, Vol. 25, No. 1, February, pages 169-192, 1996.
[107] O. Goldreich and H. Krawczyk. On Sparse Pseudorandom Ensembles.
Random Structures
and Algorithms
, Vol. 3, No. 2, pages 163-174, 1992.
[108] O. Goldreich, H. Krawcyzk, and M. Luby. On the Existence of Pseudorandom Generators.
SIAM Journal on Computing
, Vol. 22, No. 6, pages 1163-1175, 1993.
[109] O. Goldreich and E. Kushilevitz. A Perfect Zero-Knowledge Proof for a Decision Problem
Equivalent to Discrete Logarithm.
Journal of Cryptology
, Vol. 6, No. 2, pages 97-116,
1993.
[110] O. Goldreich and L.A. Levin. Hard-Core Predicates for Any One-Way Function. In
21st
ACM Symposium on the Theory of Computing
, pages 25-32, 1989.
[111] O. Goldreich and B. Meyer. Computational Indistinguishability - Algorithms vs. Circuits.
Theoretical Computer Science
, Vol. 191, pages 215-218, 1998.
[112] 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, No. 1, pages 691-729, 1991. (Preliminary version in
27th IEEE Symposium on
Foundations of Computer Science
, 1986.)
[113] O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game - A Com-
pleteness Theorem for Protocols with Honest Majority. In
19th ACM Symposium on the
Theory of Computing
, pages 218-229, 1987.
[114] O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR-Lemma.
ECCC
, TR95-050,
1995.
[115] O. Goldreich and Y. Oren. Definitions and Properties of Zero-Knowledge Proof Systems.
Journal of Cryptology
, Vol. 7, No. 1, pages 1-32, 1994.
[116] O. Goldreich and E. Petrank. Quantifying Knowledge Complexity.
Computational Com-
plexity
, Vol. 8, pages 50 -98, 1999.
∼
