Author:
Beaver Donald,Haber Stuart
Publisher
Springer Berlin Heidelberg
Reference31 articles.
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-Han, D. Beaver. “Non-Cryptographic Fault-Tolerant Computing in a Constant Expected Number of Rounds of Interaction.” Proceedings of PODC, ACM, 1989, 201–209.
3. D. Beaver. “Secure Multiparty Protocols and Zero Knowledge Proof Systems Tolerating a Faulty Minority.” J. Cryptology. 4:2, 1991, 75–122. An earlier version appeared as “Secure Multiparty Protocols Tolerating Half Faulty Processors” in CRYPTO’ 89, G. Brassard, ed., Springer-Verlag LNCS 435, 1990.
4. D. Beaver. “Formal Definitions for Secure Distributed Protocols.” Proceedings of the DIMACS Workshop on Distributed Computing and Cryptography, Princeton, NJ, October, 1989, J. Feigenbaum, M. Merritt (eds.).
5. D. Beaver. Security, Fault Tolerance, and Communication Complexity in Distributed Systems. Ph.D. Thesis, Harvard University, Cambridge, 1990.
Cited by
53 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献