Broadcast-Optimal Two Round MPC with an Honest Majority-Reference-Cited by-同舟云学术

Broadcast-Optimal Two Round MPC with an Honest Majority

Published:2021 Issue: Volume: Page:155-184
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2021
language:
Short-container-title:

Author:

Damgård Ivan,Magri Bernardo,Ravi Divya,Siniscalchi Luisa,Yakoubov Sophia

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-84245-1_6

Reference24 articles.

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

2. Lecture Notes in Computer Science;P Ananth,2019

3. Lecture Notes in Computer Science;B Barak,2001

4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th ACM STOC. ACM Press, May 1988

5. Badrinarayanan, S., Miao, P., Mukherjee, P., Ravi, D.: On the round complexity of fully secure solitary MPC with honest majority. Cryptology ePrint Archive, Report 2021/241 (2021). https://eprint.iacr.org/2021/241

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

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

2. On the Round Complexity of Fully Secure Solitary MPC with Honest Majority;Theory of Cryptography;2023

3. Broadcast-Optimal Four-Round MPC in the Plain Model;Theory of Cryptography;2023

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

5. Round-Optimal Multi-party Computation with Identifiable Abort;Advances in Cryptology – EUROCRYPT 2022;2022