Punchscan

From Wikipedia, the free encyclopedia

Punchscan is an optical scan voting system invented by cryptographer David Chaum and is designed to offer integrity, privacy, and transparency. The system is voter-verifiable, provides an end-to-end audit mechanism, and issues a ballot receipt to each voter. The source code was released on November 2, 2006 under a modified BSD licence.^[1]

1 Voting Procedure
2 Tabulation Procedure
- 2.1 Working Example
- 2.2 Generalized Form
3 Basic Auditing Procedures
4 Additional Security
5 External links
6 See also
7 References

[edit] Voting Procedure

A marked Punchscan ballot. Full ballot (top), separated ballot (bottom).

A Punchscan ballot has two layers of paper. On the top layer, the candidates are listed with a symbol or letter beside their name. Below the candidate list, there are a series of round holes in the top layer of the ballot. Inside the holes on the bottom layer, the corresponding symbols are printed.

To cast a vote for a candidate, the voter must locate the hole with the symbol corresponding to the symbol beside the candidate's name. This hole is marked with a Bingo-style ink dauber, which is purposely larger than the hole. The voter then separates the ballot, chooses either the top or the bottom layer to keep as a receipt, and shreds the other layer. The receipt is scanned at the polling station for tabulation.

The order of the symbols beside the candidate names is generated pseudo-randomly for each ballot, and thus differs from ballot to ballot. Likewise for the order of the symbols in the holes. For this reason, the receipt does not contain enough information to determine which candidate the vote was cast for. If the top layer is kept, the order of the symbols through the holes is unknown. If the bottom layer is kept, the order of the symbols beside the candidates name is unknown. Therefore the voter cannot prove to someone else how they voted, which prevents vote buying or voter intimidation.

[edit] Tabulation Procedure

[edit] Working Example

As an example, consider a two candidate election between Coke and Pepsi, as illustrated in the preceding diagram. The order of the letters beside the candidates' names could be A and then B, or B and then A. We will call this ordering $P 1$ , and let $P 1$ =0 for the former ordering and $P 1$ =1 for the latter. Therefore,

$P 1$ : order of symbols beside candidate list,

$P_1=\{0,1\}=\{\mbox{AB},\mbox{BA}\}\,$ .

Likewise we can generalize for other parts of a ballot:

$P 2$ : order of symbols through the holes,

$P_2=\{0,1\}=\{\mbox{AB},\mbox{BA}\}\,$ .

$P 3$ : which hole is marked,

$P_3=\{0,1\}=\{\mbox{1st},\mbox{2nd}\}\,$ .

$R$ : result of the ballot,

$R=\{0,1\}=\{\mbox{Coke},\mbox{Pepsi}\}\,$ .

Note that the order of the candidates' names are fixed across all ballots. The result of a ballot can be calculated directly as,

$R = P_1 + P_2 + P_3\bmod 2\,$ (Equation 1)

However when one layer of the ballot is shredded, either $P 1$ or $P 2$ is destroyed. Therefore there is insufficient information to calculate $R$ from the receipt (which is scanned). In order to calculate the election results, an electronic database is used.

Before the election, the database is created with a series of columns as such. Each row in the database represents a ballot, and the order that the ballots are stored in the database is shuffled (using a cryptographic key that each candidate can contribute to). The first column, $D 1$ , has the shuffled order of the serial numbers. $D 2$ contains a pseudorandom bitstream generated from the key, and it will act as a stream cipher. $D 3$ will store an intermediate result. $D 4$ contains a bit such that:

$D_2 + D_4 = P_1 + P_2 \bmod 2\,$

The result of each ballot will be stored in a separate column, $R$ , where the order of the ballots will be reshuffled again. Thus $D 5$ contains the row number in the $R$ column where the result will be placed.

After the election is run and the $P 3$ values have been scanned in, $D 3$ is calculated as:

$D_3 = P_3 + D_2 \bmod 2\,$

And the result is calculated as,

$R = D_3 + D_4 \bmod 2\,$

This is equivalent to equation 1,

$\begin{align} R &= (D_3) + D_4 \bmod 2\\ &= (P_3 + D_2) + D_4 \bmod 2\\ &= P_3 + (D_2 + D_4) \bmod 2\\ &= P_3 + (P_1 + P_2) \bmod 2 \end{align}$

The result column is published and given the ballots have been shuffled (twice), the order of the results column does not indicate which result is from which ballot number. Thus the election authority cannot trace votes to serial numbers.

[edit] Generalized Form

For an election with $n$ candidates, the above procedure is followed using base-n numbers and modulo-n equations.

[edit] Basic Auditing Procedures

The voter's ballot receipt does not indicate which candidate the voter cast their ballot for, and therefore it is not secret information. After an election, the election authority will post an image of each receipt online. The voter can look up her ballot by typing in the serial number and she can check that information held by the election authority matches her ballot. This way, the voter can be confident that her ballot was cast as intended.

Any voter or interested party can also inspect part of the database to ensure the results were calculated correctly. They cannot inspect the whole database, otherwise they could link votes to ballot serial numbers. However, half of the database can be safely inspected without breaking privacy. A random choice is made between opening ${D 1, D 2, D 3}$ or ${D 3, D 4, D 5}$ (this choice can be derived from the secret key or from a true random source, such as dice^[2] or the stock market^[3]). This procedure allows the voter to be confident that the set of all ballots were counted as cast.

If all ballots are counted as cast and cast as intended, then all ballots are counted as intended. Therefore the integrity of the election can be proven to a very high probability.

[edit] Additional Security

To further increase the integrity of a Punchscan election, several further steps can be taken to protect against a completely corrupt election authority.

[edit] Multiple Databases

Since $D 1$ , $D 2$ , and $D 5$ in the database are all generated pseudorandomly, multiple databases can be created with different random values for these columns. Each database is independent of the others, allowing the first half of some of the databases to be opened and inspected and the second half of others. Each database must produce the same final tally. Thus if an election authority were to tamper with the database to skew the final tally, they would have to tamper with each of the databases. The probability of the tampering being uncovered in the audit increases exponentially with the number of independent databases. With even a modest number of databases, the integrity of the election is probablistically certain.

[edit] Commitments

Prior to an election, the election authority prints the ballots and creates the database(s). Part of this creation process involves committing to the unique information contained on each ballot and in the databases. This accomplished by applying a cryptographic one-way function to the information. Though the result of this function, the commitment, is made public, the actual information being committed to remains sealed. Because the function is one-way, it is computationally infeasible to determine the information on the sealed ballot given only its publically posted commitment.

[edit] Ballot Inspection

Prior to an election, twice as many ballots are produced than the number intended to use in the election. Half of these ballots are selected randomly (or each candidate could choose a fraction of the ballots) and opened. The rows in the database corresponding to these selected ballots can be checked to ensure the calculations are correct and not tampered with. Since the election authority does not know a prori which ballots will be selected, passing this audit means the database is well formed with a very high probability. Furthermore, the ballots can be checked against their commitments to ensure with high probability that the ballot commitments are correct.

[edit] External links

Punchscan home page.
Electronic Democracy — BBC World's Digital Planet audio interview with David Chaum.
Making Every E-vote Count — IEEE Spectrum.
Transparent and Open Voting with Punchscan Part I and Part II — Security Catalyst audio interview with the Punchscan developers.
New voting machine employs cryptography and a bingo dauber — Future Tense audio interview with David Chaum.
A Brief History of Vote-Rigging — Why it is necessary to prove the tally.
Phonecams and the Secret Ballot — Why you must not be able to prove how you voted.

[edit] See also

Stream cipher — Why receipts cannot be deciphered.
Commitment scheme — Why the election authority cannot keep two sets of books.
Zero knowledge proof — How you can tell that the election authority is not cheating without compromising voter privacy.

[edit] References

^ Punchscan School Election System Goes Open Source. IT Business Edge
^ Arel Cordero, David Wagner, and David Dill. The Role of Dice in Election Audits -- Extended Abstract.
^ Jeremy Clark, Aleks Essex, Carlisle Adams. Secure and Observable Auditing of Electronic Voting Systems using Stock Indices.

Retrieved from "http://en.wikipedia.org../../../p/u/n/Punchscan.html"

Categories: Electronic voting | Cryptography