Cryptanalysis of a Homomorphic Encryption Scheme Over Integers

DOI10.1007/978-3-319-54705-3_15zbMath1379.94031OpenAlexW2592689211MaRDI QIDQ2980858

Jiayang Liu, Xiaoyun Wang, Jingguo Bi

Publication date: 5 May 2017

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-54705-3_15

zbMATH Keywords

latticecryptanalysisLLL algorithmhomomorphic encryptionmulti-ciphertexts attack

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Uses Software

• NTL
• fpLLL
• fhe

Cites Work

• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Faster Bootstrapping with Polynomial Error
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
• Fully Homomophic Encryption over the Integers Revisited
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• Fully Homomorphic Encryption over the Integers
• An LLL Algorithm with Quadratic Complexity
• Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
• Batch Fully Homomorphic Encryption over the Integers
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• Scale-Invariant Fully Homomorphic Encryption over the Integers
• Efficient Fully Homomorphic Encryption from (Standard) LWE

This page was built for publication: Cryptanalysis of a Homomorphic Encryption Scheme Over Integers