Author:
Kushilevitz Eyal,Ostrovsky Rafail,Prouff Emmanuel,Rosén Adi,Thillard Adrian,Vergnaud Damien
Publisher
Springer International Publishing
Reference21 articles.
1. Asharov, G., Lindell, Y.: A full proof of the BGW protocol for perfectly secure multiparty computation. J. Cryptology 30(1), 58–151 (2017)
2. Lecture Notes in Computer Science;D Beaver,1995
3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2–4, 1988, Chicago, Illinois, USA, pp. 1–10 (1988)
4. Lecture Notes in Computer Science;C Blundo,1999
5. Blundo, C., De Santis, A., Persiano, G., Vaccaro, U.: Randomness complexity of private computation. Comput. Complex. 8(2), 145–168 (1999)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Random Sources in Private Computation;Advances in Cryptology – ASIACRYPT 2022;2022