On the (Im)possibility of Cryptography with Imperfect Randomness

We investigate the feasibility of a variety of cryptographic tasks with imperfect randomness. The kind of imperfect randomness we consider are entropy sources, such as those considered by Santha and Vazirani, Chor and Goldreich, and Zuckerman. We show the following:

• Type: Conference
• Year: 2004
• Where: FOCS
• Authors: Yevgeniy Dodis, Shien Jin Ong, Manoj Prabhakaran, Amit Sahai
• Keywords: Entropy Sources, FOCS 2004, Imperfect Entropy Sources, Imperfect Randomness, Theoretical Computer Science