Bootstrapping for HElib

DOI10.1007/978-3-662-46800-5_25MaRDI QIDQ2948347zbMATH OpenOpenAlexFDO

Authors Shai Halevi, Victor Shoup

Publication date 30 September 2015

Published in Advances in Cryptology -- EUROCRYPT 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46800-5_25

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Bootstrapping for helib
• Bootstrap for nonstandard cases
• scientific article; zbMATH DE number 4060517
• scientific article; zbMATH DE number 4007468
• On some representations of the bootstrap
• Bootstrap likelihoods
• On efficient bootstrap simulation
• Bootstrapping for generalized l-statistics

Cited in

(38)

• Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM
• FHE circuit privacy almost for free
• Ring packing and amortized FHEW bootstrapping
• Efficient homomorphic conversion between (ring) LWE ciphertexts
• Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
• Bootstrapping for approximate homomorphic encryption
• Onion ORAM: a constant bandwidth blowup oblivious RAM
• Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes
• Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
• Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding
• On the security of homomorphic encryption on approximate numbers
• Lattice-based fully dynamic multi-key FHE with short ciphertexts
• Breaking the circuit size barrier for secure computation under DDH
• Practical bootstrapping in quasilinear time
• Batched fully dynamic multi-key FHE from FHEW-like cryptosystems
• Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
• Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
• Verifiable Decryption for Fully Homomorphic Encryption
• Homomorphic lower digits removal and improved FHE bootstrapping
• Hybrid dual and meet-LWE attack
• Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
• Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
• Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
• BLEACH: cleaning errors in discrete computations over CKKS
• \textsf{SMAUG}: pushing lattice-based key encapsulation mechanisms to the limits
• Bootstrapping for helib
• Field instruction multiple data
• Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
• Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
• Homomorphic encryption
• Accelerating BGV bootstrapping for large \(p\) using null polynomials over \(\mathbb{Z}_{p^e} \)
• (Leveled) fully homomorphic encryption without bootstrapping
• Algorithms in HElib
• Bootstrapping for BGV and BFV revisited
• On the Hardness of Scheme-Switching Between SIMD FHE Schemes
• Faster homomorphic linear transformations in HElib
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes

Describes a project that uses

Uses Software

• HElib

This page was built for publication: Bootstrapping for HElib

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