Author:
Cohen Ran,Haitner Iftach,Omri Eran,Rotem Lior
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference61 articles.
1. B. Alon, E. Omri, Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious, in Proceedings of the 14th Theory of Cryptography Conference, TCC 2016-B, Part I (2016), pp. 307–335
2. Y. Aumann, Y. Lindell, Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptol. 23(2), 281–343 (2010)
3. B. Awerbuch, M. Blum, B. Chor, S. Goldwasser, S. Micali. How to implement Bracha’s $${O}(\log n)$$ Byzantine agreement algorithm, 1985. Unpublished manuscript.
4. C. Baum, E. Orsini, P. Scholl, Efficient secure multiparty computation with identifiable abort, in Proceedings of the 14th Theory of Cryptography Conference, TCC 2016-B, Part I (2016), pp. 461–490
5. A. Beimel, Y. Lindell, E. Omri, I. Orlov. 1/p-secure multiparty computation without honest majority and the best of both worlds. In P. Rogaway, editor, Advances in Cryptology—-CRYPTO 2011, volume 6841 of Lecture Notes in Computer Science (Springer, 2011), pp. 277–296
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献