Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications
From MaRDI portal
Publication:4963266
DOI10.1142/S0129054118500193zbMath1398.68130OpenAlexW2895754053WikidataQ123263123 ScholiaQ123263123MaRDI QIDQ4963266
Publication date: 1 November 2018
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054118500193
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- Linear fractional transformations of continued fractions with bounded partial quotients
- Faster homomorphic linear transformations in HElib
- Accelerating Homomorphic Computations on Rational Numbers
- (Leveled) fully homomorphic encryption without bootstrapping
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Fully Homomorphic Encryption over the Integers
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- ML Confidential: Machine Learning on Encrypted Data
- Continued fractions with bounded partial quotients
- 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
This page was built for publication: Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications