A Secure and verifiable internet voting system using homomorphic scheme.
|dc.description||Partial fulfillment for award of the degree of Master of Information Technology||en_US|
|dc.description.abstract||Institutions are changed with the actions of ensuring the rights of its members to participate in a democratic election, this is surpassing all the limitations of the traditional voting system, and the development of an electronic voting system serves as an attractive solution. Traditionally, cryptographic research has alerted on proving that the tally is the sum of all the ballots, and that the contents of a voter ballots remain secret. Cryptographic voting research considered the voter and the voting booth to be one entity. Voter's final ballot must be undisclosed and that cannot be accessed by a second party. Electors need the assurance that their votes have been cast and counted as intended. This research intends to identify and explore existing voting schemes, develop a secure voting and ranking system that uses computable and verifiable homomorphic scheme for both the votes and authorities. The voting system also allows secrete voting while maintaining the accuracy of election results and thus maintain the security requirement of and electronic voting system which includes privacy, completeness and verifiability.||en_US|
|dc.title||A Secure and verifiable internet voting system using homomorphic scheme.||en_US|