Bibliography - Foundations of Cryptography: Basic Tools - page 362

Derandomizing the XOR Lemma. In 29th ACM Symposium on the Theory of Computing ,
pages 220-229, 1997.
[135] R. Impagliazzo and D. Zuckerman. How to Recycle Random Bits. In 30th IEEE Symposium
on Foundations of Computer Science , pages 248-253, 1989.
[136] R. Impagliazzo and M. Yung. Direct Zero-Knowledge Computations. In Crypto87 ,
Springer-Verlag Lecture Notes in Computer Science (Vol. 293), pages 40 -51, 1987.
[137] A. Juels, M. Luby, and R. Ostrovsky. Security of Blind Digital Signatures. In Crypto97 ,
Springer-Verlag Lecture Notes in Computer Science (Vol. 1294), pages 150-164,
1997.
[138] J. Justesen. A Class of Constructive Asymptotically Good Algebraic Codes. IEEE Trans-
actions on Information Theory , Vol. 18, pages 652-656, 1972.
[139] N. Kahale. Eigenvalues and Expansion of Regular Graphs. Journal of the ACM , Vol. 42,
No. 5, pages 1091-1106, 1995.
[140] J. Kahn, M. Saks, and C. Smyth. A Dual Version of Reimer's Inequality and a Proof of
Rudich's Conjecture. In 15th IEEE Conference on Computational Complexity , 2000.
[141] B.S. Kaliski. Elliptic Curves and Cryptography: A Pseudorandom Bit Generator and Other
Tools. Ph.D. thesis, LCS, MIT, Cambridge, MA, 1988.
[142] J. Katz and M. Yung. Complete Characterization of Security Notions for Probabilistic
Private-Key Encryption. In 32nd ACM Symposium on the Theory of Computing , pages
245-254, 2000.
[143] J. Kilian. A Note on Efficient Zero-Knowledge Proofs and Arguments. In 24th ACM
Symposium on the Theory of Computing , pages 723-732, 1992.
[144] J. Kilian and E. Petrank. An Efficient Non-Interactive Zero-Knowledge Proof System for
NP with General Assumptions. Journal of Cryptology , Vol. 11, pages 1-27, 1998.
[145] J.C. Lagarias and A.M. Odlyzko. Solving Low-Density Subset Sum Problems. Journal of
the ACM , Vol. 32, pages 229-246, 1985.
[146] D. Lapidot and A. Shamir. Fully Parallelized Multi-prover Protocols for NEXP-Time.
Journal of Computer and System Science , Vol. 54, No. 2, April, pages 215-220, 1997.
[147] A. Lempel. Cryptography in Transition. Computing Surveys , Vol. 11, No. 4, pages 285-
303, December 1979.
[148] A.K. Lenstra, H.W. Lenstra, and L. Lovasz. Factoring Polynomials with Rational Coeffi-
cients. Mathematische Annalen , Vol. 261, pages 515-534, 1982.
[149] L.A. Levin. Average Case Complete Problems. SIAM Journal on Computing , Vol. 15,
pages 285-286, 1986.
[150] L.A. Levin. One-Way Function and Pseudorandom Generators. Combinatorica , Vol. 7,
pages 357-363, 1987.
[151] L.A. Levin. Randomness and Non-determinism. Journal of Symbolic Logic , Vol. 58,
No. 3, pages 1102-1103, 1993.
[152] M. Li and P. Vitanyi. An Introduction to Kolmogorov Complexity and Its Applications .
Springer-Verlag, 1993.
[153] J.H. van Lint. Introduction to Coding Theory . Graduate Texts in Mathematics (Vol. 88),
Springer-Verlag, 1982.
[154] A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan Graphs. Combinatorica , Vol. 8,
pages 261-277, 1988.
[155] M. Luby. Pseudorandomness and Cryptographic Applications . Princeton University Press,
1996.
[156] M. Luby and C. Rackoff. How to Construct Pseudorandom Permutations from Pseudo-
Random Functions. SIAM Journal on Computing , Vol. 17, pages 373-386, 1988.
[157] C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic Methods for Interactive Proof
Systems. Journal of the ACM , Vol. 39, No. 4, pages 859-868, 1992.