Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
From MaRDI portal
Publication:2925559
DOI10.1007/978-3-642-40203-6_1zbMath1406.94041OpenAlexW1635361314MaRDI QIDQ2925559
Marcel Keller, Valerio Pastro, Peter Scholl, Enrique Larraia, Nigel P. Smart, Ivan B. Damgård
Publication date: 16 October 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://link.springer.com/chapter/10.1007/978-3-642-40203-6_1
Related Items (66)
Compilation of function representations for secure computing paradigms ⋮ Oblivious TLS via multi-party computation ⋮ Multi-party revocation in sovrin: performance through distributed trust ⋮ Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP ⋮ Sublinear GMW-style compiler for MPC with preprocessing ⋮ An efficient structural attack on NIST submission DAGS ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Improving the efficiency of AES protocols in multi-party computation ⋮ Actively Secure OT Extension with Optimal Overhead ⋮ \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation ⋮ Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms ⋮ The cost of IEEE arithmetic in secure computation ⋮ Honest majority MPC with abort with minimal online communication ⋮ Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data ⋮ Improved signature schemes for secure multi-party computation with certified inputs ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) ⋮ Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN ⋮ Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings ⋮ MArBLed circuits: mixing arithmetic and Boolean circuits with active security ⋮ Absentia: secure multiparty computation on ethereum ⋮ Kicking-the-bucket: fast privacy-preserving trading using buckets ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ Cheater Detection in SPDZ Multiparty Computation ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications ⋮ Le Mans: dynamic and fluid MPC for dishonest majority ⋮ Verifiable decryption in the head ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings ⋮ Financially backed covert security ⋮ Maliciously secure matrix multiplication with applications to private deep learning ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ On multiparty garbling of arithmetic circuits ⋮ Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ On the Computational Overhead of MPC with Dishonest Majority ⋮ Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack ⋮ Block cipher invariants as eigenvectors of correlation matrices ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \) ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ Better Preprocessing for Secure Multiparty Computation ⋮ Verifiable Multi-party Computation with Perfectly Private Audit Trail ⋮ Masked triples. Amortizing multiplication triples across conditionals ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ How to Prove Knowledge of Small Secrets ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Efficient constant-round multi-party computation combining BMR and SPDZ ⋮ Actively secure setup for SPDZ ⋮ Efficient pseudorandom correlation generators from ring-LPN ⋮ Black-box transformations from passive to covert security with public verifiability ⋮ Improved primitives for MPC over mixed arithmetic-binary circuits ⋮ Efficient two-party exponentiation from quotient transfer ⋮ Efficient compiler to covert security with public verifiability for honest majority MPC ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings ⋮ The price of active security in cryptographic protocols
This page was built for publication: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
