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 Two-Party Computation

Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro

Published Jan 1, 2015• 38 citations
Publisher
DOI
10.1007/978-3-662-48000-7_17

Related papers

Round-Efficient Black-Box Construction of Composable Multi-Party Computation

Susumu Kiyoshima

Journal of Cryptology•Feb 5, 2018•0 citations

Round-Efficient Black-Box Construction of Composable Multi-Party Computation

Susumu Kiyoshima

Lecture notes in computer science•Jan 1, 2014•27 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•23 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

Round Optimal Two-Party Computation

Michele Ciampi, Luisa Siniscalchi

Information security and cryptography•Aug 21, 2025•0 citations

Round-Optimal Secure Two-Party Computation

Jonathan I. Katz, Rafail Ostrovsky

•Jan 1, 2004•0 citations