Jump to content

User:Fh240/sandbox: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Fh240 (talk | contribs)
Replaced content with '{{User sandbox}} <!-- EDIT BELOW THIS LINE -->'
Tag: Replaced
Fh240 (talk | contribs)
No edit summary
Tag: Reverted
Line 1: Line 1:

{{User sandbox}}
{{User sandbox}}
<!-- EDIT BELOW THIS LINE -->
<!-- EDIT BELOW THIS LINE -->

'''Direct Recording Electronic with Integrity and Enforced Privacy''' (DRE-ip) is an [[End-to-end auditable voting systems|End-to-End (E2E) verifiable e-voting]] system without involving any tallying authorities, proposed by Siamak Shahandashti and Feng Hao in 2016.<ref name="DRE-ip">{{cite journal |last1=Shahandashti |first1=Siamak F. |last2=Hao |first2=Feng |title=DRE-ip: A Verifiable E-Voting Scheme Without Tallying Authorities |journal=Computer Security – ESORICS 2016 |date=2016 |volume=9879 |pages=223–240 |doi=10.1007/978-3-319-45741-3_12 |url=https://eprint.iacr.org/2016/670.pdf}}</ref>. A touch-screen based prototype of this system was successfully trialed in the [[Gateshead Civic Centre]] polling station on 2 May 2019 during the [[2019 United Kingdom local elections]]. <ref name="gateshead-trial">{{cite web |last1=Wakefield |first1=Jane |title=E-voting trialled in local elections |url=https://www.bbc.co.uk/news/technology-48132591 |website=BBC News |date=2 May 2019}}</ref>

==Protocol==

The DRE-i protocol can be implemented for either on-site polling station voting or remote Internet voting. In the following specification, the protocol is described for a single-candidate (Yes/No) election held at a polling station using a touch-screen [[DRE_voting_machine|DRE]] machine. There are standard ways to extend a single candidate election to support multiple candidates, e.g., providing a Yes/No selection for each of the candidates or using encoded values for multiple candidates<ref name="DRE-ip" />. The protocol consists of three phases: setup, voting and tallying.

===Setup===

The DRE-ip protocol operates in a multiplicative cyclic group, e.g., a [[Digital Signature Algorithm|DSA]]-like group (the protocol works the same in an additive cyclic group over an elliptic curve, e.g., using an [[Elliptic Curve Digital Signature Algorithm|ECDSA]]-like group). Let <math>p</math> and <math>q</math> be two large primes, where <math display="inline">q\,|\, p-1</math>. <math>G_q</math> is a subgroup of <math>Z_p^*</math> of the prime order <math>q</math>. Let <math>g_1</math> and <math>g_2</math> be two random generators of <math>G_q</math>, whose discrete logarithm relationship is unknow. This can be realized by choosing a non-identity element in <math>G_q</math> as <math>g_1</math> and computing <math>g_2</math> using a one-way hash function with the inclusion of election specific information such as the date, election title and questions as the input. All modulo operations are performed with respect to the modulus <math>p</math>.

===Voting===

After being authenticated at a polling station, a voter obtains an authentication credential, which can be a random passcode or a smartcard. The authentication credential allows the voter to log onto a DRE machine and cast a vote, but the machine does not know the voter's real identity.

A voter casts a vote on a DRE machine in two steps. First, he is presented with "Yes" and "No" options for the displayed candidate on the screen. Once the voter makes a choice on the touch screen, the DRE prints the first part of the receipt, containing <math>i, R_i = g_2^{r_i}, Z_i = g_1^{r_i} g_1^{v_i}</math> where <math>i</math> is a unique ballot index number, <math>r_i</math> is a number chosen uniformly at random from <math>[1, q-1]</math>, and <math>v_i</math> is either 1 or 0 (corresponding to "Yes" and "No" respectively). The cipher text also comes with a [[zero knowledge proof]] to prove that <math>R_i</math> and <math>Z_i</math> are well-formed.

In the second step, the voter has the option to either confirm or cancel the selection. In case of “confirm”, the DRE updates the aggregated values <math>t</math> and <math>s</math> in memory as below, deletes individual values <math>r_i</math> and <math>v_i</math>, and marks the ballot as confirmed on the receipt.

<math>t = \sum v_i, s = \sum r_i</math>.

In case of “cancel”, the DRE reveals <math>r_i</math> and <math>v_i</math> on the receipt, marks it a cancelled ballot and
prompts the voter to choose again. The voter can
check if the printed <math>v_i</math> matches his previous
selection and can dispute it if it does not. The
voter can cancel as many ballots as he wishes but
can only cast one confirmed ballot. Since voting
is anonymous, the machine cannot guess if, after
having printed the first part of the receipt, the
voter is going to choose “confirm” or “cancel”.

After voting, the voter leaves the voting
booth with one receipt for the confirmed ballot
and zero or more receipts for the canceled
ballots. All data printed on the receipts are published on a public election
website with a digital signature to prove the data authenticity. To ensure the vote is recorded, the voter just needs to check if the same receipt has been
published on the election website.


===Tallying===

Once the election has finished, the
DRE publishes the final values <math>t</math> and <math>s</math> on the
election website, in addition to all the receipts. Anyone will be able to verify the tallying integrity by checking the published audit data, in
particular, whether the following two equations hold.

<math>\prod R_i = g_2^s</math> and <math>\prod Z_i = g_1^s g_1^t</math>.

==Implementation and real-world trial==

A touch-screen based prototype of DRE-ip had been implemented and trialed in a polling station in Gateshead on 2 May 2019 during the 2019 United Kindom local elections. <ref name="gateshead-trial" /> As part of the trial, voters were asked to compare their voting experiences of using paper ballots and the new e-voting system, and indicate which system they would prefer. Responses from the participating voters showed a clear preference for the latter as summarized below. <ref>{{cite journal |last1=Hao |first1=Feng |last2=Wang |first2=Shen |last3=Bag |first3=Samiran |last4=Procter |first4=Rob |last5=Shahandashti |first5=Siamak F |last6=Mehrnezhad |first6=Maryam |last7=Toreini |first7=Ehsan |last8=Metere |first8=Roberto |last9=Liu |first9=Lana |title=End-to-End Verifiable E-Voting Trial for Polling Station Voting |journal=IEEE Security & Privacy |date=2020 |pages=0–0 |doi=10.1109/MSEC.2020.3002728 |url=https://eprint.iacr.org/2020/650.pdf}}</ref>



==References==

Revision as of 14:44, 6 August 2020

Direct Recording Electronic with Integrity and Enforced Privacy (DRE-ip) is an End-to-End (E2E) verifiable e-voting system without involving any tallying authorities, proposed by Siamak Shahandashti and Feng Hao in 2016.[1]. A touch-screen based prototype of this system was successfully trialed in the Gateshead Civic Centre polling station on 2 May 2019 during the 2019 United Kingdom local elections. [2]

Protocol

The DRE-i protocol can be implemented for either on-site polling station voting or remote Internet voting. In the following specification, the protocol is described for a single-candidate (Yes/No) election held at a polling station using a touch-screen DRE machine. There are standard ways to extend a single candidate election to support multiple candidates, e.g., providing a Yes/No selection for each of the candidates or using encoded values for multiple candidates[1]. The protocol consists of three phases: setup, voting and tallying.

Setup

The DRE-ip protocol operates in a multiplicative cyclic group, e.g., a DSA-like group (the protocol works the same in an additive cyclic group over an elliptic curve, e.g., using an ECDSA-like group). Let and be two large primes, where . is a subgroup of of the prime order . Let and be two random generators of , whose discrete logarithm relationship is unknow. This can be realized by choosing a non-identity element in as and computing using a one-way hash function with the inclusion of election specific information such as the date, election title and questions as the input. All modulo operations are performed with respect to the modulus .

Voting

After being authenticated at a polling station, a voter obtains an authentication credential, which can be a random passcode or a smartcard. The authentication credential allows the voter to log onto a DRE machine and cast a vote, but the machine does not know the voter's real identity.

A voter casts a vote on a DRE machine in two steps. First, he is presented with "Yes" and "No" options for the displayed candidate on the screen. Once the voter makes a choice on the touch screen, the DRE prints the first part of the receipt, containing where is a unique ballot index number, is a number chosen uniformly at random from , and is either 1 or 0 (corresponding to "Yes" and "No" respectively). The cipher text also comes with a zero knowledge proof to prove that and are well-formed.

In the second step, the voter has the option to either confirm or cancel the selection. In case of “confirm”, the DRE updates the aggregated values and in memory as below, deletes individual values and , and marks the ballot as confirmed on the receipt.

.

In case of “cancel”, the DRE reveals and on the receipt, marks it a cancelled ballot and prompts the voter to choose again. The voter can check if the printed matches his previous selection and can dispute it if it does not. The voter can cancel as many ballots as he wishes but can only cast one confirmed ballot. Since voting is anonymous, the machine cannot guess if, after having printed the first part of the receipt, the voter is going to choose “confirm” or “cancel”.

After voting, the voter leaves the voting booth with one receipt for the confirmed ballot and zero or more receipts for the canceled ballots. All data printed on the receipts are published on a public election website with a digital signature to prove the data authenticity. To ensure the vote is recorded, the voter just needs to check if the same receipt has been published on the election website.


Tallying

Once the election has finished, the DRE publishes the final values and on the election website, in addition to all the receipts. Anyone will be able to verify the tallying integrity by checking the published audit data, in particular, whether the following two equations hold.

and .

Implementation and real-world trial

A touch-screen based prototype of DRE-ip had been implemented and trialed in a polling station in Gateshead on 2 May 2019 during the 2019 United Kindom local elections. [2] As part of the trial, voters were asked to compare their voting experiences of using paper ballots and the new e-voting system, and indicate which system they would prefer. Responses from the participating voters showed a clear preference for the latter as summarized below. [3]


References

  1. ^ a b Shahandashti, Siamak F.; Hao, Feng (2016). "DRE-ip: A Verifiable E-Voting Scheme Without Tallying Authorities" (PDF). Computer Security – ESORICS 2016. 9879: 223–240. doi:10.1007/978-3-319-45741-3_12.
  2. ^ a b Wakefield, Jane (2 May 2019). "E-voting trialled in local elections". BBC News.
  3. ^ Hao, Feng; Wang, Shen; Bag, Samiran; Procter, Rob; Shahandashti, Siamak F; Mehrnezhad, Maryam; Toreini, Ehsan; Metere, Roberto; Liu, Lana (2020). "End-to-End Verifiable E-Voting Trial for Polling Station Voting" (PDF). IEEE Security & Privacy: 0–0. doi:10.1109/MSEC.2020.3002728.