The polynomial approximate common divisor problem and its application to the fully homomorphic encryption

DOI10.1016/j.ins.2015.07.021zbMath1387.94075OpenAlexW1151877271WikidataQ120901094 ScholiaQ120901094MaRDI QIDQ1750401

Hyunsook Hong, Hansol Ryu, Jung Hee Cheon, Moon Sung Lee

Publication date: 22 May 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.07.021

zbMATH Keywords

Chinese remainder theoremfully homomorphic encryptionlarge integer arithmeticpolynomial approximate GCD problemSIMD operation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ Homomorphic encryption systems statement: trends and challenges

Uses Software

• fhe

Cites Work

• Unnamed Item
• Fast projection methods for minimal design problems in linear system theory
• (Leveled) fully homomorphic encryption without bootstrapping
• Modern Computer Algebra
• Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
• Finding a Small Root of a Univariate Modular Equation
• 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 Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Approximate common divisors via lattices
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
• Fully Homomorphic Encryption over the Integers
• Lattice-based Cryptography
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• When Homomorphism Becomes a Liability
• Batch Fully Homomorphic Encryption over the Integers
• A Comparison of the Homomorphic Encryption Schemes FV and YASHE
• 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
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Classical hardness of learning with errors
• Algorithmic Number Theory
• On lattices, learning with errors, random linear codes, and cryptography