An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers

DOI10.1007/978-3-319-72359-4_52MaRDI QIDQ5056042zbMATH OpenOpenAlexFDO

Authors Xiaoqiang Sun, Peng Zhang, Jianping Yu, Weixin Xie

Publication date 9 December 2022

Published in Information Security Practice and Experience (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-72359-4_52

zbMATH Keywords

approximate GCDhomomorphic multiplicationleveled fully homomorphic encryptionmultiplication key

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Scale-invariant fully homomorphic encryption over the integers
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption over the integers with shorter public keys
• (Leveled) fully homomorphic encryption without bootstrapping
• CRT-based fully homomorphic encryption over the integers

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A method for obtaining digital signatures and public-key cryptosystems
• A Pseudorandom Generator from any One-way Function
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Batch fully homomorphic encryption over the integers
• CRT-based fully homomorphic encryption over the integers
• Faster Bootstrapping with Polynomial Error
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fully homomophic encryption over the integers revisited
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption over the integers with shorter public keys
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Scale-invariant fully homomorphic encryption over the integers
• Theory of Cryptography

Cited in

(5)

• Accelerating integer based fully homomorphic encryption using frequency domain multiplication
• Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
• Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme
• Scale-invariant fully homomorphic encryption over the integers
• A new scale-invariant homomorphic encryption scheme

Describes a project that uses

Uses Software

• fhe
• FHEW

This page was built for publication: An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers

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