Unconditional communication-efficient MPC via Hall's marriage theorem
From MaRDI portal
Publication:2128564
DOI10.1007/978-3-030-84245-1_10zbMath1486.94105OpenAlexW3185924840MaRDI QIDQ2128564
Yifan Song, Vipul Goyal, Antigoni Polychroniadou
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_10
Related Items (6)
Secure multiparty computation with free branching ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Cryptography with weights: MPC, encryption and signatures
Cites Work
- 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
- The price of low communication in secure multi-party computation
- Constant-overhead unconditionally secure multiparty computation over binary fields
- Guaranteed output delivery comes free in honest majority MPC
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Efficient fully secure computation via distributed zero-knowledge proofs
- 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
This page was built for publication: Unconditional communication-efficient MPC via Hall's marriage theorem
