Multikey Fully Homomorphic Encryption and Applications

DOI10.1137/14100124XzbMath1382.68058OpenAlexW2774864053WikidataQ122213094 ScholiaQ122213094MaRDI QIDQ4599146

Eran Tromer, Adriana López-Alt, Vinod Vaikuntanathan

Publication date: 18 December 2017

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/14100124x

zbMATH Keywords

cloud computingfully homomorphic encryptionmultiparty computationNTRU encryption

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Uses Software

• Pinocchio
• NTRU
• zk-SNARK
• ADSNARK
• fhe

Cites Work

• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
• Recursive composition and bootstrapping for SNARKS and proof-carrying data
• On the Size of Pairing-Based Non-interactive Arguments
• Two Round Multiparty Computation via Multi-key FHE
• Two-Round Secure MPC from Indistinguishability Obfuscation
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Advances in cryptology - CRYPTO 2001. 21st annual international cryptology conference, Santa Barbara, CA, USA, August 19--23, 2001. Proceedings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Advances in cryptology -- EUROCRYPT 2016. 35th annual international conference on the theory and applications of cryptographic techniques, Vienna, Austria, May 8--12, 2016. Proceedings. Part II
• Advances in cryptology -- CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19--23, 2012. Proceedings
• Advances in cryptology -- EUROCRYPT 2011. 30th annual international conference on the theory and applications of cryptographic techniques, Tallinn, Estonia, May 15--19, 2011. Proceedings
• Theory of cryptography. 9th theory of cryptography conference, TCC 2012, Taormina, Sicily, Italy, March 19--21, 2012. Proceedings
• Advances in cryptology -- EUROCRYPT 2010. 29th annual international conference on the theory and applications of cryptographic techniques, French Riviera, May 30 -- June 3, 2010. Proceedings
• Advances in cryptology - CRYPTO 2010. 30th annual cryptology conference, Santa Barbara, CA, USA, August 15--19, 2010. Proceedings
• Definitions and properties of zero-knowledge proof systems
• Scalable zero knowledge via cycles of elliptic curves
• Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings
• Advances in cryptology -- CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14--18, 2011. Proceedings
• Fully homomorphic SIMD operations
• Lower bounds for non-black-box zero knowledge
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• (Leveled) fully homomorphic encryption without bootstrapping
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• Spooky Encryption and Its Applications
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Between a Rock and a Hard Place: Interpolating between MPC and FHE
• Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
• Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Fully Homomorphic Encryption with Polylog Overhead
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Better Bootstrapping in Fully Homomorphic Encryption
• Ring-LWE in Polynomial Rings
• Ring Switching in BGV-Style Homomorphic Encryption
• Multiparty Computation from Somewhat Homomorphic Encryption
• Homomorphic Evaluation of the AES Circuit
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Efficient NIZK Arguments via Parallel Verification of Benes Networks
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• Square Span Programs with Applications to Succinct NIZK Arguments
• Fully Homomophic Encryption over the Integers Revisited
• An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Lattice-based FHE as secure as PKE
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Semi-homomorphic Encryption and Multiparty Computation
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• The random oracle methodology, revisited
• Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme
• Multi-key FHE from LWE, Revisited
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Magic Functions
• Multi-identity and Multi-key Leveled FHE from Learning with Errors
• Succinct NP Proofs from an Extractability Assumption
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• On Ideal Lattices and Learning with Errors over Rings
• Fully Homomorphic Encryption over the Integers
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Improved Delegation of Computation Using Fully Homomorphic Encryption
• From Secrecy to Soundness: Efficient Verification via Secure Computation
• Perfect Non-interactive Zero Knowledge for NP
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Foundations of Cryptography
• Why “Fiat-Shamir for Proofs” Lacks a Proof
• Succinct Non-interactive Arguments via Linear Interactive Proofs
• Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead
• Candidate Multilinear Maps from Ideal Lattices
• Batch Fully Homomorphic Encryption over the Integers
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Fully homomorphic encryption using ideal lattices
• Secure Computation on the Web: Computing without Simultaneous Interaction
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• Obfuscation of Probabilistic Circuits and Applications
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• Computational Integrity with a Public Random String from Quasi-Linear PCPs
• On the (im)possibility of obfuscating programs
• New Techniques for Noninteractive Zero-Knowledge
• Scale-Invariant Fully Homomorphic Encryption over the Integers
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Advances in Cryptology - CRYPTO 2003
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Efficient Fully Homomorphic Encryption from (Standard) LWE