ArticleslgStudy

computer science

Punchscan

Punchscan is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Punchscan rather than just read about it. In short: Punchscan is an optical scan vote counting system invented by cryptographer David Chaum. Punchscan is designed to offer integrity, privacy, and transparency.

Punchscan — main illustration
Punchscan — illustration

Key takeaways

  • Punchscan belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Punchscan to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Punchscan from memory before moving on to harder problems.

Reference excerpt

Punchscan is an optical scan vote counting system invented by cryptographer David Chaum. Punchscan is designed to offer integrity, privacy, and transparency. The system is voter-verifiable, provides an end-to-end (E2E) audit mechanism, and issues a ballot receipt to each voter. The system won grand prize at the 2007 University Voting Systems Competition. The computer software which Punchscan incorporates is open-source; the source code was released on 2 November 2006 under a revised BSD licence. However, Punchscan is software independent; it draws its security from cryptographic functions instead of relying on software security like DRE voting machines. For this reason, Punchscan can be run on closed source operating systems, like Microsoft Windows, and still maintain unconditional integrity. The Punchscan team, with additional contributors, has since developed Scantegrity.

Voting procedure

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 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.

Tabulation procedure 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 {\displaystyle P_{1}} , and let P 1 {\displaystyle P_{1}} =0 for the former ordering and P 1 {\displaystyle P_{1}} =1 for the latter. Therefore,

P 1 {\displaystyle P_{1}} : order of symbols beside candidate list,

P 1 ∈ { 0 , 1 } = { AB , BA } {\displaystyle P_{1}\in \{0,1\}=\{{\mbox{AB}},{\mbox{BA}}\}\,} . Likewise we can generalize for other parts of a ballot:

P 2 {\displaystyle P_{2}} : order of symbols through the holes,

P 2 ∈ { 0 , 1 } = { AB , BA } {\displaystyle P_{2}\in \{0,1\}=\{{\mbox{AB}},{\mbox{BA}}\}\,} .

P 3 {\displaystyle P_{3}} : which hole is marked,

P 3 ∈ { 0 , 1 } = { 1st , 2nd } {\displaystyle P_{3}\in \{0,1\}=\{{\mbox{1st}},{\mbox{2nd}}\}\,} .

R {\displaystyle R} : result of the ballot,

R ∈ { 0 , 1 } = { Coke , Pepsi } {\displaystyle R\in \{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,

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Punchscan

Start with the simplest possible case. Write down what Punchscan claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Punchscan before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Punchscan ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Punchscan

In research
Punchscan appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Punchscan in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Punchscan is common in secondary-school and first-year university syllabi. It links to neighbouring topics Applications of cryptography, Electronic voting methods, so understanding it makes those chapters shorter.
In everyday life
Look for Punchscan outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Punchscan in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Punchscan means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Punchscan out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Punchscan in simple terms?

Punchscan is an optical scan vote counting system invented by cryptographer David Chaum. Punchscan is designed to offer integrity, privacy, and transparency.

Why does Punchscan matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Punchscan?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Punchscan.

Tags

  • Applications of cryptography
  • Electronic voting methods

Keep exploring