Fully homomorphic encryption for point numbers

DOI10.1007/978-3-319-54705-3_16MaRDI QIDQ2980860zbMATH OpenOpenAlexFDO

Authors Seiko Arita, Shota Nakasato

Publication date 5 May 2017

Published in Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-54705-3_16

zbMATH Keywords

fixed/floating point numberfully homomorphic encryptionFV schemegreater-than bit

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption with relatively small key and ciphertext sizes
• Accelerating homomorphic computations on rational numbers
• Faster fully homomorphic encryption

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A comparison of the homomorphic encryption schemes FV and YASHE
• A Private Stable Matching Algorithm
• Batch fully homomorphic encryption over the integers
• Better bootstrapping in fully homomorphic encryption
• Fixed-point arithmetic in SHE schemes
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomorphic SIMD operations
• Improved security for a ring-based fully homomorphic encryption scheme
• ML confidential: machine learning on encrypted data
• On ideal lattices and learning with errors over rings
• Practical bootstrapping in quasilinear time
• Private computation on encrypted genomic data

Cited in

(4)

• Fixed-point arithmetic in SHE schemes
• Accelerating homomorphic computations on rational numbers
• BLEACH: cleaning errors in discrete computations over CKKS
• PIE: p-adic encoding for high-precision arithmetic in homomorphic encryption

This page was built for publication: Fully homomorphic encryption for point numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980860)