Better preprocessing for secure multiparty computation
From MaRDI portal
Publication:2822679
DOI10.1007/978-3-319-39555-5_18zbMATH Open1346.68085OpenAlexW2477068038MaRDI QIDQ2822679FDOQ2822679
Authors: Carsten Baum, Tomas Toft, Rasmus Zakarias, Ivan B. Damgård 
Publication date: 4 October 2016
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-39555-5_18
Recommendations
- Secure multiparty computation with sublinear preprocessing
- Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Multiparty Computation from Somewhat Homomorphic Encryption
- When it's all just too much: outsourcing MPC-preprocessing
Cites Work
- Polynomial Codes Over Certain Finite Fields
- Title not available (Why is that?)
- Multiparty Computation from Somewhat Homomorphic Encryption
- A new approach to practical active-secure two-party computation
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Constant-overhead secure computation of Boolean circuits using preprocessing
- Semi-homomorphic encryption and multiparty computation
- Title not available (Why is that?)
- Secure multiparty computation goes live
- Advances in Cryptology - CRYPTO 2003
- Title not available (Why is that?)
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- On the amortized complexity of zero knowledge protocols for multiplicative relations
- A Unified Approach to MPC with Preprocessing Using OT
- Efficient constant round multi-party computation combining BMR and SPDZ
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- Better preprocessing for secure multiparty computation
- Publicly auditable secure multi-party computation
Cited In (24)
- Efficient, actively secure MPC with a dishonest majority: a survey
- Attaining GOD beyond honest majority with friends and foes
- When it's all just too much: outsourcing MPC-preprocessing
- Secure multi-party computation minimizing online rounds
- How to prove knowledge of small secrets
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory
- Secure computation with preprocessing via function secret sharing
- Overdrive: making SPDZ great again
- Secure multiparty computation with sublinear preprocessing
- An algebraic framework for silent preprocessing with trustless setup and active security
- Preface (to the special issue on general secure multiparty computation)
- Low-communication multiparty triple generation for SPDZ from ring-LPN
- Secure two-party input-size reduction: challenges, solutions and applications
- Efficient secure multiparty computation with identifiable abort
- More efficient constant-round multi-party computation from BMR and SHE
- Efficient pseudorandom correlation generators from ring-LPN
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
- Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
- MPClan: protocol suite for privacy-conscious computations
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Towards practical topology-hiding computation
- Better preprocessing for secure multiparty computation
- Improved multiplication triple generation over rings via RLWE-based AHE
- More efficient post-quantum KEMTLS with pre-distributed public keys
This page was built for publication: Better preprocessing for secure multiparty computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822679)
