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

DOI10.1016/J.TCS.2018.11.014zbMATH Open1439.94019OpenAlexW2901721742WikidataQ123129422 ScholiaQ123129422MaRDI QIDQ2632011FDOQ2632011

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

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

zbMATH Keywords

fully homomorphic encryptionbootstrappingnon-binary plaintexts

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Better Bootstrapping in Fully Homomorphic Encryption
• Bootstrapping for HElib
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys
• Faster integer multiplication
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Batch Fully Homomorphic Encryption over the Integers
• Fully Homomophic Encryption over the Integers Revisited
• Scale-Invariant Fully Homomorphic Encryption over the Integers
• (Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces
• FHE over the integers and modular arithmetic circuits
• Algorithms for the approximate common divisor problem
• FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime

Cited In (4)

• Fully homomorphic encryption from the finite field isomorphism problem
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Practical multi-party quantum homomorphic encryption

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)