Cryptography Reference
In-Depth Information
Bibliography
[1] L.M. Adleman and M. Huang.
Primality Testing and Abelian Varieties Over Finite Fields
.
Springer-Verlag Lecture Notes in Computer Science (Vol. 1512), 1992. (Preliminary ver-
sion in
19th ACM Symposium on the Theory of Computing
, 1987.)
[2] W. Aiello and J. Hastad. Perfect Zero-Knowledge Languages Can Be Recognized in Two
Rounds. In
28th IEEE Symposium on Foundations of Computer Science
, pages 439- 448,
1987.
[3] M. Ajtai. Generating Hard Instances of Lattice Problems. In
28th ACM Symposium on the
Theory of Computing
, pages 99-108, 1996.
[4] M. Ajtai, J. Komlos, and E. Szemeredi. Deterministic Simulation in LogSpace. In
19th
ACM Symposium on the Theory of Computing
, pages 132-140, 1987.
[5] W. Alexi, B. Chor, O. Goldreich, and C.P. Schnorr. RSA / Rabin Functions: Certain Parts
Are as Hard as the Whole.
SIAM Journal on Computing
, Vol. 17, April, pages 194-209,
1988.
[6] N. Alon and J.H. Spencer.
The Probabilistic Method
. Wiley, 1992.
[7] T.M. Apostol.
Introduction to Analytic Number Theory
. Springer, 1976.
[8] L. Babai. Trading Group Theory for Randomness. In
17th ACM Symposium on the Theory
of Computing
, pages 421- 420, 1985.
[9] E. Bach.
Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms
.
ACM Distinguished Dissertation (1984). MIT Press, Cambridge, MA, 1985.
[10] E. Bach and J. Shallit.
Algorithmic Number Theory
.
Vol. I: Efficient Algorithms
. MIT
Press, Cambridge, MA, 1996.
[11] D. Beaver. Foundations of Secure Interactive Computing. In
Crypto91
, Springer-Verlag
Lecture Notes in Computer Science (Vol. 576), pages 377-391, 1992.
[12] D. Beaver. Secure Multi-Party Protocols and Zero-Knowledge Proof Systems Tolerating
a Faulty Minority.
Journal of Cryptology
, Vol. 4, pages 75-122, 1991.
[13] M. Bellare. A Note on Negligible Functions. Tech. Rep. CS97-529, Department of Com-
puter Science and Engineering, UCSD, March 1997.
[14] M. Bellare, R. Canetti, and H. Krawczyk. Pseudorandom Functions Revisited: The
Cascade Construction and Its Concrete Security. In
37th IEEE Symposium on Founda-
tions of Computer Science
, pages 514-523, 1996.
[15] M. Bellare, R. Canetti, and H. Krawczyk. Keying Hash Functions for Message Authen-
tication. In
Crypto96
, Springer-Verlag Lecture Notes in Computer Science (Vol. 1109),
pages 1-15, 1996.
