Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4:75–122, 1991.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncyptographic fault-tolerant distributed computation. In Proceedings of the 20 th annual ACM Symposium on the Theory of Computing, pages 1–10, 1988.
3. Lect Notes Comput Sci;D. Boneh,1997
4. Lect Notes Comput Sci;R. Canetti,1999
5. M. Cerecedo, T. Matsumoto, and H. Imai. Efficient and secure multiparty generation of digital signatures based on discrete logarithms. IEICE Transaction of Fundamentals of electronic Communications and Computer Science, E76-A(4):532–545, April 1993.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献