Related papers: A Quantum-Secure and Blockchain-Integrated E-Voting Framework with Identity Validation

A Quantum-Secure and Blockchain-Integrated E-Voting Framework with Identity Validation

URL: http://arxiv.org/abs/2511.16034v1
Date: Thu, 20 Nov 2025 04:28:20 GMT
Title: A Quantum-Secure and Blockchain-Integrated E-Voting Framework with Identity Validation
Authors: Ashwin Poudel, Utsav Poudel, Dikshyanta Aryal, Anuj Nepal, Pranish Pathak, Subramaniyaswamy V,
Abstract summary: Quantum computing poses a threat to cryptographic foundations of digital systems.<n>We introduce a post-quantum-secure evoting architecture that integrates digital signatures, biometric authentication, and a permissioned blockchain for tamper-proof vote storage.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: The rapid growth of quantum computing poses a threat to the cryptographic foundations of digital systems, requiring the development of secure and scalable electronic voting (evoting) frameworks. We introduce a post-quantum-secure evoting architecture that integrates Falcon lattice-based digital signatures, biometric authentication via MobileNetV3 and AdaFace, and a permissioned blockchain for tamper-proof vote storage. Voter registration involves capturing facial embeddings, which are digitally signed using Falcon and stored on-chain to ensure integrity and non-repudiation. During voting, real-time biometric verification is performed using anti-spoofing techniques and cosine-similarity matching. The system demonstrates low latency and robust spoof detection, monitored through Prometheus and Grafana for real-time auditing. The average classification error rates (ACER) are below 3.5% on the CelebA Spoof dataset and under 8.2% on the Wild Face Anti-Spoofing (WFAS) dataset. Blockchain anchoring incurs minimal gas overhead, approximately 3.3% for registration and 0.15% for voting, supporting system efficiency, auditability, and transparency. The experimental results confirm the system's scalability, efficiency, and resilience under concurrent loads. This approach offers a unified solution to address key challenges in voter authentication, data integrity, and quantum-resilient security for digital systems.

Related papers

Verifier-initiated quantum message-authentication via quantum zero-knowledge proofs [38.81686642226027]
We introduce a new method where the verifier can request authentication only when needed, improving efficiency for quantum networks and blockchain applications.<n>Our approach adapts the concept of zero-knowledge widely used in classical cryptography to quantum settings, ensuring that verification reveals nothing about secret keys.<n>This work delivers the first general verifier-initiated quantum signature scheme with formal security, paving the way for scalable, secure authentication in future quantum infrastructures and decentralized systems.
arXiv Detail & Related papers (2025-12-05T04:40:34Z)
A Quantum-Secure Voting Framework Using QKD, Dual-Key Symmetric Encryption, and Verifiable Receipts [0.4511923587827302]
We introduce a quantum-secure voting framework that integrates Quantum Key Distribution (QKD), Dual-Key Symmetric Encryption, and verifiable receipt mechanisms.<n>The framework enables voters to establish encryption keys securely, cast encrypted ballots, and verify their votes through receipt-based confirmation.<n>Results demonstrate that the system can process large numbers of votes efficiently with low latency and minimal error rates.
arXiv Detail & Related papers (2025-10-03T20:13:30Z)
Blockchain-Based Secure Online Voting Platform Ensuring Voter Anonymity, Integrity, and End-to-End Verifiability [0.0]
This paper proposes a hybrid blockchain-based voting model that stores encrypted votes on a private blockchain maintained by election organizers and neutral observers.<n>The system issues voters one-time blind-signed tokens to protect anonymity, and provides receipts so they can confirm their vote.<n>This research highlights the feasibility of secure, verifiable, and scalable online voting for organizations ranging from small groups to larger institutions.
arXiv Detail & Related papers (2025-09-26T21:58:52Z)
SmartphoneDemocracy: Privacy-Preserving E-Voting on Decentralized Infrastructure using Novel European Identity [0.0]
SmartphoneDemocracy is a novel e-voting protocol that combines three key technologies.<n>Our protocol enables voters to register and cast ballots anonymously and verifiably directly from their smartphones.
arXiv Detail & Related papers (2025-07-13T02:39:10Z)
Trusted Compute Units: A Framework for Chained Verifiable Computations [41.94295877935867]
This paper introduces the Trusted Compute Unit (TCU), a unifying framework that enables composable and interoperable computations across heterogeneous technologies.<n>By enabling secure off-chain interactions without incurring on-chain confirmation delays or gas fees, TCUs significantly improve system performance and scalability.
arXiv Detail & Related papers (2025-04-22T09:01:55Z)
A New Era of Elections: Leveraging Blockchain for Fair and Transparent Voting [6.895563531851402]
This study presents a blockchain-based voting system aimed at enhancing election security, transparency, and integrity.<n>Our proposed system combines blockchain's immutable, decentralized ledger with advanced voter identity verification techniques.<n>Security analysis indicates that this multi-layered approach significantly reduces impersonation risks.
arXiv Detail & Related papers (2025-02-22T07:45:08Z)
Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
We propose a novel quantum digital signature protocol without a trusted third-party.<n>We prove that the protocol has information-theoretical unforgeability.
arXiv Detail & Related papers (2024-10-17T09:49:29Z)
The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
arXiv Detail & Related papers (2024-07-16T20:53:04Z)
Demonstration of quantum-digital payments [36.136619420474766]
We show how quantum light can secure daily digital payments by generating inherently unforgeable quantum cryptograms. Unlike previously proposed protocols, our solution does not depend on long-term quantum storage or trusted agents and authenticated channels. It is practical with near-term technology and may herald an era of quantum-enabled security.
arXiv Detail & Related papers (2023-05-23T20:20:14Z)
Anonymous voting scheme using quantum assisted blockchain [0.39146761527401425]
We propose an anonymous voting scheme based on quantum assisted blockchain. The voting scheme is auditable and can be implemented using the currently available technology.
arXiv Detail & Related papers (2022-06-07T11:07:28Z)
Quantum-resistance in blockchain networks [46.63333997460008]
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
arXiv Detail & Related papers (2021-06-11T23:39:25Z)
DeepiSign: Invisible Fragile Watermark to Protect the Integrityand Authenticity of CNN [37.98139322456872]
We propose a self-contained tamper-proofing method, called DeepiSign, to ensure the integrity and authenticity of CNN models. DeepiSign applies the idea of fragile invisible watermarking to securely embed a secret and its hash value into a CNN model. Our theoretical analysis shows that DeepiSign can hide up to 1KB secret in each layer with minimal loss of the model's accuracy.
arXiv Detail & Related papers (2021-01-12T06:42:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.