Two Round Information-Theoretic MPC with Malicious Security-Reference-Cited by-同舟云学术

Two Round Information-Theoretic MPC with Malicious Security

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

Author:

Ananth Prabhanjan,Choudhuri Arka Rai,Goel Aarushi,Jain Abhishek

Publisher

Springer International Publishing

Link

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

Reference37 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. IACR Cryptology ePrint Archive 2018, 1078 (2018). https://eprint.iacr.org/2018/1078

3. Applebaum, B., Brakerski, Z., Tsabary, R.: Perfect secure computation in two rounds. In: 16th International Conference on Theory of Cryptography, TCC 2018 (2018). https://eprint.iacr.org/2018/894

4. Applebaum, B., Brakerski, Z., Tsabary, R.: Degree 2 is complete for the round-complexity of malicious MPC (2019). https://eprint.iacr.org/2019/200

5. Lecture Notes in Computer Science;S Badrinarayanan,2018

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

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

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

3. Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels;Progress in Cryptology – LATINCRYPT 2023;2023

4. Minimizing Setup in Broadcast-Optimal Two Round MPC;Advances in Cryptology – EUROCRYPT 2023;2023

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