\textsc{SuperPack}: dishonest majority MPC with constant online communication
From MaRDI portal
Publication:6061359
DOI10.1007/978-3-031-30617-4_8OpenAlexW4365806964MaRDI QIDQ6061359
Antigoni Polychroniadou, Daniel E. Escudero, Yifan Song, Chenkai Weng, Vipul Goyal
Publication date: 8 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30617-4_8
Related Items (1)
Cites Work
- Unnamed Item
- Fast large-scale honest-majority MPC for malicious adversaries
- Order-C secure multiparty computation for highly repetitive circuits
- ATLAS: efficient and scalable MPC in the honest majority setting
- Unconditional communication-efficient MPC via Hall's marriage theorem
- Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
- A note on the communication complexity of multiparty computation in the correlated randomness model
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Secure multi-party computation without agreement
- Efficient fully secure computation via distributed zero-knowledge proofs
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Semi-homomorphic Encryption and Multiparty Computation
- How to share a secret
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
- 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
- Le Mans: dynamic and fluid MPC for dishonest majority
- Sharing transformation and dishonest majority MPC with packed secret sharing
This page was built for publication: \textsc{SuperPack}: dishonest majority MPC with constant online communication
