Semi-homomorphic Encryption and Multiparty Computation
From MaRDI portal
Publication:3003382
DOI10.1007/978-3-642-20465-4_11zbMath1281.94015OpenAlexW1494774797MaRDI QIDQ3003382
Claudio Orlandi, Sarah Zakarias, Rikke Bendlin, Ivan B. Damgård
Publication date: 27 May 2011
Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_11
Related Items
Oblivious TLS via multi-party computation ⋮ On CCA-Secure Somewhat Homomorphic Encryption ⋮ 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 ⋮ Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ An efficient structural attack on NIST submission DAGS ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ Secure Computation with Minimal Interaction, Revisited ⋮ Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits ⋮ \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation ⋮ Full-threshold actively-secure multiparty arithmetic circuit garbling ⋮ The cost of IEEE arithmetic in secure computation ⋮ Asymptotically quasi-optimal cryptography ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Secure computation with preprocessing via function secret sharing ⋮ MArBLed circuits: mixing arithmetic and Boolean circuits with active security ⋮ A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations ⋮ Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption ⋮ Actively secure half-gates with minimum overhead under duplex networks ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ Sok: vector OLE-based zero-knowledge protocols ⋮ CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ Cheater Detection in SPDZ Multiparty Computation ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Le Mans: dynamic and fluid MPC for dishonest majority ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle ⋮ Amortizing division and exponentiation ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ On linear communication complexity for (maximally) fluid MPC ⋮ One-message secure reductions: on the cost of converting correlations ⋮ Secure multiparty computation from threshold encryption based on class groups ⋮ Maliciously secure matrix multiplication with applications to private deep learning ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ Secure computation with low communication from cross-checking ⋮ Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Efficient one-sided adaptively secure computation ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications ⋮ Scalable Multi-party Private Set-Intersection ⋮ Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack ⋮ What security can we achieve within 4 rounds? ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ On the exact round complexity of secure three-party computation ⋮ Privacy preserving anomaly detection based on local density estimation ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ On the amortized complexity of zero-knowledge protocols ⋮ Private information retrieval with sublinear online time ⋮ Secure multi-party quantum computation with a dishonest majority ⋮ Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \) ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ The Geometry of Lattice Cryptography ⋮ Better Preprocessing for Secure Multiparty Computation ⋮ Masked triples. Amortizing multiplication triples across conditionals ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ High-Precision Secure Computation of Satellite Collision Probabilities ⋮ Network Oblivious Transfer ⋮ How to Prove Knowledge of Small Secrets ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Actively secure setup for SPDZ ⋮ Efficient pseudorandom correlation generators from ring-LPN ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures ⋮ The price of active security in cryptographic protocols
This page was built for publication: Semi-homomorphic Encryption and Multiparty Computation
