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

On Communication Models and Best-Achievable Security in Two-Round MPC

Aarushi Goel, Abhishek Jain, Manoj Prabhakaran, Rajeev Raghunath

Published Jan 1, 2021• 8 citations
Publisher
DOI
10.1007/978-3-030-90453-1_4

Related papers

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

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

On the Round Complexity of Black-Box Secure MPC

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

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

Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation

Sanjam Garg, Antigoni Polychroniadou

Lecture notes in computer science•Jan 1, 2015•52 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 Secure MPC from Indistinguishability Obfuscation

Sanjam Garg, Craig Gentry, Shai Halevi +1 more

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