Efficient homomorphic comparison methods with optimal complexity
From MaRDI portal
Publication:2692383
DOI10.1007/978-3-030-64834-3_8OpenAlexW2990280959MaRDI QIDQ2692383
Duhyeong Kim, Jung Hee Cheon, Dongwoo Kim
Publication date: 21 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64834-3_8
Related Items (4)
SAMBA: A Generic Framework for Secure Federated Multi-Armed Bandits ⋮ BLEACH: cleaning errors in discrete computations over CKKS ⋮ Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping ⋮ Accelerating HE operations from key decomposition technique
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Greedy function approximation: A gradient boosting machine.
- Algorithm AS 136: A K-Means Clustering Algorithm
- Numerically stable improved Chebyshev-Halley type schemes for matrix sign function
- On the concrete hardness of learning with errors
- Polynomial approximation of piecewise analytic functions on a compact subset of the real line
- Bootstrapping for approximate homomorphic encryption
- A note on margin-based loss functions in classification
- Support-vector networks
- Numerical method for comparison on homomorphically encrypted numbers
- A fast convergent numerical method for matrix sign function with application in SDEs
- Improved bootstrapping for approximate homomorphic encryption
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Homomorphic encryption for arithmetic of approximate numbers
- Uniform approximation of \(\text{sgn} (x)\) by polynomials and entire functions
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- 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
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- On Wallis' formula
- Polynomial Approximation of Piecewise Analytic Functions
- The matrix sign function
- Functions of Matrices
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Stochastic gradient boosting.
This page was built for publication: Efficient homomorphic comparison methods with optimal complexity
