Simulating Fair Dice with Biased Coins

Information and Computation

Volumn 126, Issue 1, 1996, Pages 78-82

  Itoh, Toshiya ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347243152     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0036     Document Type: Article

References (7)

1. Blum, K., and Kannan, S., Designing programs that check their work, in "Proc. 21st Annual ACM Symposium on Theory of Computing, 1989," pp. 86-97.
2. Blum, M., Luby, M., and Rubinfeld, R., Self-testing/correcting with applications to numerical problems, in "Proc. 22nd Annual ACM Symposium on Theory of Computing, 1990," pp. 73-83.
3. Babai, L., and Moran, S., Arthur-Merlin Games: A randomized proof system and a hierarchy of complexity classes, J. Comput. System Sci. 36 (1988), 254-276.
4. Diffie, W., and Hellman, M. E., New directions in cryptography, IEEE Trans. Inform. Theory IT-22 (1976), 644-654.
5. El-Gamal, T., A public-key cryptosystem and a signature scheme based on discrete logarithm, IEEE Trans. Inform. Theory IT-31 (1985), 469-472.
6. Feldman, D., Impagliazzo, R., Naor, M., Nisan, N., Rudich, S., and Shamir, A., On dice and coins: Models of computation for random generation, Inform. and Comput. 104 (1993), 159-174.
7. Goldwasser, S., Micali, S., and Rackoff, C., The knowledge complexity of interactive proof systems, SIAM J. Comput. 18 (1989), 186-208.