Electronic voting through DE-PBFT consensus and DAG data structure

Electronic voting systems are one of the most important issues in today's world. At the present time, most systems are traditional and centralized, and the counting of votes is done by a central party, and security depends on cryptographic techniques. Therefore, the need to create decentralized voting systems is increasing day by day, so in this way, preservation and counting of votes are done directly with the help of a consensus algorithm. Having the difficulties mentioned above, this paper presents an unbiased electronic voting model in which the votes from ballot boxes are sent to the candidates, and the candidates should confirm the received votes, after candidates' confirmation, they agree on the received votes by running an DE-PBFT consensus, and then add votes in their DAG data structure . In this way, all candidates are responsible for maintaining, validating and counting votes, and the trust through consensus protocols is provided in a decentralized system. The voter's anonymity has also been preserved through ring signature.