Degree 2 is Complete for the Round-Complexity of Malicious MPC-Reference-Cited by-同舟云学术

Degree 2 is Complete for the Round-Complexity of Malicious MPC

Published:2019 Issue: Volume: Page:504-531
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2019
language:
Short-container-title:

Author:

Applebaum Benny,Brakerski Zvika,Tsabary Rotem

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-17656-3_18

Reference24 articles.

1. Lecture Notes in Computer Science;P Ananth,2018

2. Ananth, P., Choudhuri, A.R., Goel, A., Jain, A.: Two round information-theoretic MPC with malicious security. Cryptology ePrint Archive, Report 2018/1078 (2018). https://eprint.iacr.org/2018/1078

3. Lecture Notes in Computer Science;B Applebaum,2018

4. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: Ortiz, H. (ed.) Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, USA, 13–17 May 1990, pp. 503–513. ACM (1990)

5. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, 2–4 May 1988, pp. 1–10. ACM (1988)

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. mrNISC from LWE with polynomial modulus;Information and Computation;2023-08

2. Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation;Journal of Cryptology;2023-06-29

3. The Round Complexity of Statistical MPC with Optimal Resiliency;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Two-round Multiparty Secure Computation from Minimal Assumptions;Journal of the ACM;2022-10-27

5. Two-Round MPC Without Round Collapsing Revisited – Towards Efficient Malicious Protocols;Advances in Cryptology – CRYPTO 2022;2022