Better bootstrapping in fully homomorphic encryption

DOI10.1007/978-3-642-30057-8_1MaRDI QIDQ2900205zbMATH OpenOpenAlexFDO

Authors Craig Gentry, Shai Halevi, N. P. Smart

Publication date 20 July 2012

Published in Public Key Cryptography – PKC 2012 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Practical bootstrapping in quasilinear time
• FHEW: bootstrapping homomorphic encryption in less than a second
• Faster Bootstrapping with Polynomial Error
• (Leveled) fully homomorphic encryption without bootstrapping
• Minimizing the number of bootstrappings in fully homomorphic encryption

Cited in

(49)

• Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise
• Homomorphic lower digits removal and improved FHE bootstrapping
• Bootstrapping for approximate homomorphic encryption
• Large FHE gates from tensored homomorphic accumulator
• FHE over the integers and modular arithmetic circuits
• Bootstrapping fully homomorphic encryption over the integers in less than one second
• Efficient homomorphic conversion between (ring) LWE ciphertexts
• Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
• Flattening NTRU for evaluation key free homomorphic encryption
• Improved bootstrapping for approximate homomorphic encryption
• Fully homomorphic SIMD operations
• Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
• Bootstrapping for helib
• Bootstrapping for BGV and BFV revisited
• Direct computation of branching programs and its applications to more efficient lattice-based cryptography
• Private database access with HE-over-ORAM architecture
• Onion ORAM: a constant bandwidth blowup oblivious RAM
• Minimizing the number of bootstrappings in fully homomorphic encryption
• Practical bootstrapping in quasilinear time
• Polly cracker, revisited
• Bootstrapping BGV ciphertexts with a wider choice of p and q
• FHEW with Efficient Multibit Bootstrapping
• Efficient integer encoding for homomorphic encryption via ring isomorphisms
• On key recovery attacks against existing somewhat homomorphic encryption schemes
• FHEW: bootstrapping homomorphic encryption in less than a second
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• Fully homomorphic encryption for point numbers
• Implementing Gentry's fully-homomorphic encryption scheme
• Blending FHE-NTRU keys -- the excalibur property
• Multikey fully homomorphic encryption and applications
• Towards constructing fully homomorphic encryption without ciphertext noise from group theory
• Ring packing and amortized FHEW bootstrapping
• Homomorphic encryption
• On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
• Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
• BLEACH: cleaning errors in discrete computations over CKKS
• Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
• Fast blind rotation for bootstrapping FHEs
• On the Hardness of Scheme-Switching Between SIMD FHE Schemes
• Bootstrapping bits with CKKS
• Fully homomorphic encryption for cyclotomic prime moduli
• Bootstrapping with RMFE for fully homomorphic encryption
• Pseudorandom correlation functions from Ring-LWR
• Vive Galois! I: Optimal SIMD packing and packed bootstrapping for FHE
• Revisiting the slot-to-coefficient transformation for BGV and BFV
• Circuit privacy for FHEW/TFHE-style fully homomorphic encryption in practice
• Designs for practical SHE schemes based on Ring-LWR
• Faster bootstrapping of FHE over the integers
• (Leveled) fully homomorphic encryption without bootstrapping

This page was built for publication: Better bootstrapping in fully homomorphic encryption

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