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

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

Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan

Published Jan 1, 2018• 37 citations
Publisher
DOI
10.1007/978-3-030-03807-6_5

Related papers

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

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

Two Round Information-Theoretic MPC with Malicious Security

Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel +1 more

Lecture notes in computer science•Jan 1, 2019•26 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

Round-Optimal Black-Box Two-Party Computation

Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro

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