Cryptography and Security

Pseudorandomness and Cryptographic Applications
Michael Luby
Princeton Computer Science Notes
Princeton University Press
David R. Hanson and Robert E. Tarjan, Editors,
Princeton University Press, January 1996.

A Pseudorandom generator from any one-way function (381 K)
Johan Hastad, Russell Impagliazzo, Leonid Levin, Michael Luby
There is a preliminary version in 21rst STOC, 1989.
This is the final version as it will appear in SIAM J. on Computing.

Combinatorial Bounds for Broadcast Encryption (193 K)
Michael Luby, Jessica Staddon
To appear in Eurocrypt, June 1-4, 1998.

On the Existence of Pseudorandom Generators
Oded Goldreich, Hugo Krawczyk, Michael Luby
Preliminary version in 29th FOCS, 1988.
Final version in SIAM J. on Computing, Vol. 22, No. 6, December 1993, pp. 1163-1175.

Security of Blind Digital Signatures (152K)
Ari Juels, Michael Luby, Rafi Ostrovsky

One-way Functions are Essential for Complexity Based Cryptography
Russell Impagliazzo, Michael Luby
30th FOCS, 1989.

How to Construct Pseudorandom Permutations from Pseudorandom Functions
Michael Luby, Charles Rackoff
Preliminary version in 18th STOC, 1986.
Final version in SIAM J. on Computing, Vol. 17, No. 2, April 1988.

How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically Biased Coin
Michael Luby, Silvio Micali, Charles Rackoff
24th FOCS, 1983.

A Study of Password Security
Michael Luby, Charles Rackoff
Preliminary version in proceedings of CRYPTO, 1987.
Final version in J. of Cryptology, Vol. 1, No. 3, 1989, pp. 151-158.