A homomorphic digit fragmentation encryption scheme based on the polynomial reconstruction problem

Mostefa Kara; Abdelkader Laouid; Reinhardt Euler; Mohammed Amine Yagoub; Ahcene Bounceur; Mohammad Hammoudeh; Saci Medileh

doi:10.1145/3440749.3442592

A homomorphic digit fragmentation encryption scheme based on the polynomial reconstruction problem

Mostefa Kara
, Abdelkader Laouid
, Reinhardt Euler
, Mohammed Amine Yagoub
, Ahcene Bounceur
, Mohammad Hammoudeh
, Saci Medileh

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

Abstract

In the fast moving field of computer cryptography, researchers are actively working on addressing various emerging challenges to keep tomorrow's systems secure. Many efforts are focused on addressing the computation speed and the massive data size requirements of today's systems. Significant research efforts are targeting the computational complexity by focusing on the number of cryptographic operations or the scope of application. In this paper, we 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 high speed and safety.

Original language	English
Title of host publication	Proceedings of the 4th International Conference on Future Networks and Distributed Systems, ICFNDS 2020
Publisher	Association for Computing Machinery
ISBN (Electronic)	9781450388863
DOIs	https://doi.org/10.1145/3440749.3442592
State	Published - 26 Nov 2020
Externally published	Yes

Publication series

Name	ACM International Conference Proceeding Series

Bibliographical note

Publisher Copyright:
© 2020 ACM.

Keywords

Cryptography
Efficient Computation.
Homomorphic Encryption

ASJC Scopus subject areas

Software
Human-Computer Interaction
Computer Vision and Pattern Recognition
Computer Networks and Communications

Access to Document

10.1145/3440749.3442592

Cite this

Kara, M., Laouid, A., Euler, R., Yagoub, M. A., Bounceur, A., Hammoudeh, M., & Medileh, S. (2020). A homomorphic digit fragmentation encryption scheme based on the polynomial reconstruction problem. In Proceedings of the 4th International Conference on Future Networks and Distributed Systems, ICFNDS 2020 Article 3442592 (ACM International Conference Proceeding Series). Association for Computing Machinery. https://doi.org/10.1145/3440749.3442592

@inproceedings{bae2e52efa4346d8ba24aa5a3372559a,

title = "A homomorphic digit fragmentation encryption scheme based on the polynomial reconstruction problem",

abstract = "In the fast moving field of computer cryptography, researchers are actively working on addressing various emerging challenges to keep tomorrow's systems secure. Many efforts are focused on addressing the computation speed and the massive data size requirements of today's systems. Significant research efforts are targeting the computational complexity by focusing on the number of cryptographic operations or the scope of application. In this paper, we 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 high speed and safety.",

keywords = "Cryptography, Efficient Computation., Homomorphic Encryption",

author = "Mostefa Kara and Abdelkader Laouid and Reinhardt Euler and Yagoub, \{Mohammed Amine\} and Ahcene Bounceur and Mohammad Hammoudeh and Saci Medileh",

note = "Publisher Copyright: {\textcopyright} 2020 ACM.",

year = "2020",

month = nov,

day = "26",

doi = "10.1145/3440749.3442592",

language = "English",

series = "ACM International Conference Proceeding Series",

publisher = "Association for Computing Machinery",

booktitle = "Proceedings of the 4th International Conference on Future Networks and Distributed Systems, ICFNDS 2020",

}

Kara, M, Laouid, A, Euler, R, Yagoub, MA, Bounceur, A, Hammoudeh, M & Medileh, S 2020, A homomorphic digit fragmentation encryption scheme based on the polynomial reconstruction problem. in Proceedings of the 4th International Conference on Future Networks and Distributed Systems, ICFNDS 2020., 3442592, ACM International Conference Proceeding Series, Association for Computing Machinery. https://doi.org/10.1145/3440749.3442592

A homomorphic digit fragmentation encryption scheme based on the polynomial reconstruction problem. / Kara, Mostefa; Laouid, Abdelkader; Euler, Reinhardt et al.
Proceedings of the 4th International Conference on Future Networks and Distributed Systems, ICFNDS 2020. Association for Computing Machinery, 2020. 3442592 (ACM International Conference Proceeding Series).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A homomorphic digit fragmentation encryption scheme based on the polynomial reconstruction problem

AU - Kara, Mostefa

AU - Laouid, Abdelkader

AU - Euler, Reinhardt

AU - Yagoub, Mohammed Amine

AU - Bounceur, Ahcene

AU - Hammoudeh, Mohammad

AU - Medileh, Saci

PY - 2020/11/26

Y1 - 2020/11/26

N2 - In the fast moving field of computer cryptography, researchers are actively working on addressing various emerging challenges to keep tomorrow's systems secure. Many efforts are focused on addressing the computation speed and the massive data size requirements of today's systems. Significant research efforts are targeting the computational complexity by focusing on the number of cryptographic operations or the scope of application. In this paper, we 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 high speed and safety.

AB - In the fast moving field of computer cryptography, researchers are actively working on addressing various emerging challenges to keep tomorrow's systems secure. Many efforts are focused on addressing the computation speed and the massive data size requirements of today's systems. Significant research efforts are targeting the computational complexity by focusing on the number of cryptographic operations or the scope of application. In this paper, we 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 high speed and safety.

KW - Cryptography

KW - Efficient Computation.

KW - Homomorphic Encryption

UR - https://www.scopus.com/pages/publications/85106010520

U2 - 10.1145/3440749.3442592

DO - 10.1145/3440749.3442592

M3 - Conference contribution

AN - SCOPUS:85106010520

T3 - ACM International Conference Proceeding Series

BT - Proceedings of the 4th International Conference on Future Networks and Distributed Systems, ICFNDS 2020

PB - Association for Computing Machinery

ER -

Kara M, Laouid A, Euler R, Yagoub MA, Bounceur A, Hammoudeh M et al. A homomorphic digit fragmentation encryption scheme based on the polynomial reconstruction problem. In Proceedings of the 4th International Conference on Future Networks and Distributed Systems, ICFNDS 2020. Association for Computing Machinery. 2020. 3442592. (ACM International Conference Proceeding Series). doi: 10.1145/3440749.3442592

A homomorphic digit fragmentation encryption scheme based on the polynomial reconstruction problem

Abstract

Publication series

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this