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

Non-interactive Secure 2PC in the Offline/Online and Batch Settings

Payman Mohassel, Mike Rosulek

Published Jan 1, 2017• 22 citations
Publisher
DOI
10.1007/978-3-319-56617-7_15

Related papers

Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings

Yehuda Lindell, Ben Riva

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

On Perfectly Secure 2PC in the OT-Hybrid Model

Bar Alon, Anat Paskin-Cherniavsky

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

On perfectly secure 2PC in the OT-hybrid model

Bar Alon, Anat Paskin-Cherniavsky

Theoretical Computer Science•Sep 21, 2021•3 citations

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

Michele Ciampi, Ankit Kumar Misra, Rafail Ostrovsky +1 more

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

Richer Efficiency/Security Trade-offs in 2PC

Vladimir Kolesnikov, Payman Mohassel, Ben Riva +1 more

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

On Perfectly Secure 2PC in the OT-hybrid model.

Anat Paskin-Cherniavsky

•Jan 1, 2018•0 citations