Fully Homomorphic Encryption over the Integers

DOI10.1007/978-3-642-13190-5_2zbMath1279.94130WikidataQ28002636 ScholiaQ28002636MaRDI QIDQ3563828

Shai Halevi, Vinod Vaikuntanathan, Marten van Dijk, Craig Gentry

Publication date: 1 June 2010

Published in: Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13190-5_2

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Multikey Fully Homomorphic Encryption and Applications, Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures, Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES, (Leveled) Fully Homomorphic Encryption without Bootstrapping, Polly cracker, revisited, An efficient quasi-identifier index based approach for privacy preservation over incremental data sets on cloud, Approximate GCD of several univariate polynomials with small degree perturbations, Discrete logarithm based additively homomorphic encryption and secure data aggregation, LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme, Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES, Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service, Cryptanalysis of a homomorphic encryption scheme, Trusted computing with addition machines. I, A new scale-invariant homomorphic encryption scheme, Secret computation of purchase history data using somewhat homomorphic encryption, Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs, Practical private-key fully homomorphic encryption in rings, Homomorphic lower digits removal and improved FHE bootstrapping, Bootstrapping for approximate homomorphic encryption, An efficient quantum somewhat homomorphic symmetric searchable encryption, Privacy preserving distributed optimization using homomorphic encryption, A full RNS variant of approximate homomorphic encryption, Unsupervised Machine Learning on encrypted data, CRT-based fully homomorphic encryption over the integers, The polynomial approximate common divisor problem and its application to the fully homomorphic encryption, A new reversible date-hiding algorithm for encrypted images, Group homomorphic encryption: characterizations, impossibility results, and applications, A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE, Algorithms for CRT-variant of approximate greatest common divisor problem, New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries, Verifiable single-server private information retrieval from LWE with binary errors, High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function, Bootstrapping fully homomorphic encryption over the integers in less than one second, A polynomial-time algorithm for solving the hidden subset sum problem, Keyed-fully homomorphic encryption without indistinguishability obfuscation, An optimized GHV-type HE scheme: simpler, faster, and more versatile, Revisiting orthogonal lattice attacks on approximate common divisor problems, Towards faster polynomial-time lattice reduction, Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials, Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\), Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles, Compressible FHE with applications to PIR, Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction, On the smoothing parameter and last minimum of random orthogonal lattices, Flattening NTRU for evaluation key free homomorphic encryption, EPiC: efficient privacy-preserving counting for MapReduce, Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing, Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic, Quantum fully homomorphic encryption scheme for cloud privacy data based on quantum circuit, Some security bounds for the key sizes of DGHV scheme, Encrypted data processing with homomorphic re-encryption, TFHE: fast fully homomorphic encryption over the torus, Verification of quantum computation: an overview of existing approaches, Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation, On the greatest common divisor of shifted sets, Computing on authenticated data, On the deductive security of queries to confidential databases in cloud computing systems, Some homomorphic cryptosystems based on nonassociative structures, Secure cloud computing based on threshold homomorphic encryption, Cryptanalysis of the CLT13 multilinear map, Fully homomorphic SIMD operations, Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem, PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries, Bootstrapping for helib, Privacy-preserving distributed deep learning based on secret sharing, Cryptographic algorithms for privacy-preserving online applications, A multi-valued quantum fully homomorphic encryption scheme, Maliciously circuit-private multi-key FHE and MPC based on LWE, CCA-Secure Keyed-Fully Homomorphic Encryption, Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption, Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem, Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits, Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits, Accelerating Homomorphic Computations on Rational Numbers, A novel fully homomorphic encryption scheme bsed on LWE, FHE Circuit Privacy Almost for Free, Quantum Homomorphic Encryption for Polynomial-Sized Circuits, Breaking the Circuit Size Barrier for Secure Computation Under DDH, On CCA-Secure Somewhat Homomorphic Encryption, Partial Key Exposure Attack on CRT-RSA, Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem, Depth Optimized Efficient Homomorphic Sorting, Private Computation on Encrypted Genomic Data, On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes, Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes, Algorithms for the approximate common divisor problem, Cryptanalysis of a Homomorphic Encryption Scheme Over Integers, Secure Outsourced Computation, Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design, Benaloh’s Dense Probabilistic Encryption Revisited, Efficient Secure Two-Party Exponentiation, The Geometry of Lattice Cryptography, Generalized Learning Problems and Applications to Non-commutative Cryptography, On Constructing Homomorphic Encryption Schemes from Coding Theory, Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption, Approximate common divisor problem and lattice sieving, Fully Homomorphic Encryption with Auxiliary Inputs, Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity, New Multilinear Maps Over the Integers, Cryptanalysis of the Co-ACD Assumption, Unnamed Item, Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications, Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory, The Complexity of Public-Key Cryptography, Homomorphic Encryption, New Ideas to Build Noise-Free Homomorphic Cryptosystems, A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties, Verifiable Range Query Processing for Cloud Computing, An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers, HDDA: DataSifter: statistical obfuscation of electronic health records and other sensitive datasets, Foundations of Homomorphic Secret Sharing, Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions, Circuit-Private Multi-key FHE, FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime, Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges, On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols, Simultaneous diagonalization of incomplete matrices and applications, Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes, Multi-key Homomorphic Proxy Re-Encryption, Verifiable Decryption for Fully Homomorphic Encryption, EvalRound algorithm in CKKS bootstrapping, FINAL: faster FHE instantiated with NTRU and LWE, $$\mathsf {HIKE}$$ : Walking the Privacy Trail