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

Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation

Sanjam Garg, Antigoni Polychroniadou

Published Jan 1, 2015• 52 citations
Publisher
DOI
10.1007/978-3-662-46497-7_24

Related papers

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

Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation

Ran Canetti, Shafi Goldwasser, Oxana Poburinnaya

Lecture notes in computer science•Jan 1, 2015•41 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

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

Constant-Round MPC Protocols with Fall-Back Security

Anasuya Acharya, Aditya Patankar, Arpita Patra +2 more

Lecture notes in computer science•Oct 30, 2026•0 citations

Two Round Information-Theoretic MPC with Malicious Security

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

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