Batch Fully Homomorphic Encryption over the Integers

DOI10.1007/978-3-642-38348-9_20zbMath1306.94040OpenAlexW2153886246MaRDI QIDQ4924419

Jung Hee Cheon, Tancrède Lepoint, Moon Sung Lee, Jean-Sébastien Coron, Mehdi Tibouchi, Aaram Yun, Jin-Su Kim

Publication date: 31 May 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_20

zbMATH Keywords

Chinese remainder theoremfully homomorphic encryptionapproximate GCDbatch encryptionhomomorphic AES

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (39)

Towards faster polynomial-time lattice reduction ⋮ Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem ⋮ An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers ⋮ Cryptanalysis of the Co-ACD Assumption ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption ⋮ Bootstrapping for helib ⋮ Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression ⋮ On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes ⋮ Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes ⋮ Cryptanalysis of the CLT13 multilinear map ⋮ EvalRound algorithm in CKKS bootstrapping ⋮ Fast practical lattice reduction through iterated compression ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ Fully homomorphic encryption scheme and Fermat’s little theorem ⋮ Algorithms for the approximate common divisor problem ⋮ Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based ⋮ Cryptanalysis of a Homomorphic Encryption Scheme Over Integers ⋮ Fully Homomorphic Encryption for Point Numbers ⋮ Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic ⋮ Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression ⋮ Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES ⋮ CRT-based fully homomorphic encryption over the integers ⋮ The polynomial approximate common divisor problem and its application to the fully homomorphic encryption ⋮ Some security bounds for the key sizes of DGHV scheme ⋮ FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ New Results of Breaking the CLS Scheme from ACM-CCS 2014 ⋮ Algorithms for CRT-variant of approximate greatest common divisor problem ⋮ A Simple and Improved Algorithm for Integer Factorization with Implicit Hints ⋮ Encrypted data processing with homomorphic re-encryption ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes ⋮ Bootstrapping fully homomorphic encryption over the integers in less than one second ⋮ A new scale-invariant homomorphic encryption scheme ⋮ Keyed-fully homomorphic encryption without indistinguishability obfuscation ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems

This page was built for publication: Batch Fully Homomorphic Encryption over the Integers