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

Black-Box Constant-Round Secure 2PC with Succinct Communication

Michele Ciampi, Ankit Kumar Misra, Rafail Ostrovsky, Akash Shah

Published Jan 1, 2025• 5 citations
Publisher
DOI
10.1007/978-3-031-91092-0_13

Related papers

Round-Optimal Black-Box Commit-and-Prove with Succinct Communication

Susumu Kiyoshima

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

Round-Optimal Black-Box Two-Party Computation

Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro

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

Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol

Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto

Lecture notes in computer science•Jan 1, 2014•24 citations

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

Arpita Patra, Akshayaram Srinivasan

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

Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

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