Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing

DOI10.1007/978-3-319-44618-9_8zbMath1400.68084OpenAlexW2479199546MaRDI QIDQ2827715

Arpita Patra, Emmanuela Orsini, Ashish Choudhury, Nigel 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)

Uses Software

• VIFF

Cites Work

• Unnamed Item
• (Leveled) Fully Homomorphic Encryption without Bootstrapping
• Security and composition of multiparty cryptographic protocols
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• Between a Rock and a Hard Place: Interpolating between MPC and FHE
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Multiparty Computation from Somewhat Homomorphic Encryption
• Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• On the (limited) power of non-equivocation
• Asynchronous MPC with a strict honest majority using non-equivocation
• How to withstand mobile virus attacks, revisited
• Semi-homomorphic Encryption and Multiparty Computation
• Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
• Asynchronous Multi-Party Computation with Quadratic Communication
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Scalable and Unconditionally Secure Multiparty Computation
• Asynchronous Multiparty Computation: Theory and Implementation
• Optimally efficient multi-valued byzantine agreement
• Asynchronous secure computation
• Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
• Perfectly-Secure MPC with Linear Communication Complexity
• Robust Multiparty Computation with Linear Communication Complexity
• On Expected Constant-Round Protocols for Byzantine Agreement
• Theory of Cryptography

This page was built for publication: Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing