Secret Ballot Elections
Verifiable secret sharing can be used to build an end-to-end auditable voting systems.
Using the technique of verifiable secret sharing one can satisfy the election problem that will be describe here.
In the election problem each voter can vote 0 (to oppose) or 1 (for favor), and the sum of all votes will determine election's result. For the election to execute, it is needed to make sure that the following conditions will fulfill:
- The voters' privacy should not be compromised.
- The election administrator must verify that no voter committed fraud.
If using verifiable secret sharing, n tellers will replace the single election administrator. Each voter will distribute one share of its secret vote to every one of the n tellers. This way the privacy of the voter is preserved and the first condition is satisfied.
Reconstruction of the election's result is easy, if there exist enough k
Read more about this topic: Verifiable Secret Sharing
Famous quotes containing the words secret, ballot and/or elections:
“It is a secret from nobody that the famous random event is most likely to arise from those parts of the world where the old adage There is no alternative to victory retains a high degree of plausibility.”
—Hannah Arendt (19061975)
“I do not think the mere extension of the ballot a panacea for all the ills of our national life. What we need to-day is not simply more voters, but better voters.”
—Frances Ellen Watkins Harper (18251911)
“Apparently, a democracy is a place where numerous elections are held at great cost without issues and with interchangeable candidates.”
—Gore Vidal (b. 1925)