Accelerating homomorphic computations on rational numbers
From MaRDI portal
Publication:2822686
DOI10.1007/978-3-319-39555-5_22zbMATH Open1346.68087OpenAlexW2492687001MaRDI QIDQ2822686FDOQ2822686
Authors: Angela Jäschke, Frederik Armknecht 
Publication date: 4 October 2016
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-39555-5_22
Recommendations
- (Finite) field work: choosing the best encoding of numbers for FHE computation
- Encoding of rational numbers and their homomorphic computations for FHE-based applications
- Accelerating homomorphic evaluation on reconfigurable hardware
- Fully homomorphic encryption for point numbers
- A full RNS variant of FV like somewhat homomorphic encryption schemes
Learning and adaptive systems in artificial intelligence (68T05) Data encryption (aspects in computer science) (68P25)
Cites Work
- Homomorphic evaluation of the AES circuit
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- (Leveled) fully homomorphic encryption without bootstrapping
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Scale-Invariant Fully Homomorphic Encryption over the Integers
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Fixed-point arithmetic in SHE schemes
- ML confidential: machine learning on encrypted data
- Group homomorphic encryption: characterizations, impossibility results, and applications
Cited In (6)
- Unsupervised Machine Learning on encrypted data
- Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications
- Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
- Accelerating homomorphic evaluation on reconfigurable hardware
- PIE: \(p\)-adic encoding for high-precision arithmetic in homomorphic encryption
- (Finite) field work: choosing the best encoding of numbers for FHE computation
Uses Software
This page was built for publication: Accelerating homomorphic computations on rational numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822686)
