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

Reusable Two-Round MPC from LPN

James Bartusek, Sanjam Garg, Akshayaram Srinivasan, Yinuo Zhang

Published Jan 1, 2022• 7 citations
Publisher
DOI
10.1007/978-3-030-97121-2_7

Related papers

Two-Round Adaptively Secure MPC from Isogenies, LPN, or CDH

Navid Alamati, Hart William Montgomery, Sikhar Patranabis +1 more

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

Reusable Two-Round MPC from DDH

James Bartusek, Sanjam Garg, Daniel Masny +1 more

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

Reusable Two-Round MPC from DDH.

Saikrishna Badrinarayanan, James Bartusek, Sanjam Garg +2 more

•Jan 1, 2020•0 citations

Two-Round Oblivious Transfer from CDH or LPN

Nico Döttling, Sanjam Garg, Mohammad Hajiabadi +2 more

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

On Two Round Rerunnable MPC Protocols.

Paul R. Laird

•Jan 1, 2017•0 citations

Two-Round Secure MPC from Indistinguishability Obfuscation

Sanjam Garg, Craig Gentry, Shai Halevi +1 more

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