Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
From MaRDI portal
Publication:6132408
DOI10.1007/978-3-031-22966-4_5zbMATH Open1519.94163OpenAlexW3204113425MaRDI QIDQ6132408FDOQ6132408
Authors: Zeyu Liu, Daniele Micciancio, Yuriy Polyakov 
Publication date: 16 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22966-4_5
Recommendations
- Efficient homomorphic comparison methods with optimal complexity
- Numerical method for comparison on homomorphically encrypted numbers
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Parameter optimization and larger precision for (T)FHE
- Improved secure integer comparison via homomorphic encryption
Cites Work
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- (Leveled) fully homomorphic encryption without bootstrapping
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- An improved RNS variant of the BFV homomorphic encryption scheme
- Homomorphic encryption for arithmetic of approximate numbers
- Revisiting homomorphic encryption schemes for finite fields
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- FINAL: faster FHE instantiated with NTRU and LWE
- Optimal Convergence Rates for the Orthogonal Greedy Algorithm
- Neural field equations with neuron‐dependent Heaviside‐type activation function and spatial‐dependent delay
- Efficient homomorphic comparison methods with optimal complexity
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
Cited In (10)
- Full domain functional bootstrapping with least significant bit encoding
- Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain
- Discretization error reduction for high precision torus fully homomorphic encryption
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
- Parameter optimization and larger precision for (T)FHE
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- FHEW with Efficient Multibit Bootstrapping
- Efficient homomorphic comparison methods with optimal complexity
This page was built for publication: Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132408)
