Author:
Beimel Amos,Omri Eran,Orlov Ilan
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference25 articles.
1. Y. Aumann, Y. Lindell, Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptol.
23(2), 281–343 (2010)
2. B. Averbuch, M. Blum, B. Chor, S. Goldwasser, S. Micali, How to implement Bracha’s O(logn) Byzantine agreement algorithm, Unpublished manuscript (1985)
3. D. Beaver, S. Micali, P. Rogaway, The round complexity of secure protocols, in Proc. of the 22nd ACM Symp. on the Theory of Computing (1990), pp. 503–513
4. Lecture Notes in Computer Science;A. Beimel,2011
5. M. Blum, Coin flipping by telephone a protocol for solving impossible problems. SIGACT News
15(1), 23–27 (1983)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献