Unconditionally Secure MPC for Boolean Circuits with Constant Communication
- 12 August 2026
- book chapter
- Published by Springer Nature
- p. 3-35
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Order-C Secure Multiparty Computation for Highly Repetitive Circuits2021
- A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity2020
- Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $2020
- Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs2020
- Guaranteed Output Delivery Comes Free in Honest Majority MPC2020
- Efficient Information-Theoretic Secure Multiparty Computation over $\mathbb {Z}/p^k\mathbb {Z}$ via Galois Rings2019
- Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing2019
- Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs2019
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields2006
- Efficient Multiparty Protocols Using Circuit Randomization2001