Cryptography Reference
In-Depth Information
References
[1] “National institute for standards and technology,” 1991.
Digital Signature
Standard (dss).
Federal Register
Vol. 56, No.169.
[2] W. Aiello and J. H astad, “Perfect zero-knowledge languages can be recog-
nized in two rounds,” in
28th IEEE Symposium on Foundations of Computer
Science
, pp. 439-448, 1987.
[3] W. Alexi, B. Chor, O. Goldreich, and C. Schnorr, “Rsa/rabin functions: cer-
tain parts are as hard as the whole,”
SIAM Journal on Computing
, pp. 194-
209, 1988.
[4] S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, “Proof verification
and intractability of approximation problems,”
Journal of the ACM
, vol. 17,
pp. 501-555, 1998. Preliminary version in
33rd FOCS
, 1992.
[5] S. Arora and S. Safra, “Probabilistic checkable proofs: a new characterization
of np,”
Journal of the ACM
, vol. 45, pp. 70-122, 1998. Preliminary version in
33rd FOCS
, 1992.
[6] L. Babai, L. Fortnow, L. Levin, and M. Szegedy, “Checking computations in
polylogarithmic time,” in
23rd ACM Symposium on the Theory of Computing
,
pp. 21-31, 1991.
[7] L. Babai, L. Fortnow, N. Nisan, and A. Wigderson, “BPP has subexponential
time simulations unless exptime has publishable proofs,”
Complexity Theory
,
vol. 3, pp. 307-318, 1993.
[8] B. Barak, “How to go beyond the black-box simulation barrier,” in
42nd IEEE
Symposium on Foundations of Computer Science
, pp. 106-115, 2001.
[9] B. Barak, “Constant-round coin-tossing with a man in the middle or realizing
the shared random string model,” in
43th IEEE Symposium on Foundations
of Computer Science
, pp. 345-355, 2002.
