A practical election scheme using the Guy Fawkes protocol and paired chaining publication

In view of their construction, digital election schemes are classified in two types. The one is based on anonymous channels and the other is based on number theoretic encryption techniques. In this paper, we present a hybrid scheme with has functions and paired chaining publication, which is a variation of anonymous channels. The Guy Fawkes Protocol supports an alternative of digital signature scheme using only hash function. With the Guy Fawkes protocol and a publication method, our election scheme achieves low complexity and resource consumption; this scheme aims at low computational load, high voter’s privacy, untraceability of voters and universal verifiability of ballots.