On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
From MaRDI portal
Publication:5415546
DOI10.1145/2213977.2214086zbMath1286.68114OpenAlexW2048994663MaRDI QIDQ5415546
Eran Tromer, Vinod Vaikuntanathan, Adriana López-Alt
Publication date: 13 May 2014
Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2213977.2214086
Related Items (95)
On the round complexity of secure quantum computation ⋮ On the deductive security of queries to confidential databases in cloud computing systems ⋮ A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs ⋮ A trace map attack against special ring-LWE samples ⋮ Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM ⋮ Homomorphic Encryption Standard ⋮ Analysis of Gong et al.'s CCA2-secure homomorphic encryption ⋮ Homomorphic AES evaluation using the modified LTV scheme ⋮ Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption ⋮ Fully Homomorphic Encryption with Auxiliary Inputs ⋮ Blending FHE-NTRU Keys – The Excalibur Property ⋮ Multi-key FHE from LWE, Revisited ⋮ Targeted Homomorphic Attribute-Based Encryption ⋮ Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) ⋮ Transciphering, using FiLIP and TFHE for an efficient delegation of computation ⋮ Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials ⋮ Privacy Assurances in Multiple Data-Aggregation Transactions ⋮ Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems ⋮ Round-optimal and communication-efficient multiparty computation ⋮ Anonymity of NIST PQC round 3 KEMs ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ Bootstrapping for helib ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ Depth Optimized Efficient Homomorphic Sorting ⋮ Private Computation on Encrypted Genomic Data ⋮ Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms ⋮ On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes ⋮ Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes ⋮ Multi-key and multi-input predicate encryption from learning with errors ⋮ Privacy-preserving multikey computing framework for encrypted data in the cloud ⋮ Flattening NTRU for evaluation key free homomorphic encryption ⋮ Characterizing overstretched NTRU attacks ⋮ Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes ⋮ Secure Computation of Inner Product of Vectors with Distributed Entries and Its Applications to SVM ⋮ Multi-key Homomorphic Proxy Re-Encryption ⋮ Verifiable Decryption for Fully Homomorphic Encryption ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ mrNISC from LWE with polynomial modulus ⋮ Homomorphic encryption: a mathematical survey ⋮ A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle ⋮ mrNISC from LWE with polynomial modulus ⋮ FINAL: faster FHE instantiated with NTRU and LWE ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ D-NTRU: more efficient and average-case IND-CPA secure NTRU variant ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Multi-input attribute based encryption and predicate encryption ⋮ Maliciously secure massively parallel computation for all-but-one corruptions ⋮ On the hardness of the NTRU problem ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ A verifiable \((k,n)\)-threshold quantum secure multiparty summation protocol ⋮ Unnamed Item ⋮ Privacy preserving multi-party computation delegation for deep learning in cloud computing ⋮ Batched fully dynamic multi-key FHE from FHEW-like cryptosystems ⋮ Security considerations for Galois non-dual RLWE families ⋮ Private AI: Machine Learning on Encrypted Data ⋮ Attacks on the Search RLWE Problem with Small Errors ⋮ Secure MPC: laziness leads to GOD ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based ⋮ Provably secure NTRUEncrypt over any cyclotomic field ⋮ BI-NTRU Encryption Schemes: Two New Secure Variants of NTRU ⋮ A Lattice Attack on Homomorphic NTRU with Non-invertible Public Keys ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Trusted computing with addition machines. I ⋮ The polynomial approximate common divisor problem and its application to the fully homomorphic encryption ⋮ A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE ⋮ Circuit-Private Multi-key FHE ⋮ Provably Secure NTRU Instances over Prime Cyclotomic Rings ⋮ Revisiting Lattice Attacks on Overstretched NTRU Parameters ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ Candidate iO from homomorphic encryption schemes ⋮ A framework for cryptographic problems from linear algebra ⋮ On the deductive security of queries to databases with multi-bit records ⋮ Multi-input Functional Encryption and Its Application in Outsourcing Computation ⋮ Efficient and secure outsourced approximate pattern matching protocol ⋮ Integer Version of Ring-LWE and Its Applications ⋮ Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits ⋮ Post-quantum multi-party computation ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ High-Precision Secure Computation of Satellite Collision Probabilities ⋮ The Feasibility of Outsourced Database Search in the Plain Model ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption ⋮ Spooky Encryption and Its Applications ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts ⋮ Breaking the Circuit Size Barrier for Secure Computation Under DDH ⋮ A new scale-invariant homomorphic encryption scheme ⋮ VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets ⋮ Dynamic decentralized functional encryption ⋮ Keyed-fully homomorphic encryption without indistinguishability obfuscation ⋮ An optimized GHV-type HE scheme: simpler, faster, and more versatile ⋮ Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS ⋮ Worst-case to average-case reductions for module lattices ⋮ Homomorphic Encryption
Uses Software
This page was built for publication: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
