Cryptography Reference
In-Depth Information
[117] O. Goldreich, R. Rubinfeld, and M. Sudan. Learning Polynomials with Queries: The
Highly Noisy Case. To appear in
SIAM Journal on Discrete Mathematics
.
[118] O. Goldreich, A. Sahai, and S. Vadhan. Honest-Verifier Statistical Zero-Knowledge Equals
General Statistical Zero-Knowledge. In
30th ACM Symposium on the Theory of Comput-
ing
, pages 399-408, 1998.
[119] O. Goldreich and M. Sudan. Computational Indistinguishability: A Sample Hierarchy.
Journal of Computer and System Science
, Vol. 59, pages 253-269, 1999.
[120] O. Goldreich and S. Vadhan. Comparing Entropies in Statistical Zero-Knowledge with
Applications to the Structure of SZK. In
14th IEEE Conference on Computational Com-
plexity
, pages 54-73, 1999.
[121] S. Goldwasser and J. Kilian. Primality Testing Using Elliptic Curves.
Journal of the ACM
,
Vol. 46, pages 450-472, 1999. (Preliminary version in
18th ACM Symposium on the Theory
of Computing
, 1986.)
[122] S. Goldwasser and L.A. Levin. Fair Computation of General Functions in Presence of
Immoral Majority. In
Crypto90
, Springer-Verlag Lecture Notes in Computer Science
(Vol. 537), pages 77-93, 1991.
[123] S. Goldwasser and S. Micali. Probabilistic Encryption.
Journal of Computer and Sys-
tem Science
, Vol. 28, No. 2, pages 270-299, 1984. (Preliminary version in
14th ACM
Symposium on the Theory of Computing
, 1982.)
[124] S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive
Proof Systems.
SIAM Journal on Computing
, Vol. 18, pages 186-208, 1989. (Preliminary
version in
17th ACM Symposium on the Theory of Computing
, 1985.)
[125] S. Goldwasser, S. Micali, and R.L. Rivest. A Digital Signature Scheme Secure Against
Adaptive Chosen-Message Attacks.
SIAM Journal on Computing
, April, pages 281-308,
1988.
[126] S. Goldwasser, S. Micali, and P. Tong. Why and How to Establish a Private Code
in a Public Network. In
23rd IEEE Symposium on Foundations of Computer Science
,
pages 134-144, 1982.
[127] S. Goldwasser, S. Micali, and A.C. Yao. Strong Signature Schemes. In
15th ACM Sympo-
sium on the Theory of Computing
, pages 431-439, 1983.
[128] S. Goldwasser and M. Sipser. Private Coins versus Public Coins in Interactive Proof
Systems.
Advances in Computing Research: A Research Annual
, Vol. 5 (
Randomness and
Computation
, S. Micali, ed.), pages 73-90, 1989.
[129] J. Hastad, R. Impagliazzo, L.A. Levin, and M. Luby. Construction of a Pseudorandom
Generator from Any One-Way Function.
SIAM Journal on Computing
, Vol. 28, No. 4,
pages 1364-1396, 1999. (Preliminary versions by Impagliazzo et al. in
21st ACM Sym-
posium on the Theory of Computing
(1989) and Hastad in
22nd ACM Symposium on the
Theory of Computing
(1990).)
[130] J. Hastad, A. Schrift, and A. Shamir. The Discrete Logarithm Modulo a Composite
Hides
O
(
n
) Bits.
Journal of Computer and System Science
, Vol. 47, pages 376 - 404,
1993.
[131] R. Impagliazzo and M. Luby. One-Way Functions are Essential for Complexity
Based Cryptography. In
30th IEEE Symposium on Foundations of Computer Science
,
pages 230 -235, 1989.
[132] R. Impagliazzo and M. Naor. Efficient Cryptographic Schemes Provable as Secure as
Subset Sum.
Journal of Cryptology
, Vol. 9, pages 199-216, 1996.
[133] R. Impagliazzo and S. Rudich. Limits on the Provable Consequences of One-Way Permu-
tations. In
21st ACM Symposium on the Theory of Computing
, pages 44-61, 1989.
[134] R.
Impagliazzo
and
A.
Wigderson.
P
=
BPP
if
E
Requires
Exponential
Circuits:
