Compare Papers
Paper 1
Blind information reconciliation with polar codes for quantum key distribution
E. O. Kiktenko, A. O. Malyshev, A. K. Fedorov
- Year
- 2020
- Journal
- arXiv preprint
- DOI
- arXiv:2008.12299
- arXiv
- 2008.12299
We suggest a new protocol for the information reconciliation stage of quantum key distribution based on polar codes. The suggested approach is based on the blind technique, which is proved to be useful for low-density parity-check (LDPC) codes. We show that the suggested protocol outperforms the blind reconciliation with LDPC codes, especially when there are high fluctuations in quantum bit error rate (QBER).
Open paperPaper 2
A Quantum-Secure Voting Framework Using QKD, Dual-Key Symmetric Encryption, and Verifiable Receipts
Taha M. Mahmoud, Naima Kaabouch
- Year
- 2025
- Journal
- arXiv preprint
- DOI
- arXiv:2510.03489
- arXiv
- 2510.03489
Electronic voting systems face growing risks from cyberattacks and data breaches, which are expected to intensify with the advent of quantum computing. To address these challenges, we introduce a quantum-secure voting framework that integrates Quantum Key Distribution (QKD), Dual-Key Symmetric Encryption, and verifiable receipt mechanisms to strengthen the privacy, integrity, and reliability of the voting process. The framework enables voters to establish encryption keys securely, cast encrypted ballots, and verify their votes through receipt-based confirmation, all without exposing the vote contents. To evaluate performance, we simulate both quantum and classical communication channels using the Message Queuing Telemetry Transport (MQTT) protocol. Results demonstrate that the system can process large numbers of votes efficiently with low latency and minimal error rates. This approach offers a scalable and practical path toward secure, transparent, and verifiable electronic voting in the quantum era.
Open paper