Constant-overhead unconditionally secure multiparty computation over binary fields
From MaRDI portal
Publication:2056769
DOI10.1007/978-3-030-77886-6_28OpenAlexW3109351938MaRDI QIDQ2056769
Antigoni Polychroniadou, Yifan Song
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_28
Related Items (6)
Unconditional communication-efficient MPC via Hall's marriage theorem ⋮ Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) ⋮ On interactive oracle proofs for Boolean R1CS statements ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Constant-overhead unconditionally secure multiparty computation over binary fields
Cites Work
- Unnamed Item
- Fast large-scale honest-majority MPC for malicious adversaries
- Amortized complexity of information-theoretically secure MPC revisited
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- Constant-overhead unconditionally secure multiparty computation over binary fields
- Guaranteed output delivery comes free in honest majority MPC
- The price of active security in cryptographic protocols
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Communication-efficient unconditional MPC with guaranteed output delivery
- Efficient fully secure computation via distributed zero-knowledge proofs
- Multiparty Computation from Somewhat Homomorphic Encryption
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- A New Approach to Practical Active-Secure Two-Party Computation
- How to share a secret
- Scalable and Unconditionally Secure Multiparty Computation
- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
- Circuits resilient to additive attacks with applications to secure computation
- Perfectly-Secure MPC with Linear Communication Complexity
This page was built for publication: Constant-overhead unconditionally secure multiparty computation over binary fields
