<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=Bingo_voting</id>
	<title>Bingo voting - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=Bingo_voting"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Bingo_voting&amp;action=history"/>
	<updated>2026-05-17T00:39:18Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.32.0</generator>
	<entry>
		<id>http://en.zaoniao.it/index.php?title=Bingo_voting&amp;diff=2369&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;'''Bingo voting''' is an electronic voting scheme for transparent, secure, end-to-end auditable elections. It was introduced in 200...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Bingo_voting&amp;diff=2369&amp;oldid=prev"/>
		<updated>2019-03-20T04:25:02Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Bingo voting&amp;#039;&amp;#039;&amp;#039; is an &lt;a href=&quot;/index.php?title=Electronic_voting&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Electronic voting (page does not exist)&quot;&gt;electronic voting&lt;/a&gt; scheme for transparent, secure, &lt;a href=&quot;/index.php?title=End-to-end_auditable_voting_systems&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;End-to-end auditable voting systems (page does not exist)&quot;&gt;end-to-end auditable&lt;/a&gt; elections. It was introduced in 200...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;'''Bingo voting''' is an [[electronic voting]] scheme for transparent, secure, [[End-to-end auditable voting systems|end-to-end auditable]] elections. It was introduced in 2007 by Jens-Matthias Bohli, Jörn Müller-Quade, and Stefan Röhrich at the Institute of Cryptography and Security (IKS) of the [[Karlsruhe Institute of Technology]] (KIT).&lt;br /&gt;
&lt;br /&gt;
Random numbers are used to record votes. Central to the scheme is the use of trusted [[Random number generation|random number generating]] devices in the [[voting booth]]s alongside the [[electronic voting machine]]s. Also crucial are its paper receipts which, while not revealing how a vote was cast, and so inhibiting [[Electoral fraud#Vote buying|vote buying]] and [[Electoral fraud#Intimidation|intimidation]], still allow voters to check that their vote was correctly counted.&lt;br /&gt;
&lt;br /&gt;
The scheme allows the correctness of an election result to be verifiably proved relying only on the integrity of the in-booth random number generators (hence &amp;quot;trusted&amp;quot;); the proof of correctness does not rely on, still less need to prove, the integrity of the [[electronic voting machine]]s themselves.&lt;br /&gt;
&lt;br /&gt;
==Before the poll==&lt;br /&gt;
&lt;br /&gt;
Before the election, a pool of &amp;quot;dummy votes&amp;quot;, random numbers, is generated. As many numbers are generated for each candidate as there are voters. Each dummy vote is encrypted using a cryptographic [[commitment scheme]]—akin to placing the dummy votes in &amp;quot;sealed envelopes.&amp;quot; A list of all commitments (encrypted dummy votes) is then published along with a proof that dummy votes are equally distributed to all candidates.&lt;br /&gt;
&lt;br /&gt;
Additional &amp;quot;candidates&amp;quot; can be defined to support [[protest vote]]s, &amp;quot;[[None of the above]]&amp;quot; votes, etc.&lt;br /&gt;
&lt;br /&gt;
==During the poll==&lt;br /&gt;
&lt;br /&gt;
In the [[voting booth]] a voter chooses his or her preferred candidate by pressing the corresponding [[voting machine]] button. A random number generating device in the booth then generates a fresh random number, displays it, and passes it to the voting machine, which allocates it to the selected candidate. For all other candidates the voting machine randomly selects one of the candidate's dummy votes from the dummy vote pool. A dummy vote is used only once. A ballot, then, consists of a random number for each candidate.&lt;br /&gt;
&lt;br /&gt;
The voting machine issues the voter with a printed receipt listing the candidates and their assigned random numbers. So, before leaving the booth, the voter can check that the vote was correctly recorded by comparing the chosen candidate's number on the receipt with the number displayed by the random number generator.&lt;br /&gt;
&lt;br /&gt;
The receipt does not show how the voter voted because the non-dummy random number issued in the voting booth is indistinguishable from the dummy votes drawn from the pool. The dummy votes in the pool remain hidden (in &amp;quot;unopened&amp;quot; commitments).&lt;br /&gt;
&lt;br /&gt;
==After the poll==&lt;br /&gt;
&lt;br /&gt;
After the polls close all ballots are published in a sorted list (they could be published during the vote, in real-time&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[End-to-end auditable voting systems]]&lt;br /&gt;
*[[Electronic Voting]]&lt;br /&gt;
*[[Punchscan]]&lt;br /&gt;
*[[Scantegrity]]&lt;br /&gt;
*[[ThreeBallot]]&lt;br /&gt;
*[[Farnel]]&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&lt;br /&gt;
==Source==&lt;br /&gt;
&lt;br /&gt;
[http://wikipedia.org/ http://wikipedia.org/]&lt;br /&gt;
[[Category:Cryptography]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>