Sharing transformation and dishonest majority MPC with packed secret sharing
From MaRDI portal
Publication:6111539
DOI10.1007/978-3-031-15985-5_1zbMath1517.94193OpenAlexW4312681946MaRDI QIDQ6111539
Vipul Goyal, Antigoni Polychroniadou, Yifan Song
Publication date: 7 July 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15985-5_1
secure multi-party computationpacked Beaver triplessharing transformationsparsely packed Shamir sharing
Related Items (1)
Cites Work
- Unnamed Item
- Fast large-scale honest-majority MPC for malicious adversaries
- Amortized complexity of information-theoretically secure MPC revisited
- Order-C secure multiparty computation for highly repetitive circuits
- The more the merrier: reducing the cost of large scale MPC
- Constant-overhead unconditionally secure multiparty computation over binary fields
- ATLAS: efficient and scalable MPC in the honest majority setting
- Unconditional communication-efficient MPC via Hall's marriage theorem
- Sublinear GMW-style compiler for MPC with preprocessing
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- A note on the communication complexity of multiparty computation in the correlated randomness model
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Efficient fully secure computation via distributed zero-knowledge proofs
- On the Communication Required for Unconditionally Secure Multiplication
- Multiparty Computation from Somewhat Homomorphic Encryption
- 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
This page was built for publication: Sharing transformation and dishonest majority MPC with packed secret sharing
