On CCA-Secure Somewhat Homomorphic Encryption

DOI10.1007/978-3-642-28496-0_4zbMath1292.94106OpenAlexW1574687437MaRDI QIDQ2889863

Alexander May, Frederik Vercauteren, Jake Loftus, Nigel P. Smart

Publication date: 8 June 2012

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28496-0_4

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (13)

Analysis of Gong et al.'s CCA2-secure homomorphic encryption ⋮ Chosen ciphertext secure keyed-homomorphic public-key cryptosystems ⋮ 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 ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle ⋮ Computing primitive idempotents in finite commutative rings and applications ⋮ Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption ⋮ Chosen-Ciphertext Secure Fully Homomorphic Encryption ⋮ FHE Circuit Privacy Almost for Free ⋮ Keyed-fully homomorphic encryption without indistinguishability obfuscation ⋮ A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ciphertext verification security of symmetric encryption schemes
• Formal proofs for the security of signcryption
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Semi-homomorphic Encryption and Multiparty Computation
• On the CCA1-Security of Elgamal and Damgård’s Elgamal
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• Fully Homomorphic Encryption over the Integers
• Fully homomorphic encryption using ideal lattices
• Errors Matter: Breaking RSA-Based PIN Encryption with Thirty Ciphertext Validity Queries
• Cryptography and Coding
• Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: On CCA-Secure Somewhat Homomorphic Encryption