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

New Physics Sae Mulli

Homomorphic Encryptions at a Long Distance Through Quantum Key Distribution Protocols

Kabgyun Jeong, Yong Jin KIM, Jong Beom YOON, Geon‐Woo Kim, Gueha CHO, Suntaek Kim

Published Feb 28, 2019• 0 citations
Publisher
DOI
10.3938/npsm.69.187

Related papers

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

Quantum Homomorphic Encryption

Tao Shang

Springer eBooks•Oct 15, 2024•0 citations

An Universal Quantum Homomorphic Encryption Framework

Yajun Liu

International Conference on Mobile Internet, Cloud Computing and Information Security (MICCIS)•Apr 1, 2026•0 citations

Integrating BFV Homomorphic Encryption and BB84 QKD: A Simulation Study of Quantum-Resilient Encrypted Computation

Chitra M, Aditya N, Dhruv Shankar +2 more

In order to investigate quantum-resilient encrypted computation, we create and assess a prototype framework that combines a simulated BB84 quantum key distribution (QKD) protocol with the Brakerski–Fan–Vercauteren (BFV) homomorphic encryption scheme. We benchmark encrypted polynomial evaluations under identical parameter settings using Qiskit-based BB84 simulation and Microsoft SEAL for BFV, contrasting a pure-BFV baseline with the integrated BFV+QKD workflow. The hybrid design achieves comparable end-to-end latency, stable ciphertext sizes, and correct decryption across all tested parameter sets in our experiments on a single commodity server, suggesting that it is possible to integrate QKD-derived session keys for evaluation-key protection in this setting without incurring prohibitive overhead. These findings are restricted to single-node experiments and idealized QKD simulation; they do not account for physical quantum channels, network latency, or large-scale multi-tenant deployments, which are left for future research. The evaluation is conducted under an honest-but-curious server model and an idealized BB84 simulation, and does not provide a composable security proof of the integrated QKD–HE workflow.

IEEE India Conference•Dec 18, 2025•0 citations

Quantum Fully Homomorphic Encryption with Verification

Gorjan Alagic, Yfke Dulek, Christian Schaffner +1 more

arXiv:1708.09156•Lecture notes in computer science•Jan 1, 2017•42 citations

Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS

Eunkyung Kim, Hyang-Sook Lee, Jeongeun Park

Multikey fully homomorphic encryption (MFHE) allows homomorphic operations between ciphertexts encrypted under different keys. In applications for secure multiparty computation (MPC) protocols, MFHE can be more advantageous than usual fully homomorphic encryption (FHE) since users do not need to agree with a common public key before the computation when using MFHE. In EUROCRYPT 2016, Mukherjee and Wichs constructed a secure MPC protocol in only two rounds via MFHE which deals with a common random/reference string (CRS) in key generation. After then, Brakerski et al. replaced the role of CRS with the distributed setup for CRS calculation to form a four round secure MPC protocol. Thus, recent improvements in round complexity of MPC protocols have been made using MFHE. In this paper, we go further to obtain round-efficient and secure MPC protocols. The underlying MFHE schemes in previous works still involve the common value, CRS, it seems to weaken the power of using MFHE to allow users to independently generate their own keys. Therefore, we resolve the issue by constructing an MFHE scheme without CRS based on LWE assumption, and then we obtain a secure MPC protocol against semi-malicious security in three rounds. We also define a new security notion “multikey-CPA security” to prove that a multikey ciphertext cannot be decrypted unless all the secret keys are gathered and our scheme is multikey-CPA secure.

International Journal of Foundations of Computer Science•Feb 1, 2020•14 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.
In order to investigate quantum-resilient encrypted computation, we create and assess a prototype framework that combines a simulated BB84 quantum key distribution (QKD) protocol with the Brakerski–Fan–Vercauteren (BFV) homomorphic encryption scheme. We benchmark encrypted polynomial evaluations under identical parameter settings using Qiskit-based BB84 simulation and Microsoft SEAL for BFV, contrasting a pure-BFV baseline with the integrated BFV+QKD workflow. The hybrid design achieves comparable end-to-end latency, stable ciphertext sizes, and correct decryption across all tested parameter sets in our experiments on a single commodity server, suggesting that it is possible to integrate QKD-derived session keys for evaluation-key protection in this setting without incurring prohibitive overhead. These findings are restricted to single-node experiments and idealized QKD simulation; they do not account for physical quantum channels, network latency, or large-scale multi-tenant deployments, which are left for future research. The evaluation is conducted under an honest-but-curious server model and an idealized BB84 simulation, and does not provide a composable security proof of the integrated QKD–HE workflow.
Multikey fully homomorphic encryption (MFHE) allows homomorphic operations between ciphertexts encrypted under different keys. In applications for secure multiparty computation (MPC) protocols, MFHE can be more advantageous than usual fully homomorphic encryption (FHE) since users do not need to agree with a common public key before the computation when using MFHE. In EUROCRYPT 2016, Mukherjee and Wichs constructed a secure MPC protocol in only two rounds via MFHE which deals with a common random/reference string (CRS) in key generation. After then, Brakerski et al. replaced the role of CRS with the distributed setup for CRS calculation to form a four round secure MPC protocol. Thus, recent improvements in round complexity of MPC protocols have been made using MFHE. In this paper, we go further to obtain round-efficient and secure MPC protocols. The underlying MFHE schemes in previous works still involve the common value, CRS, it seems to weaken the power of using MFHE to allow users to independently generate their own keys. Therefore, we resolve the issue by constructing an MFHE scheme without CRS based on LWE assumption, and then we obtain a secure MPC protocol against semi-malicious security in three rounds. We also define a new security notion “multikey-CPA security” to prove that a multikey ciphertext cannot be decrypted unless all the secret keys are gathered and our scheme is multikey-CPA secure.