Unconditionally secure MPC for Boolean circuits with constant communication
From MaRDI portal
Cites work
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Amortized complexity of information-theoretically secure MPC revisited
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- ATLAS: efficient and scalable MPC in the honest majority setting
- Circuits resilient to additive attacks with applications to secure computation
- Communication lower bounds for statistically secure MPC, with or without preprocessing
- Constant-overhead unconditionally secure multiparty computation over binary fields
- Degree-D reverse multiplication-friendly embeddings: constructions and applications
- Efficient fully secure computation via distributed zero-knowledge proofs
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Efficient multiparty protocols using circuit randomization
- Guaranteed output delivery comes free in honest majority MPC
- How to share a secret
- Order-C secure multiparty computation for highly repetitive circuits
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Scalable and Unconditionally Secure Multiparty Computation
- Secure Computation from Random Error Correcting Codes
- Sharing transformation and dishonest majority MPC with packed secret sharing
- The more the merrier: reducing the cost of large scale MPC
- Unconditional communication-efficient MPC via Hall's marriage theorem
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
This page was built for publication: Unconditionally secure MPC for Boolean circuits with constant communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443561)