A cryptographic security scheme is proposed for a subsystem of the integrated computer-aided system that is intended for holding elections and counting the election returns. The main idea is to use two modern quantum cryptographic technologies: quantum bit commitment and quantum secret sharing. The scheme of information security of vote count procedure, and also the quantum bit commitment protocol and the quantum secret sharing protocol, are described. Using the protocols of quantum cryptography increases security of the computer-aided voting system on comparison with protocols of usual classical cryptography.
A cryptographic security scheme is proposed for a subsystem of the integrated computer-aided system that is intended for holding elections and counting the election returns. The main idea is to use two modern quantum cryptographic technologies: quantum bit commitment and quantum secret sharing. The scheme of information security of vote count procedure, and also the quantum bit commitment protocol and the quantum secret sharing protocol, are described. Using the protocols of quantum cryptography increases security of the computer-aided voting system on comparison with protocols of usual classical cryptography.
In a traditional voting system, voters have to reach the voting system to cast their votes. It is difficult for the elderly and for those living in remote localities to cast a vote. In the era of digital advancements, remote electronic voting has emerged as an efficient means of engaging citizens in decision-making processes. However, ensuring fairness and mitigating fraud in elections remain significant challenges. This research paper proposes a novel approach called Quantum Secret Sharing (QSS) combined with the quantum binary voting protocol, leveraging the capabilities of the IBM Quantum Experience platform. By incorporating established security features and introducing new criteria, this protocol aims to surpass the limitations of classical voting systems. The research involves the creation of communication circuits using IBM Quantum Experience and subsequent analysis through quantum state tomography. By integrating the principles of QSS and the quantum binary voting protocol, the proposed approach addresses the limitations of classical voting systems. The protocol satisfies the standards of traditional voting systems while introducing new criteria to overcome their shortcomings. Through the utilization of IBM Quantum Experience, secure communication circuits are established, and the outcomes are analyzed using quantum state tomography, ensuring the fairness and accuracy of the voting process. It integrates quantum cryptography, quantum communication, and classical cryptography techniques to create a robust and tamper-resistant voting protocol. By employing quantum superposition, the protocol enables voters to cast their votes in multiple states simultaneously, making it extremely difficult for a malicious person to intercept or alter individual votes. Furthermore, quantum entanglement ensures that any unauthorized attempt to measure or manipulate the quantum states would result in detectable changes, enhancing the overall security of the voting process.
In the age of digital transformation, the integrity and security of online voting systems have become a growing concern. Traditional cryptography methods are vulnerable to advances in quantum computing, demanding the need for more secure alternatives. This paper explores the application of quantum cryptography in enhancing the security of blockchain-based voting systems, a decentralized and transparent approach to conduct elections. We introduce a novel quantum-resistant voting protocol that integrates Quantum Key Distribution (QKD) with post-quantum cryptographic algorithms, ensuring secure voter authentication, vote casting, and tallying. The methodology combines quantum encryption with blockchain's immutability to create a tamper-proof voting ledger, preventing unauthorized access and vote manipulation. It gives an analysis of potential real-world implementations, positioning a hybrid quantum-blockchain framework as a promising solution for future secure electronic voting systems.
Quantum cryptography is a new paradigm of cryptographic information protection, utilizing the laws of quantum mechanics and the corresponding quantum properties of information carriers — photons to overcome the limitations of classical cryptographic protocols and increase the security of cryptographic protocols up to the information-theoretic level. The paper provides a general overview and analysis of modern quantum information security technologies, particularly protocols for quantum key distribution, quantum secure direct communication, and quantum secret sharing. Several other areas of quantum cryptography are briefly considered, such as quantum digital signature, quantum bit commitment, quantum steganography, etc. The advantages and disadvantages of quantum cryptographic protocols, as well as the prospects and challenges of their practical implementation, are analyzed. A brief overview of the laws of quantum physics underlying the security of quantum cryptographic protocols is also provided. Keywords: quantum cryptography, physical foundations of quantum cryptography, qubit, qudit, entangled qubits and qudits, quantum key distribution, quantum secure direct communication, quantum secret sharing.
The rapid advancement of internet technology has raised attention to the importance of electronic voting in maintaining democracy and fairness in elections. E-voting refers to the use of electronic technology to facilitate the casting and counting of votes in elections. The need for designated verification arises from concerns about voter privacy, auditability, and the prevention of manipulation. Traditional e-voting systems use cryptographic techniques for security but lack verifiable proof of integrity. Integrating e-voting with a quantum designated verifier could address these challenges by leveraging the principles of quantum mechanics to enhance security and trustworthiness. In light of this, we propose a quantum e-voting scheme that uses a designated verifier signature. To ensure the confidentiality and authenticity of the voting process, the scheme uses quantum features like the no-cloning theorem and quantum key distribution. The proposed scheme has security properties like source hiding, non-transferability, and message anonymity. The proposed scheme is resistant to many quantum attacks, such as eavesdropping and impersonation. Due to designated verification, the scheme minimizes the risk of tempering. This paper provides a detailed description of the proposed scheme and analyzes its security properties. Therefore, the proposed scheme is efficient, practical, and secure.
Abstract Security (privacy, confidentiality and integrity) of pre-electoral, electoral and post electoral phases of the electioneering process is fundamental to the success of Electronic Voting (E-Voting) Systems. Crystography, which is the combination of cryptography and steganography could be a fitting ‘tool kit’ for enhancing the security of sensitive election-related information transmitted over public networks, thereby also ensuring free, fair and credible election/voting. Most of the existing secure e-voting systems are based on public key cryptographic schemes like RSA and Elliptic Curve Cryptography (ECC), whose security depends on the difficulty of solving Integer Factorization Problem (IFP) and Discrete Logarithm problem (DLP) respectively. However, techniques for solving IFP and DLP problems, improves continually. One of such is the quantum algorithm discovered by Peter Shor in 1994, which can solve both IFP and DLP problems in polynomial time. Consequently, the existence of quantum computers in the range of 1000 bits would spell doom to systems based on those problems. This paper presents the development of a new crystographic system that combines Post Quantum Cryptography with steganography to ensure that the security of e-voting is maintained both in classical computing era as well as post-quantum computing era. Our experiments’ results shows that our proposed system performed better than existing ones.