Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits

DOI10.1007/978-3-662-48000-7_35zbMath1352.94037OpenAlexW2295641361MaRDI QIDQ3457092

Yuval Ishai, Daniel Genkin, Antigoni Polychroniadou

Publication date: 10 December 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_35

zbMATH Keywords

secure SIMD circuits

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Circuits, networks (94C99)

Related Items (16)

Fluid MPC: secure multiparty computation with dynamic participants ⋮ Unconditional communication-efficient MPC via Hall's marriage theorem ⋮ Binary AMD Circuits from Secure Multiparty Computation ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Round-optimal secure multi-party computation ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Order-C secure multiparty computation for highly repetitive circuits ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ On the Communication Required for Unconditionally Secure Multiplication ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings

Cites Work

• Efficient secure two-party protocols. Techniques and constructions
• Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
• Semi-homomorphic Encryption and Multiparty Computation
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Founding Cryptography on Oblivious Transfer – Efficiently
• Secure Arithmetic Computation with No Honest Majority
• Scalable and Unconditionally Secure Multiparty Computation
• An O (log n ) expected rounds randomized byzantine generals protocol
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Oblivious Polynomial Evaluation

This page was built for publication: Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits