Scaling fully secure MPC via robust recursive search and gap amplification
From MaRDI portal
Cites work
- An efficient passive-to-active compiler for honest-majority MPC over rings
- ATLAS: efficient and scalable MPC in the honest majority setting
- Brief announcement: Breaking the O(nm) bit barrier, secure multiparty computation with a static adversary
- Circuits resilient to additive attacks with applications to secure computation
- Communication Locality in Secure Multi-party Computation
- Communication-efficient unconditional MPC with guaranteed output delivery
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Efficient fully secure computation via distributed zero-knowledge proofs
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Fast large-scale honest-majority MPC for malicious adversaries
- Foundations of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- Fully homomorphic encryption using ideal lattices
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
- Guaranteed output delivery comes free in honest majority MPC
- How to share a secret
- scientific article; zbMATH DE number 1583776 (Why is no real title available?)
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- Perfectly-Secure MPC with Linear Communication Complexity
- Scalable and Unconditionally Secure Multiparty Computation
- Secure multi-party computation in large networks
- Secure multiparty computation with sublinear preprocessing
- Sublinear GMW-style compiler for MPC with preprocessing
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
This page was built for publication: Scaling fully secure MPC via robust recursive search and gap amplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363457)
