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

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

Fabrice Benhamouda, Huijia Lin

Published Jan 1, 2017• 10 citations
OpenAlex

Related papers

Efficient Scalable Constant-Round MPC via Garbled Circuits

Aner Ben-Efraim, Yehuda Lindell, Eran Omri

Lecture notes in computer science•Jan 1, 2017•30 citations

k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits

Fabrice Benhamouda, Huijia Lin

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

Two-Round MPC Without Round Collapsing Revisited – Towards Efficient Malicious Protocols

Huijia Lin, Tianren Liu

Lecture notes in computer science•Jan 1, 2022•1 citation

Towards Efficiency-Preserving Round Compression in MPC: Do Fewer Rounds Mean More Computation?

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

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

Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More

Huijia Lin, Tianren Liu, Hoeteck Wee

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

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

Carmit Hazay, Peter Schöll, Eduardo Soria-Vázquez

Lecture notes in computer science•Jan 1, 2017•82 citations