ATLAS: efficient and scalable MPC in the honest majority setting
From MaRDI portal
Publication:2128563
DOI10.1007/978-3-030-84245-1_9zbMath1486.94104OpenAlexW3183320454MaRDI QIDQ2128563
Hanjun Li, Yifan Song, Vipul Goyal, Rafail Ostrovsky, Antigoni Polychroniadou
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_9
Related Items (6)
Secure multiparty computation with free branching ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ On linear communication complexity for (maximally) fluid MPC
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast large-scale honest-majority MPC for malicious adversaries
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- Secure two-party computation via cut-and-choose oblivious transfer
- Guaranteed output delivery comes free in honest majority MPC
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Communication-efficient unconditional MPC with guaranteed output delivery
- On the Communication Required for Unconditionally Secure Multiplication
- 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
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Scalable and Unconditionally Secure Multiparty Computation
- Circuits resilient to additive attacks with applications to secure computation
- Perfectly-Secure MPC with Linear Communication Complexity
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
This page was built for publication: ATLAS: efficient and scalable MPC in the honest majority setting
