1. L. Babai, S. Moran. Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes. J. Comput. System Sci. 36 (1988), 254–276.
2. J. Bar-Ilan, D. Beaver, Non-Cryptographic Fault-Tolerant Computing in a Constant Expected Number of Rounds of Interaction. Proc. PODC, ACM, New York, 1989, pp. 201–209.
3. D. Beaver. Secure Multiparty Protocols Tolerating Half Faulty Processors. Proceedings of Crypto 1989, ACM, New York, 1989. Also appeared as Technical Report TR-19–88, Harvard University, September, 1988.
4. D. Beaver. Perfect Privacy for Two-Party Protocols. Proc. DIMACS Workshop on Distributed Computing and Cryptography, Princeton, NJ, October, 1989, J. Feigenbaum, M. Merritt (eds.). Preliminary version in Technical Report TR-11-89, Harvard University.
5. D. Beaver. Formal Definitions for Secure Distributed Protocols Proc. DIMACS Workshop on Distributed Computing and Cryptography, Princeton, NJ, October, 1989, J. Feigenbaum, M. Merritt (eds.).