ArticleslgStudy

computer science

Prêt à Voter

Prêt à Voter 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 Prêt à Voter rather than just read about it. In short: Prêt à Voter is an E2E voting system devised by Peter Ryan of the University of Luxembourg. It aims to provide guarantees of accuracy of the count and ballot privacy that are independent of software, hardware etc.

Key takeaways

  • Prêt à Voter 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 Prêt à Voter to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Prêt à Voter from memory before moving on to harder problems.

Reference excerpt

Prêt à Voter is an E2E voting system devised by Peter Ryan of the University of Luxembourg. It aims to provide guarantees of accuracy of the count and ballot privacy that are independent of software, hardware etc. Assurance of accuracy flows from maximal transparency of the process, consistent with maintaining ballot privacy. In particular, Prêt à Voter enables voters to confirm that their vote is accurately included in the count whilst avoiding dangers of coercion or vote buying.

The key idea behind the Prêt à Voter approach is to encode the vote using a randomized candidate list. The randomisation of the candidate list on each ballot form ensures the secrecy of each vote. Incidentally, it also removes any bias towards the top candidate that can occur with a fixed ordering. The value printed on the bottom of the receipt is the key to extraction of the vote. Buried cryptographically in this value is the information needed to reconstruct the candidate order and so extract the vote encoded on the receipt. This information is encrypted with secret keys shared across a number of tellers. Thus, only the set of tellers acting together are able to interpret the vote encoded on the receipt. No individual agent or machine involved in the election should ever be able to tie a particular voter to a particular decrypted vote. After the election, voters (or perhaps proxies acting on their behalf) can visit the Web Bulletin Board (WBB) and confirm their receipts appear correctly. Once this is over, the tellers take over and perform anonymising mixes and decryption of the receipts. All the intermediate stages of this process are posted to the WBB and are audited later. There are various auditing mechanisms to ensure that all the steps, the creation of the ballot forms, the mixing and decryption and so on were all performed correctly, but these are carefully designed so as not to impinge on ballot privacy.

Example Suppose that our voter is called Anne. At the polling station, Anne chooses, at random, a ballot form sealed in an envelope. An example of such a form is shown below:

In the booth, Anne extracts her ballot form from the envelope and makes her selection in the usual way by placing a cross in the right-hand column against the candidate of choice (or, in the case of a Single Transferable Vote (STV) system for example, she marks her ranking against the candidates). For example, a vote for Asterix is given by:

Once her selection has been made, she separates the left and right hand strips along a perforation and discards the left hand strip. She is left with the right hand strip which now constitutes her privacy protected receipt, as shown in Table 3.

Anne now exits the booth clutching her receipt, registers with an official, and casts her receipt. Her receipt is placed over an optical reader or similar device that records the random value at the bottom of the strip and records in which cell her "X" is marked. Her original paper receipt is digitally signed and franked, and returned to her to keep. Note that because the candidate list is removed before scanning, the machine that reads the ballot paper never learns the content of the vote. This prevents (intentional or unintentional) violation of vote privacy by the scanning equipment.

Origin Prêt à Voter was inspired by the earlier, voter-verifiable scheme by David Chaum. It replaces the visual cryptographic encoding the voter's choice in Chaum's scheme by the conceptually and technologically simpler candidate randomization. The Prêt à Voter idea of encoding the vote through permutations has subsequently been incorporated in Chaum's Punchscan scheme. However Punchscan uses a permutation of indirection symbols instead of candidate names allowing it to comply with voting laws that require a specific ordering of candidates. The first implementation of Prêt à Voter, by a team led by the University of Surrey, won Best Design, and overall second place at the 2007 University Voting Systems Competition, after the winning team, Punchscan, uncovered a security flaw in the random number generator portion of the Prêt à Voter source code

.

Past development An EPSRC-funded project, Trustworthy Voting Systems, ran from April 2009 to April 2014, and aimed to enhance the design of Prêt à Voter in various ways, to build a full prototype implementation, and to produce mathematical proofs of the claimed security properties of Prêt à Voter. The project was run by James Heather and Steve Schneider at the University of Surrey, and Mark Ryan at the University of Birmingham; it was a close collaboration with the FNR-funded SerTVS project run by Peter Ryan at the University of Luxembourg.

Current development There appears to have been no development since 2014. Their domains have expired as of 2015.

Security Analysis There were a few different studies done, mostly concluding that the system was secure and "remarkably robust", despite a few possible attack vectors.

References

External links An accessible account of Prêt à Voter can be found in "The Computer Ate my Vote", chapter to appear in Formal Methods: State of the Art and New Directions, Ed. Paul Boca, Springer 2007, also available as Newcastle University Technical Report 988 [1]. Further technical details can be found in Newcastle University Technical Reports 864, 880, 929, 956 and 965, and on the Prêt à Voter web site .

Worked examples

Example 1 — a first encounter with Prêt à Voter

Start with the simplest possible case. Write down what Prêt à Voter 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 Prêt à Voter 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 Prêt à Voter 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 Prêt à Voter

In research
Prêt à Voter 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 Prêt à Voter 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
Prêt à Voter is common in secondary-school and first-year university syllabi. It links to neighbouring topics Applications of cryptography, Election technology, so understanding it makes those chapters shorter.
In everyday life
Look for Prêt à Voter 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.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Prêt à Voter” →

Affiliate

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

How to study Prêt à Voter in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Prêt à Voter 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 Prêt à Voter out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Prêt à Voter in simple terms?

Prêt à Voter is an E2E voting system devised by Peter Ryan of the University of Luxembourg. It aims to provide guarantees of accuracy of the count and ballot privacy that are independent of software, hardware etc.

Why does Prêt à Voter 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 Prêt à Voter?

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 Prêt à Voter.

Tags

  • Applications of cryptography
  • Election technology

Keep exploring