Faster fully homomorphic encryption

DOI10.1007/978-3-642-17373-8_22MaRDI QIDQ3058667zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Damien Stehlé, Ron Steinfeld

Publication date 7 December 2010

Published in Advances in Cryptology - ASIACRYPT 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17373-8_22

zbMATH Keywords

fully homomorphic encryptionideal latticesSSSP

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption over the integers
• Implementing Gentry's fully-homomorphic encryption scheme
• (Leveled) fully homomorphic encryption without bootstrapping
• (Leveled) fully homomorphic encryption without bootstrapping

Cited in

(43)

• New ideas to build noise-free homomorphic cryptosystems
• An improvement of key generation algorithm for Gentry's homomorphic encryption scheme from ideal lattices
• Implementing Gentry's fully-homomorphic encryption scheme
• Fully homomorphic encryption with polylog overhead
• Faster Luby-Rackoff ciphers
• Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
• FHE circuit privacy almost for free
• Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
• Experiments with the plaintext space in Gentry's somewhat homomorphic scheme
• The geometry of lattice cryptography
• A full RNS variant of FV like somewhat homomorphic encryption schemes
• Enhancing data parallelism of fully homomorphic encryption
• A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
• CRT-based fully homomorphic encryption over the integers
• Efficient integer encoding for homomorphic encryption via ring isomorphisms
• Fully homomorphic encryption for point numbers
• Improved efficiency of a linearly homomorphic cryptosystem
• Improved key generation algorithm for Gentry's fully homomorphic encryption scheme
• Subring homomorphic encryption
• Faster homomorphic encryption over GPGPUs via hierarchical DGT
• LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
• Fully homomorphic encryption scheme and Fermat’s little theorem
• CCA-secure keyed-fully homomorphic encryption
• Fully homomorphic encryption with relatively small key and ciphertext sizes
• Accelerating HE operations from key decomposition technique
• Fast blind rotation for bootstrapping FHEs
• Anonymity of NIST PQC round 3 KEMs
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
• Progress in Cryptology - INDOCRYPT 2004
• On key recovery attacks against existing somewhat homomorphic encryption schemes
• One-way homomorphic encryption: a composite group approach
• Leveled homomorphic encryption over composite groups
• Improved security for a ring-based fully homomorphic encryption scheme
• Toward basing fully homomorphic encryption on worst-case hardness
• (Leveled) fully homomorphic encryption without bootstrapping
• Fully homomorphic encryption from approximate ideal lattices
• Fast Data Encipherment Algorithm FEAL
• How to construct public timeline for RSA-formed time-lock cryptography
• Applied homomorphic cryptography: examples
• Fully homomorphic SIMD operations
• A faster cryptographer's Conspiracy Santa
• On constructing homomorphic encryption schemes from coding theory
• Practical randomized lattice gadget decomposition with application to FHE

This page was built for publication: Faster fully homomorphic encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058667)