Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On the Round Complexity of Black-Box Secure MPC

Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan

Published Jan 1, 2021• 19 citations
Publisher
DOI
10.1007/978-3-030-84245-1_8

Related papers

Round-Optimal Black-Box MPC in the Plain Model from Minimal Assumptions

Mohammad Hajiabadi, Ratnakar Medepalli, Akshayaram Srinivasan

Lecture notes in computer science•Jan 1, 2026•1 citation

Round-Optimal Black-Box MPC in the Plain Model

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

Lecture notes in computer science•Jan 1, 2023•8 citations

The Round Complexity of Black-Box Post-quantum Secure Computation

Rohit Chatterjee, Xiao Rong Liang, Omkant Pandey +1 more

arXiv:2502.13830•Lecture notes in computer science•Jan 1, 2025•3 citations

Two-Round MPC: Information-Theoretic and Black-Box

Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan

Lecture notes in computer science•Jan 1, 2018•40 citations

On the Round Complexity of Fully Secure Solitary MPC with Honest Majority

Saikrishna Badrinarayanan, Peihan Miao, Pratyay Mukherjee +1 more

Lecture notes in computer science•Jan 1, 2023•3 citations

Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More

Huijia Lin, Tianren Liu, Hoeteck Wee

Lecture notes in computer science•Jan 1, 2020•6 citations