1. M. Blum and S. Goldwasser, “An efficient probabilistic public-key encryption scheme which hides all partial information”, CRYPTO 84.
2. M. Blum, and S. Micali “How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits”, FOCS 82 and SIAM J. on Computing, Vol 13, 1984, pp. 850–864.
3. M. Ben-or, S. Goldwasser, and A. Wigderson, “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation”, STOC 88.
4. R. Canetti, U. Feige, O. Goldreich, and M. Naor, “Adaptively Secure Multi-Party Computation”, STOC 96.
5. R. Canetti, E. Kushilevitz, R. Ostrovsky, and A. Rosén, “Randomness vs. Fault-Tolerance”, PODC 97.