Better preprocessing for secure multiparty computation

DOI10.1007/978-3-319-39555-5_18MaRDI QIDQ2822679zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

efficient multiparty computationPaillier encryptionpreprocessing

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25)

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

• A new approach to practical active-secure two-party computation
• A Unified Approach to MPC with Preprocessing Using OT
• Advances in Cryptology - CRYPTO 2003
• Better preprocessing for secure multiparty computation
• Constant-overhead secure computation of Boolean circuits using preprocessing
• Efficient constant round multi-party computation combining BMR and SPDZ
• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 1808209 (Why is no real title available?)
• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• Multiparty Computation from Somewhat Homomorphic Encryption
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• On the amortized complexity of zero knowledge protocols for multiplicative relations
• Polynomial Codes Over Certain Finite Fields
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Publicly auditable secure multi-party computation
• Secure multiparty computation goes live
• Semi-homomorphic encryption and multiparty computation

Cited in

(25)

• Overdrive: making SPDZ great again
• When it's all just too much: outsourcing MPC-preprocessing
• Preface (to the special issue on general secure multiparty computation)
• Efficient pseudorandom correlation generators from ring-LPN
• More efficient post-quantum KEMTLS with pre-distributed public keys
• Secure multiparty computation with sublinear preprocessing
• Secure computation with preprocessing via function secret sharing
• Efficient, actively secure MPC with a dishonest majority: a survey
• Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
• Better preprocessing for secure multiparty computation
• How to prove knowledge of small secrets
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• Efficient secure multiparty computation with identifiable abort
• More efficient constant-round multi-party computation from BMR and SHE
• Improved multiplication triple generation over rings via RLWE-based AHE
• Secure Multi-party Computation: Information Flow of Outputs and Game Theory
• Secure multi-party computation minimizing online rounds
• Low-communication multiparty triple generation for SPDZ from ring-LPN
• Secure two-party input-size reduction: challenges, solutions and applications
• MPClan: protocol suite for privacy-conscious computations
• Attaining GOD beyond honest majority with friends and foes
• Towards practical topology-hiding computation
• An algebraic framework for silent preprocessing with trustless setup and active security
• Tiresias: large scale, UC-secure threshold Paillier
• Using TopGear in overdrive: a more efficient ZKPoK for SPDZ

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)