Accelerating homomorphic computations on rational numbers

DOI10.1007/978-3-319-39555-5_22MaRDI QIDQ2822686zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

fully homomorphic encryptionimplementationencodingconfidential machine learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data encryption (aspects in computer science) (68P25)

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

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fixed-point arithmetic in SHE schemes
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption with relatively small key and ciphertext sizes
• Group homomorphic encryption: characterizations, impossibility results, and applications
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Homomorphic evaluation of the AES circuit
• ML confidential: machine learning on encrypted data
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Scale-invariant fully homomorphic encryption over the integers

Cited in

(8)

• Encoding of rational numbers and their homomorphic computations for FHE-based applications
• Unsupervised Machine Learning on encrypted data
• Accelerating homomorphic evaluation on reconfigurable hardware
• PIE: \(p\)-adic encoding for high-precision arithmetic in homomorphic encryption
• Fully homomorphic encryption for point numbers
• Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
• (Finite) field work: choosing the best encoding of numbers for FHE computation
• Fixed-point arithmetic in SHE schemes

Describes a project that uses

Uses Software

• HElib
• TASTY
• FHEW
• fhe
• GitHub
• TinyGarble

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)