On the dealer's randomness required in secret sharing schemes. Carlo Blundo, Alfredo De Santis, and Ugo Vaccaro. Randomness in distribution protocols. Jeff A. Edmonds. Uriel Feige and Joe Kilian.
Impossibility results for recycling random bits in two-prover proof systems.
A Chernoff bound for random walks on expander graphs. Oded Goldreich and Avi Wigderson. Russell Impagliazzo and Moni Naor. Efficient cryptographic schemes provably as secure as subset sum. Russell Impagliazzo and Avi Wigderson.