Minimizing the number of bootstrappings in fully homomorphic encryption
From MaRDI portal
Publication:2807191
DOI10.1007/978-3-319-31301-6_2zbMATH Open1339.94057OpenAlexW2463885712MaRDI QIDQ2807191FDOQ2807191
Bastien Vialla, Marie Paindavoine
Publication date: 19 May 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01181319/file/SAC2015.pdf
Recommendations
Cites Work
- Faster homomorphic linear transformations in HElib
- Fully Homomorphic Encryption with Polylog Overhead
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption over the Integers
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption over the Integers with Shorter Public Keys
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Theory of Cryptography
- Minimum \(k\)-path vertex cover
- (Leveled) fully homomorphic encryption without bootstrapping
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Fully homomorphic SIMD operations
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- DAG reversal is NP-complete
Cited In (5)
- A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets
- Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges
- Improved bootstrapping for approximate homomorphic encryption
Uses Software
This page was built for publication: Minimizing the number of bootstrappings in fully homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807191)
