Comparing "challenge-based" and "code-based" internet voting verification implementations

Oksana Kulyk, Jan Henzel, Karen Renaud, Melanie Volkamer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Downloads (Pure)

Abstract

Internet-enabled voting introduces an element of invisibility and unfamiliarity into the voting process, which makes it very different from traditional voting. Voters might be concerned about their vote being recorded correctly and included in the final tally. To mitigate mistrust, many Internet-enabled voting systems build verifiability into their systems. This allows voters to verify that their votes have been cast as intended, stored as cast and tallied as stored at the conclusion of the voting period. Verification implementations have not been universally successful, mostly due to voter difficulties using them. Here, we evaluate two cast as intended verification approaches in a lab study: (1) "Challenge-Based" and (2) "Code-Based". We assessed cast-as-intended vote verification efficacy, and identified usability issues related to verifying and/or vote casting. We also explored acceptance issues post-verification, to see whether our participants were willing to engage with Internet voting in a real election. Our study revealed the superiority of the code-based approach, in terms of ability to verify effectively. In terms of real-life Internet voting acceptance, convenience encourages acceptance, while security concerns and complexity might lead to rejection.
Original languageEnglish
Title of host publicationHuman-Computer Interaction- INTERACT 2019
Subtitle of host publication17th IFIP TC 13 International Conference Paphos, Cyprus, September 2-6, 2019 Proceedings
EditorsDavid Lamas, Fernando Loizides, Lennart Nacke, Helen Petrie, Marco Winckle, Panayiotis Zaphiri
PublisherSpringer
VolumePart 1
ISBN (Electronic)9783030293819
ISBN (Print)9783030293802
DOIs
Publication statusE-pub ahead of print - 23 Aug 2019
EventINTERACT 2019 17th IFIP TC: 13 International Conference on Human Computer Interaction - Paphos, Greece
Duration: 2 Sep 20196 Sep 2019
https://interact2019.org/

Publication series

NameLecture Notes in Computer Science
PublisherSpringer, Cham
Volume11746
ISSN (Print)0302-9743

Conference

ConferenceINTERACT 2019 17th IFIP TC
Abbreviated titleINTERACT 2019
CountryGreece
CityPaphos
Period2/09/196/09/19
Internet address

Fingerprint

voting
Internet
voter
acceptance
election
ability

Cite this

Kulyk, O., Henzel, J., Renaud, K., & Volkamer, M. (2019). Comparing "challenge-based" and "code-based" internet voting verification implementations. In D. Lamas, F. Loizides, L. Nacke, H. Petrie, M. Winckle, & P. Zaphiri (Eds.), Human-Computer Interaction- INTERACT 2019: 17th IFIP TC 13 International Conference Paphos, Cyprus, September 2-6, 2019 Proceedings (Vol. Part 1). (Lecture Notes in Computer Science; Vol. 11746). Springer. https://doi.org/10.1007/978-3-030-29381-9_32
Kulyk, Oksana ; Henzel, Jan ; Renaud, Karen ; Volkamer, Melanie . / Comparing "challenge-based" and "code-based" internet voting verification implementations. Human-Computer Interaction- INTERACT 2019: 17th IFIP TC 13 International Conference Paphos, Cyprus, September 2-6, 2019 Proceedings. editor / David Lamas ; Fernando Loizides ; Lennart Nacke ; Helen Petrie ; Marco Winckle ; Panayiotis Zaphiri. Vol. Part 1 Springer, 2019. (Lecture Notes in Computer Science).
@inproceedings{4b74457ccc6f4ba9afe77ae74771a96b,
title = "Comparing {"}challenge-based{"} and {"}code-based{"} internet voting verification implementations",
abstract = "Internet-enabled voting introduces an element of invisibility and unfamiliarity into the voting process, which makes it very different from traditional voting. Voters might be concerned about their vote being recorded correctly and included in the final tally. To mitigate mistrust, many Internet-enabled voting systems build verifiability into their systems. This allows voters to verify that their votes have been cast as intended, stored as cast and tallied as stored at the conclusion of the voting period. Verification implementations have not been universally successful, mostly due to voter difficulties using them. Here, we evaluate two cast as intended verification approaches in a lab study: (1) {"}Challenge-Based{"} and (2) {"}Code-Based{"}. We assessed cast-as-intended vote verification efficacy, and identified usability issues related to verifying and/or vote casting. We also explored acceptance issues post-verification, to see whether our participants were willing to engage with Internet voting in a real election. Our study revealed the superiority of the code-based approach, in terms of ability to verify effectively. In terms of real-life Internet voting acceptance, convenience encourages acceptance, while security concerns and complexity might lead to rejection.",
author = "Oksana Kulyk and Jan Henzel and Karen Renaud and Melanie Volkamer",
year = "2019",
month = "8",
day = "23",
doi = "10.1007/978-3-030-29381-9_32",
language = "English",
isbn = "9783030293802",
volume = "Part 1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
editor = "David Lamas and Loizides, {Fernando } and Nacke, {Lennart } and Petrie, {Helen } and Winckle, {Marco } and { Zaphiri}, {Panayiotis }",
booktitle = "Human-Computer Interaction- INTERACT 2019",

}

Kulyk, O, Henzel, J, Renaud, K & Volkamer, M 2019, Comparing "challenge-based" and "code-based" internet voting verification implementations. in D Lamas, F Loizides, L Nacke, H Petrie, M Winckle & P Zaphiri (eds), Human-Computer Interaction- INTERACT 2019: 17th IFIP TC 13 International Conference Paphos, Cyprus, September 2-6, 2019 Proceedings. vol. Part 1, Lecture Notes in Computer Science, vol. 11746, Springer, INTERACT 2019 17th IFIP TC, Paphos, Greece, 2/09/19. https://doi.org/10.1007/978-3-030-29381-9_32

Comparing "challenge-based" and "code-based" internet voting verification implementations. / Kulyk, Oksana; Henzel, Jan; Renaud, Karen; Volkamer, Melanie .

Human-Computer Interaction- INTERACT 2019: 17th IFIP TC 13 International Conference Paphos, Cyprus, September 2-6, 2019 Proceedings. ed. / David Lamas; Fernando Loizides; Lennart Nacke; Helen Petrie; Marco Winckle; Panayiotis Zaphiri. Vol. Part 1 Springer, 2019. (Lecture Notes in Computer Science; Vol. 11746).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Comparing "challenge-based" and "code-based" internet voting verification implementations

AU - Kulyk, Oksana

AU - Henzel, Jan

AU - Renaud, Karen

AU - Volkamer, Melanie

PY - 2019/8/23

Y1 - 2019/8/23

N2 - Internet-enabled voting introduces an element of invisibility and unfamiliarity into the voting process, which makes it very different from traditional voting. Voters might be concerned about their vote being recorded correctly and included in the final tally. To mitigate mistrust, many Internet-enabled voting systems build verifiability into their systems. This allows voters to verify that their votes have been cast as intended, stored as cast and tallied as stored at the conclusion of the voting period. Verification implementations have not been universally successful, mostly due to voter difficulties using them. Here, we evaluate two cast as intended verification approaches in a lab study: (1) "Challenge-Based" and (2) "Code-Based". We assessed cast-as-intended vote verification efficacy, and identified usability issues related to verifying and/or vote casting. We also explored acceptance issues post-verification, to see whether our participants were willing to engage with Internet voting in a real election. Our study revealed the superiority of the code-based approach, in terms of ability to verify effectively. In terms of real-life Internet voting acceptance, convenience encourages acceptance, while security concerns and complexity might lead to rejection.

AB - Internet-enabled voting introduces an element of invisibility and unfamiliarity into the voting process, which makes it very different from traditional voting. Voters might be concerned about their vote being recorded correctly and included in the final tally. To mitigate mistrust, many Internet-enabled voting systems build verifiability into their systems. This allows voters to verify that their votes have been cast as intended, stored as cast and tallied as stored at the conclusion of the voting period. Verification implementations have not been universally successful, mostly due to voter difficulties using them. Here, we evaluate two cast as intended verification approaches in a lab study: (1) "Challenge-Based" and (2) "Code-Based". We assessed cast-as-intended vote verification efficacy, and identified usability issues related to verifying and/or vote casting. We also explored acceptance issues post-verification, to see whether our participants were willing to engage with Internet voting in a real election. Our study revealed the superiority of the code-based approach, in terms of ability to verify effectively. In terms of real-life Internet voting acceptance, convenience encourages acceptance, while security concerns and complexity might lead to rejection.

U2 - 10.1007/978-3-030-29381-9_32

DO - 10.1007/978-3-030-29381-9_32

M3 - Conference contribution

SN - 9783030293802

VL - Part 1

T3 - Lecture Notes in Computer Science

BT - Human-Computer Interaction- INTERACT 2019

A2 - Lamas, David

A2 - Loizides, Fernando

A2 - Nacke, Lennart

A2 - Petrie, Helen

A2 - Winckle, Marco

A2 - Zaphiri, Panayiotis

PB - Springer

ER -

Kulyk O, Henzel J, Renaud K, Volkamer M. Comparing "challenge-based" and "code-based" internet voting verification implementations. In Lamas D, Loizides F, Nacke L, Petrie H, Winckle M, Zaphiri P, editors, Human-Computer Interaction- INTERACT 2019: 17th IFIP TC 13 International Conference Paphos, Cyprus, September 2-6, 2019 Proceedings. Vol. Part 1. Springer. 2019. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-030-29381-9_32