Author:
Ishai Yuval,Prabhakaran Manoj,Sahai Amit
Publisher
Springer Berlin Heidelberg
Reference61 articles.
1. Abadi, M., Feigenbaum, J.: Secure circuit evaluation. J. Cryptology 2(1), 1–12 (1990)
2. Lecture Notes in Computer Science;J. Algesheimer,2002
3. Lecture Notes in Computer Science;Y. Aumann,2007
4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC 1988, pp. 1–10 (1988)
5. Benaloh, J.: Verifiable Secret-Ballot Elections. PhD thesis, Department of Computer Science, Yale University (1987)
Cited by
90 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Price of Active Security in Cryptographic Protocols;Journal of Cryptology;2024-07
2. Optimal Load-Balanced Scalable Distributed Agreement;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Scalable Agreement Protocols with Optimal Optimistic Efficiency;Lecture Notes in Computer Science;2024
4. Scalable Multiparty Garbling;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15
5. Proximity Gaps for Reed–Solomon Codes;Journal of the ACM;2023-10-11