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

Constant-Round MPC Protocols with Fall-Back Security

Anasuya Acharya, Aditya Patankar, Arpita Patra, Divya Ravi, Raghavendra Vernekar

Published Oct 30, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-43617-7_1

Related papers

Constant-Round MPC with Fairness and Guarantee of Output Delivery

Steven Gordon, Feng-Hao Liu, Elaine Shi

Lecture notes in computer science•Jan 1, 2015•80 citations

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability

Carsten Baum, Emmanuela Orsini, Peter Schöll +1 more

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

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

Constant-Round Asynchronous MPC with Optimal Resilience and Linear Communication

Junru Li, Yifan Song

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

Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing

Vipul Goyal, Junru Li, Rafail Ostrovsky +1 more

Lecture notes in computer science•Jan 1, 2025•4 citations