Fast blind rotation for bootstrapping FHEs
From MaRDI portal
Publication:6190094
DOI10.1007/978-3-031-38551-3_1OpenAlexW4385654031MaRDI QIDQ6190094
Yiran Dai, Yi Deng, Dengguo Feng, Jiang Zhang, Binwu Xiang
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38551-3_1
Cites Work
- On the concrete hardness of learning with errors
- Homomorphic lower digits removal and improved FHE bootstrapping
- Bootstrapping for approximate homomorphic encryption
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- 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
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Homomorphic encryption for finite automata
- Improved bootstrapping for approximate homomorphic encryption
- TFHE: fast fully homomorphic encryption over the torus
- Revisiting the expected cost of solving uSVP and applications to LWE
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Homomorphic encryption for arithmetic of approximate numbers
- Bootstrapping for helib
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Better Bootstrapping in Fully Homomorphic Encryption
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Faster Fully Homomorphic Encryption
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- On Ideal Lattices and Learning with Errors over Rings
- Fully Homomorphic Encryption over the Integers
- Ring Packing and Amortized FHEW Bootstrapping
- Homomorphic Encryption Standard
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption over the Integers with Shorter Public Keys
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
- Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
- On lattices, learning with errors, random linear codes, and cryptography
- NTRU Fatigue: How Stretched is Overstretched?
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- FINAL: faster FHE instantiated with NTRU and LWE
This page was built for publication: Fast blind rotation for bootstrapping FHEs
