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 Secure Two-Party Computation from Trapdoor Permutations

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti

Published Jan 1, 2017• 27 citations
Publisher
DOI
10.1007/978-3-319-70500-2_23

Related papers

Round-Optimal Secure Two-Party Computation

Jonathan I. Katz, Rafail Ostrovsky

Lecture notes in computer science•Jan 1, 2004•176 citations

Round-Optimal Secure Two-Party Computation

Jonathan I. Katz, Rafail Ostrovsky

•Jan 1, 2004•0 citations

Round-Optimal Secure Multi-Party Computation

Shai Halevi, Carmit Hazay, Antigoni Polychroniadou +1 more

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

Round-Optimal Secure Multi-party Computation

Shai Halevi, Carmit Hazay, Antigoni Polychroniadou +1 more

Journal of Cryptology•May 13, 2021•14 citations

Round Optimal Two-Party Computation

Michele Ciampi, Luisa Siniscalchi

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

Round-Optimal Black-Box Two-Party Computation

Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro

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