Efficient, actively secure MPC with a dishonest majority: a survey

DOI10.1007/978-3-030-68869-1_3OpenAlexW3129641267MaRDI QIDQ2232208

Emmanuela Orsini

Publication date: 4 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-68869-1_3

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)

Related Items (1)

Putting the online phase on a diet: covert security from short MACs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
• Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
• Overdrive: making SPDZ great again
• Threshold cryptosystems from threshold fully homomorphic encryption
• Amortization with fewer equations for proving knowledge of small secrets
• Catching MPC cheaters: identification and openability
• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• Efficient pseudorandom correlation generators from ring-LPN
• Efficient constant-round MPC with identifiable abort and public verifiability
• The price of active security in cryptographic protocols
• Efficient pseudorandom correlation generators: silent OT extension and more
• Maliciously secure oblivious linear function evaluation with constant overhead
• Fully homomorphic SIMD operations
• Secure multi-party computation without agreement
• Oblivious transfer and polynomial evaluation
• Better Preprocessing for Secure Multiparty Computation
• (Leveled) fully homomorphic encryption without bootstrapping
• How to Prove Knowledge of Small Secrets
• Improved OT Extension for Transferring Short Secrets
• Secure Multi-Party Computation with Identifiable Abort
• Dishonest Majority Multi-Party Computation for Binary Circuits
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Multiparty Computation from Somewhat Homomorphic Encryption
• A New Approach to Practical Active-Secure Two-Party Computation
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
• More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
• Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
• Semi-homomorphic Encryption and Multiparty Computation
• Binary AMD Circuits from Secure Multiparty Computation
• Efficient Secure Multiparty Computation with Identifiable Abort
• On the Amortized Complexity of Zero-Knowledge Protocols
• Actively Secure OT Extension with Optimal Overhead
• Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
• Founding Cryptography on Oblivious Transfer – Efficiently
• Secure Arithmetic Computation with No Honest Majority
• Secure Two-Party Computation Is Practical
• The Knowledge Complexity of Interactive Proof Systems
• A Toolkit for Ring-LWE Cryptography
• The IPS Compiler: Optimizations, Variants and Concrete Efficiency
• Circuits resilient to additive attacks with applications to secure computation
• Advances in Cryptology - CRYPTO 2003
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Efficient, actively secure MPC with a dishonest majority: a survey