Two Round Multiparty Computation via Multi-key FHE
From MaRDI portal
Publication:5739221
DOI10.1007/978-3-662-49896-5_26zbMath1351.94060OpenAlexW2499340481MaRDI QIDQ5739221
Pratyay Mukherjee, Daniel Wichs
Publication date: 15 July 2016
Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49896-5_26
Related Items (73)
YOSO: You only speak once. Secure MPC with stateless ephemeral roles ⋮ Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ Two-round MPC: information-theoretic and black-box ⋮ Two-round adaptively secure multiparty computation from standard assumptions ⋮ Multi-key FHE from LWE, Revisited ⋮ Targeted Homomorphic Attribute-Based Encryption ⋮ An improved affine equivalence algorithm for random permutations ⋮ Round-optimal and communication-efficient multiparty computation ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ Reusable Two-Round MPC from LPN ⋮ From FE combiners to secure MPC and back ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Multi-key and multi-input predicate encryption from learning with errors ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ Multi-key Homomorphic Proxy Re-Encryption ⋮ Statistical security in two-party computation revisited ⋮ mrNISC from LWE with polynomial modulus ⋮ mrNISC from LWE with polynomial modulus ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ Functional encryption with secure key leasing ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Multi-input attribute based encryption and predicate encryption ⋮ Maliciously secure massively parallel computation for all-but-one corruptions ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Unnamed Item ⋮ Privacy preserving multi-party computation delegation for deep learning in cloud computing ⋮ Batched fully dynamic multi-key FHE from FHEW-like cryptosystems ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Toward practical privacy-preserving linear regression ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Secure MPC: laziness leads to GOD ⋮ SLAP: simpler, improved private stream aggregation from ring learning with errors ⋮ Secure quantum computation with classical communication ⋮ Blockchains enable non-interactive MPC ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based ⋮ Foundations of Homomorphic Secret Sharing ⋮ A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE ⋮ Chosen-Ciphertext Secure Fully Homomorphic Encryption ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ On the exact round complexity of secure three-party computation ⋮ Round-optimal secure multi-party computation ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ On the enumeration of minimal non-pairwise compatibility graphs ⋮ Combiners for functional encryption, unconditionally ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Post-quantum multi-party computation ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Unbounded multi-party computation from learning with errors ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Towards accountability in CRS generation ⋮ BETA: biometric-enabled threshold authentication ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption ⋮ Spooky Encryption and Its Applications ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts ⋮ Breaking the Circuit Size Barrier for Secure Computation Under DDH ⋮ Reverse firewalls for actively secure MPCs ⋮ Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS ⋮ Unnamed Item ⋮ Homomorphic Encryption ⋮ Broadcast-optimal two-round MPC
This page was built for publication: Two Round Multiparty Computation via Multi-key FHE
