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

Round-Optimal Black-Box MPC in the Plain Model

Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan

Published Jan 1, 2023• 7 citations
Publisher
DOI
10.1007/978-3-031-38557-5_13

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•0 citations

On the Round Complexity of Black-Box Secure MPC

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

Lecture notes in computer science•Jan 1, 2021•19 citations

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

Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan

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

Broadcast-Optimal Four-Round MPC in the Plain Model

Michele Ciampi, Ivan Damgård, Divya Ravi +3 more

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

Round-Optimal Black-Box Two-Party Computation

Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro

Lecture notes in computer science•Jan 1, 2015•38 citations

Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

Lecture notes in computer science•Jan 1, 2025•2 citations