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

Journal of Information Security and Applications

Comprehensively enhancing the security of control with combined homomorphic encryption

Tongtong Sui, Jizhi Wang, Wen Liu, Lizhen Wang, Lingrui Kong, Yue Zhao

Published Aug 20, 2024• 1 citation
Publisher
DOI
10.1016/j.jisa.2024.103862

Related papers

Comprehensive Introduction to Fully Homomorphic Encryption for Dynamic Feedback Controller via LWE-Based Cryptosystem

Junsoo Kim, Hyungbo Shim, Kyoohyung Han

Springer eBooks•Nov 21, 2019•18 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•439 citations

QuHE: Optimizing Utility-Cost in Quantum Key Distribution and Homomorphic Encryption Enabled Secure Edge Computing Networks

Liangxin Qian, Yang Li, Jun Zhao

Ensuring secure and efficient data processing in mobile edge computing (MEC) systems is a critical challenge. While quantum key distribution (QKD) offers unconditionally secure key exchange and homomorphic encryption (HE) enables privacy-preserving data processing, existing research fails to address the comprehensive trade-offs among QKD utility, HE security, and system costs. This paper proposes a novel framework integrating QKD, transciphering, and HE for secure and efficient MEC. QKD distributes symmetric keys, transciphering bridges symmetric encryption, and HE processes encrypted data at the server. We formulate an optimization problem balancing QKD utility, HE security, processing and wireless transmission costs. However, the formulated optimization is non-convex and NPhard. To solve it efficiently, we propose the Quantum-enhanced Homomorphic Encryption resource allocation (QuHE) algorithm. Theoretical analysis proves the proposed QuHE algorithm’s convergence and optimality, and simulations demonstrate its effectiveness across multiple performance metrics.

arXiv:2507.06086•IEEE International Conference on Distributed Computing Systems (ICDCS)•Jul 21, 2025•2 citations

Convertible Multi-key Fully Homomorphic Encryption

Congge Xie, Kai He, Liupiao Zhang

Lecture notes in computer science•Nov 5, 2026•0 citations

Kuantum sonrası kriptografi: homomorfik şifreleme

Uluışık, Emrullah

This thesis presents a comprehensive analysis of Fully Homomorphic Encryption (FHE), a transformative advancement in contemporary cryptography. The exponential growth in digital data, coupled with the escalating demand for remote data processing, has elevated the importance of robust information security and privacy mechanisms. Homomorphic Encryption (HE) schemes facilitate the outsourcing of computations to untrusted third parties without exposing the underlying sensitive information, significantly enhancing data privacy assurances. Traditional encryption methods effectively protect data at rest and in transit; however, they inherently lack the capability to perform operations directly on encrypted data. FHE addresses this fundamental shortcoming by enabling intricate computations to be conducted on encrypted data without the necessity of decryption. The thesis begins by outlining the historical development of encryption systems and fundamental cryptographic concepts. It details the progression from the "privacy homomorphism" concept introduced by Rivest, Adleman, and Dertouzos in 1978 to Craig Gentry's seminal work in 2009, which presented the first practical FHE scheme. The key milestones in the evolution of FHE and major contributions in the literature are presented from both theoretical and practical perspectives. Subsequently, the mathematical structures and concepts underlying FHE are discussed in depth. Topics such as lattices, rings and fields, polynomials, number fields, canonical embedding, and ideal structures are examined as the foundational building blocks ensuring the security of FHE. In particular, challenging problems provided by Lattice-Based Cryptography, such as Learning with Errors (LWE), serve as the mathematical basis for FHE's resistance to attacks. The thesis also analyzes the structure, functioning, and differences between modern FHE schemes (such as Brakerski, Gentry and Vaikuntanathan (BGV), Fan and Vercauteren (BFV), and Cheon-Kim-Kim-Song (CKKS)). The practical applications, advantages, limitations, and recent optimization techniques of these schemes are thoroughly examined. Special attention is given to the opportunities FHE offers in sectors where data privacy is paramount, including healthcare, finance, and cloud computing. Key practical challenges such as high computational costs, large key and ciphertext sizes, and noise management are highlighted. Innovations to address these challenges, including hardware accelerators, software optimizations, and open-source libraries (like HELib and SEAL), are explored in detail. The thesis also covers contemporary research areas such as multi-key FHE, privacy-preserving computation in artificial intelligence, and post-quantum cryptography. In conclusion, this thesis presents a broad perspective on FHE, covering its mathematical foundations and practical application potential, while evaluating current developments, limitations, and future research directions. The wider and more efficient xxv adoption of FHE will open new possibilities for information security and privacy. In this context, the thesis aims to serve as a comprehensive resource for both academic and industrial communities. Keywords: Bootstrapping, Relinearization, Ring Learning with Errors, BGV, BFV, CKKS.

•Jan 1, 2025•0 citations

Fully Homomorphic Encryption with Auxiliary Inputs

Fuqun Wang, Kunpeng Wang

Lecture notes in computer science•Jan 1, 2015•9 citations
Ensuring secure and efficient data processing in mobile edge computing (MEC) systems is a critical challenge. While quantum key distribution (QKD) offers unconditionally secure key exchange and homomorphic encryption (HE) enables privacy-preserving data processing, existing research fails to address the comprehensive trade-offs among QKD utility, HE security, and system costs. This paper proposes a novel framework integrating QKD, transciphering, and HE for secure and efficient MEC. QKD distributes symmetric keys, transciphering bridges symmetric encryption, and HE processes encrypted data at the server. We formulate an optimization problem balancing QKD utility, HE security, processing and wireless transmission costs. However, the formulated optimization is non-convex and NPhard. To solve it efficiently, we propose the Quantum-enhanced Homomorphic Encryption resource allocation (QuHE) algorithm. Theoretical analysis proves the proposed QuHE algorithm’s convergence and optimality, and simulations demonstrate its effectiveness across multiple performance metrics.
This thesis presents a comprehensive analysis of Fully Homomorphic Encryption (FHE), a transformative advancement in contemporary cryptography. The exponential growth in digital data, coupled with the escalating demand for remote data processing, has elevated the importance of robust information security and privacy mechanisms. Homomorphic Encryption (HE) schemes facilitate the outsourcing of computations to untrusted third parties without exposing the underlying sensitive information, significantly enhancing data privacy assurances. Traditional encryption methods effectively protect data at rest and in transit; however, they inherently lack the capability to perform operations directly on encrypted data. FHE addresses this fundamental shortcoming by enabling intricate computations to be conducted on encrypted data without the necessity of decryption. The thesis begins by outlining the historical development of encryption systems and fundamental cryptographic concepts. It details the progression from the "privacy homomorphism" concept introduced by Rivest, Adleman, and Dertouzos in 1978 to Craig Gentry's seminal work in 2009, which presented the first practical FHE scheme. The key milestones in the evolution of FHE and major contributions in the literature are presented from both theoretical and practical perspectives. Subsequently, the mathematical structures and concepts underlying FHE are discussed in depth. Topics such as lattices, rings and fields, polynomials, number fields, canonical embedding, and ideal structures are examined as the foundational building blocks ensuring the security of FHE. In particular, challenging problems provided by Lattice-Based Cryptography, such as Learning with Errors (LWE), serve as the mathematical basis for FHE's resistance to attacks. The thesis also analyzes the structure, functioning, and differences between modern FHE schemes (such as Brakerski, Gentry and Vaikuntanathan (BGV), Fan and Vercauteren (BFV), and Cheon-Kim-Kim-Song (CKKS)). The practical applications, advantages, limitations, and recent optimization techniques of these schemes are thoroughly examined. Special attention is given to the opportunities FHE offers in sectors where data privacy is paramount, including healthcare, finance, and cloud computing. Key practical challenges such as high computational costs, large key and ciphertext sizes, and noise management are highlighted. Innovations to address these challenges, including hardware accelerators, software optimizations, and open-source libraries (like HELib and SEAL), are explored in detail. The thesis also covers contemporary research areas such as multi-key FHE, privacy-preserving computation in artificial intelligence, and post-quantum cryptography. In conclusion, this thesis presents a broad perspective on FHE, covering its mathematical foundations and practical application potential, while evaluating current developments, limitations, and future research directions. The wider and more efficient xxv adoption of FHE will open new possibilities for information security and privacy. In this context, the thesis aims to serve as a comprehensive resource for both academic and industrial communities. Keywords: Bootstrapping, Relinearization, Ring Learning with Errors, BGV, BFV, CKKS.