Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

An Edge-Based and Quantum-Secure Fully Homomorphic Encryption Scheme A presentation explaining the theoretical and practical Regulator-Based Encryption (RBE) technique

Abdelkader Laouid

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.14837.54248

Related papers

Key Recovery of the Edge-Based Quantum-Secure Fully Homomorphic Encryption Scheme

Jiseung Kim, Hyung Tae Lee

IEEE Transactions on Consumer Electronics•Jan 1, 2026•0 citations

Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme

Joppe W. Bos, Kristin Lauter, Jake Loftus +1 more

Lecture notes in computer science•Jan 1, 2013•428 citations

On the security of the fully-homomorphic encryption scheme based on ideal lattices

Masaya Yasuda, Jun Yajima, Shimoyama Takeshi +1 more

IEICE Technical Report; IEICE Tech. Rep.•Sep 2, 2011•0 citations

An Edge-Based Quantum-Secure Fully Homomorphic Encryption Scheme

Abdelkader Laouid, Mostefa Kara, Mohammad Ali A. Hammoudeh +2 more

As artificial intelligence becomes increasingly integrated into data-driven decision-making and edge applications, concerns around cybersecurity and privacy preservation have intensified. Fully homomorphic (FH) encryption addresses some challenges by providing arbitrary secure artificial intelligence computations directly on encrypted data. However, current FH solutions are often too complex, insufficiently efficient, or vulnerable to future quantum threats. This article presents a new edge-based, quantum-resistant, FH encryption scheme tailored to the constraints of low-end and IoT devices. The core idea of the proposed scheme is built on a regulator-based design that employs an encrypted set of random values r1,r2,r3,rn satisfying 1nri1n, which plays a central role both during the encryption process and in enabling efficient homomorphic multiplication. The mathematical analysis proves that the designed scheme achieves robust homomorphic properties and computational agility while maintaining strong post-quantum security guarantees. Experimental evaluations demonstrate the feasibility of the scheme for real-world IoT scenarios, offering parametrizable encryption settings that adapt to varying security performance requirements. The proposed scheme achieved a lower complexity compared to classical and post-quantum schemes O(nl2) vs. O(n3),O(nlogn); and a high entropy of 7.27 vs. 7.13, 3.32.

IEEE Transactions on Consumer Electronics•Jul 30, 2025•7 citations

Practical cross-quantum homomorphic encryption with complete security

Zhenzhen Li, Ming-Kui Liu, Wen-Ling Yang +1 more

Chinese Journal of Physics•Dec 8, 2025•0 citations

A Research on the Application Comparison of NTRU in Typical Fully Homomorphic Encryption Scheme

Xu Zhao, Zheng Yuan

Fully homomorphic encryption (FHE) allows arbitrary computations to be performed directly on encrypted data and is a core technology for privacy computing and secure cloud computing. The Number Theory Research Unit (NTRU) has become a research topic in this field by virtue of its lattice-based anti-quantum security, efficient polynomial operation characteristics and natural multi-key homomorphism capability. In this paper, we systematically review the key advances of NTRU-based FHE, covering the directions of the design of FHE, the optimization of bootstrapping techniques, and the application to FHE for multi-key approaches. Furthermore, the innovativeness and practical application challenges of the schemes are analyzed, and the future research trends are envisioned.

International Symposium on AI and Cybersecurity (ISAICS)•Oct 24, 2025•0 citations
As artificial intelligence becomes increasingly integrated into data-driven decision-making and edge applications, concerns around cybersecurity and privacy preservation have intensified. Fully homomorphic (FH) encryption addresses some challenges by providing arbitrary secure artificial intelligence computations directly on encrypted data. However, current FH solutions are often too complex, insufficiently efficient, or vulnerable to future quantum threats. This article presents a new edge-based, quantum-resistant, FH encryption scheme tailored to the constraints of low-end and IoT devices. The core idea of the proposed scheme is built on a regulator-based design that employs an encrypted set of random values r1,r2,r3,rn satisfying 1nri1n, which plays a central role both during the encryption process and in enabling efficient homomorphic multiplication. The mathematical analysis proves that the designed scheme achieves robust homomorphic properties and computational agility while maintaining strong post-quantum security guarantees. Experimental evaluations demonstrate the feasibility of the scheme for real-world IoT scenarios, offering parametrizable encryption settings that adapt to varying security performance requirements. The proposed scheme achieved a lower complexity compared to classical and post-quantum schemes O(nl2) vs. O(n3),O(nlogn); and a high entropy of 7.27 vs. 7.13, 3.32.
Fully homomorphic encryption (FHE) allows arbitrary computations to be performed directly on encrypted data and is a core technology for privacy computing and secure cloud computing. The Number Theory Research Unit (NTRU) has become a research topic in this field by virtue of its lattice-based anti-quantum security, efficient polynomial operation characteristics and natural multi-key homomorphism capability. In this paper, we systematically review the key advances of NTRU-based FHE, covering the directions of the design of FHE, the optimization of bootstrapping techniques, and the application to FHE for multi-key approaches. Furthermore, the innovativeness and practical application challenges of the schemes are analyzed, and the future research trends are envisioned.