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

Perfectly-Secure MPC with Constant Online Communication Complexity

Yifan Song, Xiangtao Ye

Published Dec 2, 2024• 2 citations
Publisher
DOI
10.1007/978-3-031-78023-3_11

Related papers

Perfectly-Secure MPC with Linear Communication Complexity

Zuzana Beerliová-Trubíniová, Martin Hirt

Springer eBooks•Feb 25, 2008•225 citations

Adaptively Secure MPC with Sublinear Communication Complexity

Ran Cohen, Abhi A. Shelat, Daniel Wichs

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

Adaptively Secure MPC with Sublinear Communication Complexity

Ran Cohen, Abhi A. Shelat, Daniel Wichs

Journal of Cryptology•Mar 22, 2023•4 citations

Detect, Pack and Batch: Perfectly Secure MPC with Linear Communication and Constant Expected Time

Ittai Abraham, Gilad Asharov, Shravani Patil +1 more

Journal of Cryptology•Oct 19, 2026•0 citations

Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time

Ittai Abraham, Gilad Asharov, Shravani Mahesh Patil +1 more

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

Actively Secure MPC in the Dishonest Majority Setting: Achieving Constant Complexity in Online Communication, Computation Per Gate, Rounds, and Private Input Size

Seung Hwan Lee, Jaesang Noh, Taejeong Kim +2 more

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