A Comprehensive Review of Homomorphic Commitment Schemes for Secure Voting Infrastructures: Security Models, Optimization Techniques, and Emerging Computing Applications

Abstract

Secure electronic voting (e-voting) systems have become an essential component of modern democratic processes, demanding strong guarantees of privacy, integrity, verifiability, and resistance to coercion. Homomorphic commitment schemes, which integrate the properties of commitment schemes with homomorphic encryption, provide a promising approach to meeting these requirements by enabling computations on encrypted or committed data without revealing the underlying information. This capability allows secure vote tallying while preserving voter anonymity. This paper presents a comprehensive review of homomorphic commitment schemes within secure voting infrastructures, focusing on key security models such as privacy, verifiability, coercion resistance, and robustness against malicious adversaries. It also examines optimization techniques, including batching, threshold cryptography, and blockchain integration, which enhance system efficiency and scalability. Furthermore, emerging paradigms such as post-quantum cryptography and decentralized systems are discussed for their potential impact on voting protocols. The study highlights advancements in cryptographic primitives, zero-knowledge proofs, and distributed ledger technologies, while providing a comparative analysis of multiple research contributions. The findings indicate that although homomorphic commitment schemes significantly enhance transparency and privacy, challenges related to computational complexity, scalability, and real-world implementation persist, suggesting the need for lightweight, quantum-resistant, and hybrid secure voting solutions.

 , , , ,