On the Round Complexity of Black-Box Secure MPC-Reference-Cited by-同舟云学术

On the Round Complexity of Black-Box Secure MPC

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

Author:

Ishai Yuval,Khurana Dakshita,Sahai Amit,Srinivasan Akshayaram

Publisher

Springer International Publishing

Link

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

Reference61 articles.

1. Lecture Notes in Computer Science;A Afshar,2014

2. Lecture Notes in Computer Science;D Aggarwal,2016

3. Lecture Notes in Computer Science;D Aggarwal,2019

4. Lecture Notes in Computer Science;D Aggarwal,2015

5. Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 2087–2104. ACM Press (2017)

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

1. Black-Box Reusable NISC with Random Oracles;Advances in Cryptology – EUROCRYPT 2023;2023

2. Cryptographic Reverse Firewalls in Cyber-Physical Systems: Preliminaries and Outreach;Proceedings of the 4th International Conference on Big Data Analytics for Cyber-Physical System in Smart City - Volume 1;2023

3. List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing;Advances in Cryptology – CRYPTO 2023;2023

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

5. Succinct Arguments for RAM Programs via Projection Codes;Advances in Cryptology – CRYPTO 2023;2023