FHEW with Efficient Multibit Bootstrapping

DOI10.1007/978-3-319-22174-8_7zbMath1370.94489OpenAlexW1199169209MaRDI QIDQ2946444

No author found.

Publication date: 17 September 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-22174-8_7

zbMATH Keywords

parallelizationbootstrappingLWEfully homomorphic encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Homomorphic lower digits removal and improved FHE bootstrapping ⋮ Batched fully homomorphic encryption from TFHE ⋮ Ring Packing and Amortized FHEW Bootstrapping

Cites Work

• Unnamed Item
• Practical Bootstrapping in Quasilinear Time
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Faster Bootstrapping with Polynomial Error
• Algorithms in HElib
• Fully Homomorphic Encryption with Polylog Overhead
• Better Bootstrapping in Fully Homomorphic Encryption
• Ring-LWE in Polynomial Rings
• Ring Switching in BGV-Style Homomorphic Encryption
• Homomorphic Evaluation of the AES Circuit
• FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Packed Ciphertexts in LWE-Based Homomorphic Encryption
• Fully homomorphic encryption using ideal lattices
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: FHEW with Efficient Multibit Bootstrapping