Research And Design Of Anonymous Electronic Voting Scheme Based On Zero-knowledge Proof

Electronic voting is increasingly favored due to its convenience,low cost,and efficient vote counting,gradually replacing traditional paper-based voting.However,electronic voting still faces challenges such as user information privacy breaches,duplicate voting,disclosure of voting content,and ballot tampering.Zero-knowledge proofs,with their properties of completeness,reliability,and zero knowledge,can address the issue of user privacy leakage in electronic voting.In this paper,we propose an anonymous electronic voting model and scheme based on attribute certificates by combining zero-knowledge proof techniques with electronic voting solutions.We utilize zero-knowledge proof protocols to achieve attribute-based certificate authentication and user anonymity.El Gamal encryption techniques and the introduction of a Voting Management Server(VMT)ensure ballot fairness.The use of dual IDs(Cert ID,Ballot ID)guarantees ballot verifiability.We address issues such as the semi-trustworthiness of Certificate Authority(CA)and collusion between CA and voting institutions(VI).Furthermore,we present a batch zero-knowledge authentication model and scheme based on attribute access policies.By employing the Sumcheck idea,we involve a synthetic prover to control the number of attributes for all users in the synthesis process,allowing for different attribute access structures and reducing the computational burden on verifiers.We design an algorithm to identify users who fail the authentication process.User information is managed in a distributed manner to ensure privacy protection.We also tackle the challenges of high computational overhead and repetitive verification in zero-knowledge proofs.