Chosen-Ciphertext Secure Fully Homomorphic Encryption

DOI10.1007/978-3-662-54388-7_8zbMath1400.94131OpenAlexW2590349999MaRDI QIDQ5738757

Silas Richelson, Ran Canetti, Vinod Vaikuntanathan, Srinivasan Raghuraman

Publication date: 13 June 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-662-54388-7_8

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (13)

The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Public-Key Puncturable Encryption: Modular and Compact Constructions ⋮ Fine-grained forward secrecy: allow-list/deny-list encryption and applications ⋮ Chosen ciphertext secure keyed-homomorphic public-key cryptosystems ⋮ Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ $$\mathsf {HIKE}$$ : Walking the Privacy Trail ⋮ Incremental symmetric puncturable encryption with support for unbounded number of punctures ⋮ Forward secret encrypted RAM: lower bounds and applications ⋮ Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange ⋮ 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
• Probabilistic encryption
• The hunting of the SNARK
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• Targeted malleability
• Spooky Encryption and Its Applications
• On CCA-Secure Somewhat Homomorphic Encryption
• On the CCA-1 Security of Somewhat Homomorphic Encryption over the Integers
• Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes
• Targeted Homomorphic Attribute-Based Encryption
• Multi-identity and Multi-key Leveled FHE from Learning with Errors
• Trapdoors for hard lattices and new cryptographic constructions
• Fully homomorphic encryption using ideal lattices
• Obfuscation of Probabilistic Circuits and Applications
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Advances in Cryptology - CRYPTO 2003
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Recursive composition and bootstrapping for SNARKS and proof-carrying data
• Two Round Multiparty Computation via Multi-key FHE

This page was built for publication: Chosen-Ciphertext Secure Fully Homomorphic Encryption