Fully Homomorphic Encryption over the Integers
From MaRDI portal
Publication:3563828
DOI10.1007/978-3-642-13190-5_2zbMath1279.94130OpenAlexW2156030242WikidataQ28002636 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
Related Items (only showing first 100 items - show all)
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 ⋮ 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 ⋮ Homomorphic encryption: a mathematical survey ⋮ EvalRound algorithm in CKKS bootstrapping ⋮ FINAL: faster FHE instantiated with NTRU and LWE ⋮ Fast practical lattice reduction through iterated compression ⋮ Computing primitive idempotents in finite commutative rings and applications ⋮ $$\mathsf {HIKE}$$ : Walking the Privacy Trail ⋮ Fully homomorphic encryption scheme and Fermat’s little theorem ⋮ Fast blind rotation for bootstrapping FHEs ⋮ Toward practical privacy-preserving linear regression ⋮ Foundations of Homomorphic Secret Sharing ⋮ 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 ⋮ 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 ⋮ Simultaneous diagonalization of incomplete matrices and applications ⋮ The Complexity of Public-Key Cryptography ⋮ Homomorphic Encryption ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions ⋮ On the deductive security of queries to confidential databases in cloud computing systems ⋮ On CCA-Secure Somewhat Homomorphic Encryption ⋮ Towards faster polynomial-time lattice reduction ⋮ Polly cracker, revisited ⋮ Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem ⋮ 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 ⋮ Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials ⋮ Practical private-key fully homomorphic encryption in rings ⋮ Homomorphic lower digits removal and improved FHE bootstrapping ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption ⋮ An efficient quasi-identifier index based approach for privacy preservation over incremental data sets on cloud ⋮ Some homomorphic cryptosystems based on nonassociative structures ⋮ PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ Bootstrapping for helib ⋮ Secure cloud computing based on threshold homomorphic encryption ⋮ Privacy-preserving distributed deep learning based on secret sharing ⋮ 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 ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ Partial Key Exposure Attack on CRT-RSA ⋮ On the smoothing parameter and last minimum of random orthogonal lattices ⋮ 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 ⋮ Secret computation of purchase history data using somewhat homomorphic encryption ⋮ Flattening NTRU for evaluation key free homomorphic encryption ⋮ Cryptanalysis of the CLT13 multilinear map ⋮ Approximate GCD of several univariate polynomials with small degree perturbations ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs ⋮ A multi-valued quantum fully homomorphic encryption scheme ⋮ Group homomorphic encryption: characterizations, impossibility results, and applications ⋮ Discrete logarithm based additively homomorphic encryption and secure data aggregation ⋮ An efficient quantum somewhat homomorphic symmetric searchable encryption ⋮ Algorithms for the approximate common divisor problem ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ Fully homomorphic SIMD operations ⋮ Cryptanalysis of a Homomorphic Encryption Scheme Over Integers ⋮ Privacy preserving distributed optimization using homomorphic encryption ⋮ EPiC: efficient privacy-preserving counting for MapReduce ⋮ A full RNS variant of approximate homomorphic encryption ⋮ Unsupervised Machine Learning on encrypted data ⋮ 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 ⋮ 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 ⋮ Quantum fully homomorphic encryption scheme for cloud privacy data based on quantum circuit ⋮ Secure Outsourced Computation ⋮ Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design ⋮ Benaloh’s Dense Probabilistic Encryption Revisited ⋮ 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 ⋮ CRT-based fully homomorphic encryption over the integers ⋮ The polynomial approximate common divisor problem and its application to the fully homomorphic encryption ⋮ 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 ⋮ A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE ⋮ Some security bounds for the key sizes of DGHV scheme ⋮ (Leveled) Fully Homomorphic Encryption without Bootstrapping ⋮ Algorithms for CRT-variant of approximate greatest common divisor problem ⋮ CCA-Secure Keyed-Fully Homomorphic Encryption ⋮ A new reversible date-hiding algorithm for encrypted images
This page was built for publication: Fully Homomorphic Encryption over the Integers