A New Electronic Voting Protocol Using Secret Sharing Based on Set of Path Domination

Abstract

For secret electronic voting protocol we always need a secure system. Secret sharing scheme are proved to be safe guarding through distributing the input key to number of participants then reconstructing the shares through a secure process. In this paper, the set of dominating paths in special graph is used to share the votes among a set of candidates, such that, each candidate represents an edge in the graph. Based on this new technique, we have shown that it is secure and confidential. The efficiency of the new protocol is demonstrated in terms of time and cost.