Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes

DOI10.1007/978-3-319-17470-9_17zbMath1359.94586OpenAlexW885112566WikidataQ61914007 ScholiaQ61914007MaRDI QIDQ2947538

Steven D. Galbraith, Eduardo Morais, Ricardo Dahab

Publication date: 24 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17470-9_17

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Preventing Adaptive Key Recovery Attacks on the GSW Levelled Homomorphic Encryption Scheme ⋮ D-NTRU: more efficient and average-case IND-CPA secure NTRU variant ⋮ Chosen-Ciphertext Secure Fully Homomorphic Encryption ⋮ A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem

Cites Work

• Unnamed Item
• Homomorphic AES evaluation using the modified LTV scheme
• (Leveled) fully homomorphic encryption without bootstrapping
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
• On CCA-Secure Somewhat Homomorphic Encryption
• On the CCA-1 Security of Somewhat Homomorphic Encryption over the Integers
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Homomorphic Evaluation of the AES Circuit
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Private Computation on Encrypted Genomic Data
• On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes
• Lattice-based FHE as secure as PKE
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Faster Fully Homomorphic Encryption
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• Fully Homomorphic Encryption over the Integers
• Batch Fully Homomorphic Encryption over the Integers
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys
• On Ideal Lattices and Learning with Errors over Rings
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Efficient Fully Homomorphic Encryption from (Standard) LWE

This page was built for publication: Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes