What is it about?
In the world of computer cryptography, new technologies emerge every day as researchers attempt to develop this vital area, especially those who enjoy challenges. Some of them aim to fix the computation speed and others aim to take care of data size. Others consider computational complexity by focusing on the number of operations or the scope of application. In this paper, we will present an asymmetric homomorphic encryption scheme that relies on converting base numbers to a given base in such a way that Leveled Fully Homomorphic Encryption (LFHE) is performed. This lightweight technique is easy to implement and applicable in many fields, especially those that require speed and safety force at the same time.
Featured Image
Photo by Markus Spiske on Unsplash
Why is it important?
Polynomial Reconstruction Problem, In this work, we intend to propose a leveled FHE scheme which hereinafter can be an FHE, where the increased noise must be controlled.
Perspectives
As future work, we intend to make a thorough analysis to be implemented in an IoT environment. we also aspire to expand this technique to be FHE.
Saci Medileh
Universite d'El Oued
Read the Original
This page is a summary of: A Homomorphic Digit Fragmentation Encryption Scheme Based on the Polynomial Reconstruction Problem, November 2020, ACM (Association for Computing Machinery),
DOI: 10.1145/3440749.3442592.
You can read the full text:
Contributors
The following have contributed to this page
