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

Efficient Scalable Constant-Round MPC via Garbled Circuits

Aner Ben-Efraim, Yehuda Lindell, Eran Omri

Published Jan 1, 2017• 30 citations
Publisher
DOI
10.1007/978-3-319-70697-9_17

Related papers

k-Round MPC from k-Round OT via Garbled Interactive Circuits.

Fabrice Benhamouda, Huijia Lin

•Jan 1, 2017•10 citations

Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing

Vipul Goyal, Junru Li, Rafail Ostrovsky +1 more

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

Constant-Round MPC with Fairness and Guarantee of Output Delivery

Steven Gordon, Feng-Hao Liu, Elaine Shi

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

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability

Carsten Baum, Emmanuela Orsini, Peter Schöll +1 more

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

Towards Efficiency-Preserving Round Compression in MPC: Do fewer rounds mean more computation?

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

•Jan 1, 2020•0 citations

Towards Efficiency-Preserving Round Compression in MPC

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

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