1. Awerbach, Blum, Chor, Goldwasser, Micali, A Provably Fair Coin Toss in A Byzantine Network, Submitted to PODC 1985.
2. Chor, Goldreich, RSA/Rabin Bits are $$ {1 \mathord{\left/ {\vphantom {1 2}} \right. \kern-\nulldelimiterspace} 2} + \frac{1} {{poly \left( {\left| N \right|} \right)}} $$ secure, Proc. of Crypto 84, Santa Barbara.
3. M. Blum, private communication.
4. L. Blum, M. Blum and M. Shub, A simple secure pseudo random number generator. Advances in Cryptology: Proc. of CRYPTO-82, ed D. Chaum. R.L. Rivest and A.T. Sherman. Plenum press 1983, pp 61–78.
5. Ben-Or, Chor, Shamir, On the Security of RSA Bits. Proceedings of 15th ACM symposuim on Theory of Computation, April 1983. pp. 421–430