Author:
Feldman Paul,Micali Silvio
Publisher
Springer Berlin Heidelberg
Reference33 articles.
1. J. Benaloh, Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret, Proceedings of Crypto 1986.
2. Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols, Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, August 1983, pp. 27–30.
3. M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, May 1988.
4. Safeguarding Cryptographic Keys, Proc. AFIPS June 1979 NCC Vol. 48, pp.313–317.
5. G. Bracha, An O (log n) Expected Rounds Randomized Byzantine Generals Protocol, Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, May 1985.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献