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

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

Huijia Lin, Tianren Liu, Hoeteck Wee

Published Jan 1, 2020• 6 citations
Publisher
DOI
10.1007/978-3-030-64378-2_18

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

Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation

Sanjam Garg, Antigoni Polychroniadou

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

Two-Round MPC: Information-Theoretic and Black-Box

Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan

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

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

Aarushi Goel, Abhishek Jain, Manoj Prabhakaran +1 more

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