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.
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.
The emergence of quantum computing poses a significant threat to classical cryptographic systems, particularly those relying on mathematical hardness assumptions for key exchange. While symmetric algorithms such as the Advanced Encryption Standard (AES) remain efficient and widely deployed, their long-term security ultimately depends on the secrecy of keys. In this paper, we present a hybrid framework that integrates quantum key distribution (QKD) with AES and DES to enhance key security without altering cipher internals. Using the BB84 protocol as the quantum key generator, we implement a simulation-based system in Qiskit and evaluate it against classical pseudo-random key generation.Our methodology covers five phases: establishing AES/DES baselines, generating quantum random keys, implementing BB84 with basis reconciliation and error detection, integrating quantum keys with AES/DES, and benchmarking across varying key sizes and file sizes. Results demonstrate that AES encryption throughput remains stable (around 250–370 MB/s) regardless of key source, while QKD introduces measurable latency in key generation (around 40–110 seconds for 128–256 bits). Importantly, adversarial interference is reliably detected, with 97.3% accuracy in eavesdropper identification.The findings confirm that while classical systems excel in speed and scalability, QKD offers unmatched, physics-backed security assurances. Our study highlights the practicality of hybrid quantum-classical encryption, providing a foundation for secure communication in the post-quantum era.
By utilizing concepts from quantum physics like entanglement and superposition, quantum cryptography is revolutionizing data security. This study focuses on the application of classical computational models for simulation-based analysis of Quantum Key Distribution (QKD) protocols, namely BB84 and E91. By taking use of quantum features, QKD makes secure key exchange possible and guarantees that any effort at eavesdropping may be identified because of the disruption of quantum states. In order to assess how quantum communication channels behave under different noise and attack scenarios, the study models and simulates these channels. The study evaluates the efficacy and robustness of BB84 and E91 protocols in practical network settings by contrasting their performance and error tolerance. In order to determine if integrating quantum-secured systems with current classical infrastructures is feasible, scalability issues are also investigated. These simulations’ outcomes shed light on feasible security levels, resource needs, and workable deployment tactics. In the end, this research highlights how quantum cryptography may advance the basis for next-generation secure information networks by bridging the gap between theoretical quantum security models and real-world communication systems with the use of strong simulation frameworks.
Secure Multi-Party Computation (MPC) facilitates cooperative computation on confidential data. Homomorphic Encryption (HE) offers primitives to compute on encrypted data, but protecting the communication channel with classical key exchange is increasingly exposed to quantum attackers. This work outlines a hybrid model where Paillier HE supports secure additive aggregation, while BBM92 QKD simulation generates quantum-resistant keys for AES-GCM, which in turn protects inter-party communication of HE ciphertexts. The model takes advantage of Paillier HE for secure additive aggregation and simulated BBM92 QKD protocol for generating information-theoretically secure symmetric keys, as opposed to keys obtained from traditional protocols such as Diffie-Hellman. These keys protect the exchange of intermediate homomorphically encrypted values among parties with AES-GCM. We outline the system architecture, Python library-based implementation (Qiskit, phe, cryptography), and simulation results proving the feasibility and improved security against quantum eavesdropping over a fully classical solution. The framework efficiently calculates aggregate sums while maintaining input confidentiality and guarantees communication security that withstands simulated eavesdropping attacks on the quantum channel.
As quantum computing technology advances, our traditional methods of securing information are becoming vulnerable to new types of attacks. To counter these threats, Quantum Key Distribution (QKD) methods like the BB84 protocol offer a way to create extremely secure keys. However, QKD alone can have practical limitations and might still be exposed to certain types of attacks. On the other hand, Post-Quantum Cryptography (PQC) provides a robust defense against quantum attacks through complex mathematical algorithms. This research aims to combine the best of both worlds: using the BB84 QKD protocol to generate secure keys and then using these keys with PQC algorithms for encrypting information. By integrating QKD for key generation and Lattice based (Kyber) PQC for encryption, we hope to create a cryptographic system that is both incredibly secure and practical for real-world use. This project will involve designing the hybrid system, testing it through simulations, and evaluating its performance and security against traditional methods.
The cyber-security of multi-agent control systems has become vital in practice. To protect the communication process between the individual agents over TCP/IP networks, one must encrypt the messages to be sent, which is costly in a large-scale network when high-level security is demanded. To lessen the burden of heavy encryption and decryption processes, we introduce the Homomorphic Encryption to reduce the number of encryption/decryption terminals that are supposed to equip with every agent. The security is enhanced by the quantum key distribution technology, which can generate secret keys that are theoretically absolutely secure even against quantum computation. We proposed a hybrid method that make good use of the randomness of quantum keys, one-time pad and symmetric encryption to make sure the overall security of homomorphic encryption algorithms. Numerical simulations are provided to illustrate how our scheme.
Secure communication is crucial for intelligent infrastructure networks, especially in the field of vehicle-to-everything (V2X) communication. Real-time information ex change between vehicles is the cornerstone of traffic safety and intelligent decision making. However, existing V2X communication systems primarily rely on classical cryptographic security mechanisms, while the rapid development of quantum com puting fundamentally threatens their security guarantees. Quantum key distribu tion (QKD), based on the no-cloning principle of quantum mechanics, is considered a promising technology against quantum attacks. However, most existing studies focus on theoretical security analysis or static fiber optic transmission scenarios, lacking systematic evaluation of the complete QKD protocol workflow in highly dynamic V2X environments. To fill research gaps, this thesis constructs a vehicle-to-vehicle quantum key distribution (V2V-QKD) framework based on the Veins simulation platform, integrated with OMNeT++ and SUMO. The framework implements qubit preparation and trans mission, measurement, quantum bit error rate (QBER) estimation, error correction, and privacy amplification, aiming to evaluate the feasibility and robustness of QKD in dynamic V2V communication scenarios. This thesis designs two sets of experiments. The first set of experiments evaluates parameter robustness by varying the number of qubits transmitted in a single session and analyzing its impact on quantum error rate (QBER), final key length, and key generation rate. Experimental results show that when 𝑁raw = 800, the system achieves a favorable balance between QBER estimation stability and key generation reliability. The second set of experiments compares the performance of BB84 and SARG04 under gradually increasing eavesdropping and attack intensity. Results show that under no eavesdropping conditions, BB84 can stably generate longer keys, but its performance degrades significantly under attacks; while SARG04 generates shorter keys under ideal conditions, but remains relatively stable under increased attack interference. Comprehensive results demonstrate that, under optimized configuration, QKD can provide stable and secure key generation for V2V communication. Furthermore, an adaptive protocol selection strategy enhances system-level security resilience. This thesis verifies the feasibility of QKD in vehicular network environments and provides an experimental foundation and design reference for secure vehicular communication systems capable of withstanding quantum-era threats.