Linear overhead optimally-resilient robust MPC using preprocessing

DOI10.1007/978-3-319-44618-9_8MaRDI QIDQ2827715zbMATH OpenOpenAlexFDO

Authors Ashish Choudhury, Emmanuela Orsini, Arpita Patra, N. P. Smart

Publication date 21 October 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://eprints.iisc.ac.in/56171/1/Sec_Cry_Net_9481_147_2016.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Robust Multiparty Computation with Linear Communication Complexity
• scientific article; zbMATH DE number 1842487
• Perfectly-Secure MPC with Linear Communication Complexity
• Best of both worlds in secure computation, with low communication overhead
• Communication lower bounds for statistically secure MPC, with or without preprocessing

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• Asynchronous MPC with a strict honest majority using non-equivocation
• Asynchronous Multi-Party Computation with Quadratic Communication
• Asynchronous Multiparty Computation: Theory and Implementation
• Asynchronous secure computation
• Between a rock and a hard place: interpolating between MPC and FHE
• Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
• Efficient multi-party computation: from passive to active security via secure SIMD circuits
• How to withstand mobile virus attacks, revisited
• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• Multiparty Computation from Somewhat Homomorphic Encryption
• Multiparty computation with low communication, computation and interaction via threshold FHE
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• On Expected Constant-Round Protocols for Byzantine Agreement
• On the (limited) power of non-equivocation
• Optimally efficient multi-valued byzantine agreement
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Perfectly-Secure MPC with Linear Communication Complexity
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• Robust Multiparty Computation with Linear Communication Complexity
• Scalable and Unconditionally Secure Multiparty Computation
• Security and composition of multiparty cryptographic protocols
• Semi-homomorphic encryption and multiparty computation
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• Theory of Cryptography

Cited in

(1)

• A Unified Approach to MPC with Preprocessing Using OT

Describes a project that uses

Uses Software

• VIFF

This page was built for publication: Linear overhead optimally-resilient robust MPC using preprocessing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827715)