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

Unconditionally Secure MPC for Boolean Circuits with Constant Communication

Yubo Zeng, Kang Yang, Dengguo Feng, Min Zhang

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-35418-1_1

Related papers

Round and Communication Efficient Unconditionally-Secure MPC with $$t<n/3$$ in Partially Synchronous Network

Ashish Choudhury, Arpita Patra, Divya Ravi

Lecture notes in computer science•Jan 1, 2017•5 citations

Perfectly-Secure MPC with Constant Online Communication Complexity

Yifan Song, Xiangtao Ye

Lecture notes in computer science•Dec 2, 2024•2 citations

A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity

Ignacio Cascudo, Jaron Skovsted Gundersen

Lecture notes in computer science•Jan 1, 2020•20 citations

Communication-Efficient Unconditional MPC with Guaranteed Output Delivery

Vipul Goyal, Yanyi Liu, Yifan Song

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

Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience

Arpita Patra, Ashish Choudhary, Chandrasekharan Pandu Rangan

Lecture notes in computer science•Jan 1, 2009•11 citations
Round and Communication Efficient Unconditionally-Secure MPC with t<n/3t<n/3t<n/3 in Partially Synchronous Network