Fully Homomorphic Encryption with Polylog Overhead

From MaRDI portal
Revision as of 19:33, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2894424

DOI10.1007/978-3-642-29011-4_28zbMath1297.94071OpenAlexW1755636270MaRDI QIDQ2894424

Shai Halevi, Craig Gentry, Nigel P. Smart

Publication date: 29 June 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_28




Related Items (42)

On the deductive security of queries to confidential databases in cloud computing systemsNew Ideas to Build Noise-Free Homomorphic CryptosystemsHomomorphic AES evaluation using the modified LTV schemeBlending FHE-NTRU Keys – The Excalibur PropertyProvably Weak Instances of Ring-LWEHomomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more dataBootstrapping for approximate homomorphic encryptionAsymptotically quasi-optimal cryptographyField instruction multiple dataBootstrapping for helibEfficient Computations over Encrypted Data BlocksDepth Optimized Efficient Homomorphic SortingFHEW with Efficient Multibit BootstrappingOn Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption SchemesOptimisations and tradeoffs for HElibFlattening NTRU for evaluation key free homomorphic encryptionEfficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption SchemesHomomorphic encryption: a mathematical surveyMultikey Fully Homomorphic Encryption and ApplicationsRevisiting homomorphic encryption schemes for finite fieldsEfficient circuits for permuting and mapping packed values across leveled homomorphic ciphertextsMulti-party homomorphic secret sharing and sublinear MPC from sparse LPNAttacks on the Search RLWE Problem with Small ErrorsBootstrapping for BGV and BFV revisitedDirect computation of branching programs and its applications to more efficient lattice-based cryptographyFully homomorphic SIMD operationsRing Packing and Amortized FHEW BootstrappingLLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE schemeVerifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VESCryptanalysis of a homomorphic encryption schemeCRT-based fully homomorphic encryption over the integersPacked Ciphertexts in LWE-Based Homomorphic EncryptionVerifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VESSome security bounds for the key sizes of DGHV schemeSomewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges(Leveled) Fully Homomorphic Encryption without BootstrappingPrivate Database Access with HE-over-ORAM ArchitectureOn the deductive security of queries to databases with multi-bit recordsMinimizing the Number of Bootstrappings in Fully Homomorphic EncryptionBootstrapping fully homomorphic encryption over the integers in less than one secondHomomorphic EncryptionLattice-Based SNARGs and Their Application to More Efficient Obfuscation







This page was built for publication: Fully Homomorphic Encryption with Polylog Overhead