Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer-Reference-Cited by-同舟云学术

Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer

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

Author:

Patra Arpita,Srinivasan Akshayaram

Publisher

Springer International Publishing

Link

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

Reference36 articles.

1. Lecture Notes in Computer Science;B Aiello,2001

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

3. Applebaum, B., Brakerski, Z., Garg, S., Ishai, Y., Srinivasan, A.: Separating two-round secure computation from oblivious transfer. In: Vidick, T. (ed.) 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, Seattle, Washington, USA, 12–14 January 2020, volume 151 of LIPIcs, pp. 71:1–71:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)

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

5. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: 22nd ACM STOC, pp. 503–513. ACM Press, May 1990

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

1. Cloud-SMPC: two-round multilinear maps secure multiparty computation based on LWE assumption;Journal of Cloud Computing;2024-01-22

2. Round-Optimal Black-Box MPC in the Plain Model;Advances in Cryptology – CRYPTO 2023;2023

3. Cybersecurity in India;Communications of the ACM;2022-10-20

4. Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications;Advances in Cryptology – CRYPTO 2022;2022

5. Round-Optimal Black-Box Protocol Compilers;Advances in Cryptology – EUROCRYPT 2022;2022