Efficient homomorphic comparison methods with optimal complexity
From MaRDI portal
Recommendations
- Numerical method for comparison on homomorphically encrypted numbers
- Improved secure integer comparison via homomorphic encryption
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- Homomorphic encryption and secure comparison
- Positional characteristics for efficient number comparison over the homomorphic encryption
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A fast convergent numerical method for matrix sign function with application in SDEs
- A note on margin-based loss functions in classification
- Algorithm AS 136: A K-Means Clustering Algorithm
- Bootstrapping for approximate homomorphic encryption
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Functions of Matrices
- Greedy function approximation: A gradient boosting machine.
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 233956 (Why is no real title available?)
- scientific article; zbMATH DE number 3066208 (Why is no real title available?)
- Improved bootstrapping for approximate homomorphic encryption
- Numerical method for comparison on homomorphically encrypted numbers
- Numerically stable improved Chebyshev-Halley type schemes for matrix sign function
- On the concrete hardness of learning with errors
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- On Wallis' formula
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- Polynomial Approximation of Piecewise Analytic Functions
- Polynomial approximation of piecewise analytic functions on a compact subset of the real line
- Stochastic gradient boosting.
- Support-vector networks
- The matrix sign function
- Uniform approximation of \(\text{sgn} (x)\) by polynomials and entire functions
Cited in
(19)- Numerical method for comparison on homomorphically encrypted numbers
- Positional characteristics for efficient number comparison over the homomorphic encryption
- Fast secure comparison for medium-sized integers and its application in binarized neural networks
- Homomorphic encryption and secure comparison
- 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
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- BioVite: efficient and compact privacy-preserving biometric verification via fully homomorphic encryption
- Homomorphic encryption for large integers from nested residue number systems
- General functional bootstrapping using CKKS
- Efficient privacy-preserving counting method with homomorphic encryption
- Tree-based lookup table on batched encrypted queries using homomorphic encryption
- Bootstrapping small integers with CKKS
- Homomorphic sign evaluation with a RNS representation of integers
- Improved universal thresholdizer from iterative Shamir secret sharing
- On the security and privacy of CKKS-based homomorphic evaluation protocols
- Improved secure integer comparison via homomorphic encryption
This page was built for publication: Efficient homomorphic comparison methods with optimal complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692383)
