Author:
Blundo Carlo,Galdi Clemente,Persiano Pino
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of round of interaction. In Proceedings of 8th ACM Symposium on Principles of Distributed Computing, pages 36–44, 1989.
2. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead. In Advances in Cryptology–CRYPTO 90, pages 62–76, 1990.
3. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In Proceedings of 22th Symposium on Theory of Computation, pages 503–513, 1990.
4. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proceedings of 20th Symposium on Theory of Computation, pages 1–10, 1988.
5. C. Blundo, A. De Santis, G. Persiano, and U. Vaccaro. Randomness complexity of private multiparty protocols. To appear in Computational Complexity (preliminary version ICALP 95), 1998.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献