Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem

DOI10.1016/J.TCS.2018.11.014MaRDI QIDQ2632011zbMATH OpenOpenAlexWikidataFDO

Authors Khin Mi Mi Aung, Hyung Tae Lee, Benjamin Hong Meng Tan, Huaxiong Wang

Publication date 17 May 2019

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2018.11.014

zbMATH Keywords

fully homomorphic encryptionbootstrappingnon-binary plaintexts

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• (Batch) fully homomorphic encryption over integers for non-binary message spaces
• Fully homomorphic encryption over the integers
• FHE over the integers and modular arithmetic circuits
• Faster bootstrapping of FHE over the integers
• An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers

Cites work

• scientific article; zbMATH DE number 1852136 (Why is no real title available?)
• scientific article; zbMATH DE number 1852142 (Why is no real title available?)
• (Batch) fully homomorphic encryption over integers for non-binary message spaces
• Algorithms for the approximate common divisor problem
• Batch fully homomorphic encryption over the integers
• Better bootstrapping in fully homomorphic encryption
• Bootstrapping for HElib
• FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
• FHE over the integers and modular arithmetic circuits
• Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers
• Faster integer multiplication
• 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
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Scale-invariant fully homomorphic encryption over the integers

Cited in

(6)

• FHE over the integers and modular arithmetic circuits
• (Batch) fully homomorphic encryption over integers for non-binary message spaces
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Fully homomorphic encryption from the finite field isomorphism problem
• Practical multi-party quantum homomorphic encryption

Describes a project that uses

Uses Software

• HElib
• fhe

This page was built for publication: Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem

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