On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes

DOI10.1007/978-3-319-16295-9_13zbMath1370.94495OpenAlexW2159015104MaRDI QIDQ2946478

Qiang Tang, Massimo Chenal

Publication date: 17 September 2015

Published in: Progress in Cryptology - LATINCRYPT 2014 (Search for Journal in Brave)

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

zbMATH Keywords

key recovery attacksomewhat homomorphic encryptionIND-CCA1 security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

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 ⋮ Preventing Adaptive Key Recovery Attacks on the GSW Levelled Homomorphic Encryption Scheme ⋮ Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression ⋮ A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem

Cites Work

• Unnamed Item
• (Leveled) fully homomorphic encryption without bootstrapping
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• 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
• Fully Homomorphic Encryption with Polylog Overhead
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Better Bootstrapping in Fully Homomorphic Encryption
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Faster Fully Homomorphic Encryption
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• Fully Homomorphic Encryption over the Integers
• Computing arbitrary functions of encrypted data
• 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
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits

This page was built for publication: On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes