Efficient Cleansing in Coercion-Resistant Voting

Rosario  Giustolisi; Maryam Sheikhi Garjan

doi:10.1007/978-3-031-72244-8_5

Efficient Cleansing in Coercion-Resistant Voting

Rosario Giustolisi
, Maryam Sheikhi Garjan

Brandenburg University of Technology

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

Abstract

Coercion resistance is a strong security property of electronic voting that prevents adversaries from forcing voters to vote in a specific way by using threats or rewards. There exist clever techniques aimed at preventing voter coercion based on fake credentials, but they are either inefficient or cannot support features such as revoting without leaking more information than necessary to coercers. One of the reasons is that invalid ballots cast due to revoting or coercion need to be removed before the tallying. In this paper, we propose a coercion-resistant Internet voting scheme that does not require the removal of invalid ballots, hence avoids the leakage of information, but still supports revoting. The scheme is very efficient and achieves linear tallying.

Original language	English
Title of host publication	Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics
Number of pages	17
Place of Publication	Cham
Publisher	Springer Nature Switzerland
Publication date	2024
Pages	72-88
ISBN (Print)	9783031722431
DOIs	https://doi.org/10.1007/978-3-031-72244-8_5
Publication status	Published - 2024
Event	Electronic Voting - Spain, Tarragona, Spain Duration: 2 Oct 2024 → 4 Oct 2024 Conference number: 9 https://e-vote-id.org/e-vote-id-2024/

Conference

Conference	Electronic Voting
Number	9
Location	Spain
Country/Territory	Spain
City	Tarragona
Period	02/10/2024 → 04/10/2024
Internet address	https://e-vote-id.org/e-vote-id-2024/

Series	Lecture Notes in Computer Science
Volume	15014
ISSN	0302-9743

Keywords

Coercion resistance
Internet voting
Revoting
End-to-end verifiability
Efficient tallying

Access to Document

10.1007/978-3-031-72244-8_5Licence: CC BY

Cite this

@inproceedings{cd32da0c1acb43c1b64ef06ac23f595e,

title = "Efficient Cleansing in Coercion-Resistant Voting",

abstract = "Coercion resistance is a strong security property of electronic voting that prevents adversaries from forcing voters to vote in a specific way by using threats or rewards. There exist clever techniques aimed at preventing voter coercion based on fake credentials, but they are either inefficient or cannot support features such as revoting without leaking more information than necessary to coercers. One of the reasons is that invalid ballots cast due to revoting or coercion need to be removed before the tallying. In this paper, we propose a coercion-resistant Internet voting scheme that does not require the removal of invalid ballots, hence avoids the leakage of information, but still supports revoting. The scheme is very efficient and achieves linear tallying.",

keywords = "Coercion resistance, Internet voting, Revoting, End-to-end verifiability, Efficient tallying",

author = "Rosario Giustolisi and Garjan, \{Maryam Sheikhi\}",

year = "2024",

doi = "10.1007/978-3-031-72244-8\_5",

language = "English",

isbn = "9783031722431",

series = "Lecture Notes in Computer Science",

publisher = "Springer Nature Switzerland",

pages = "72--88",

booktitle = "Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics",

note = "Electronic Voting, E-Vote-ID 2024 ; Conference date: 02-10-2024 Through 04-10-2024",

url = "https://e-vote-id.org/e-vote-id-2024/",

}

Giustolisi, R & Garjan, MS 2024, Efficient Cleansing in Coercion-Resistant Voting. in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. Springer Nature Switzerland, Cham, Lecture Notes in Computer Science, vol. 15014, pp. 72-88, Electronic Voting, Tarragona, Spain, 02/10/2024. https://doi.org/10.1007/978-3-031-72244-8_5

Efficient Cleansing in Coercion-Resistant Voting. / Giustolisi, Rosario ; Garjan, Maryam Sheikhi.
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. Cham: Springer Nature Switzerland, 2024. p. 72-88 (Lecture Notes in Computer Science, Vol. 15014).

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

TY - GEN

T1 - Efficient Cleansing in Coercion-Resistant Voting

AU - Giustolisi, Rosario

AU - Garjan, Maryam Sheikhi

N1 - Conference code: 9

PY - 2024

Y1 - 2024

N2 - Coercion resistance is a strong security property of electronic voting that prevents adversaries from forcing voters to vote in a specific way by using threats or rewards. There exist clever techniques aimed at preventing voter coercion based on fake credentials, but they are either inefficient or cannot support features such as revoting without leaking more information than necessary to coercers. One of the reasons is that invalid ballots cast due to revoting or coercion need to be removed before the tallying. In this paper, we propose a coercion-resistant Internet voting scheme that does not require the removal of invalid ballots, hence avoids the leakage of information, but still supports revoting. The scheme is very efficient and achieves linear tallying.

AB - Coercion resistance is a strong security property of electronic voting that prevents adversaries from forcing voters to vote in a specific way by using threats or rewards. There exist clever techniques aimed at preventing voter coercion based on fake credentials, but they are either inefficient or cannot support features such as revoting without leaking more information than necessary to coercers. One of the reasons is that invalid ballots cast due to revoting or coercion need to be removed before the tallying. In this paper, we propose a coercion-resistant Internet voting scheme that does not require the removal of invalid ballots, hence avoids the leakage of information, but still supports revoting. The scheme is very efficient and achieves linear tallying.

KW - Coercion resistance

KW - Internet voting

KW - Revoting

KW - End-to-end verifiability

KW - Efficient tallying

UR - https://www.scopus.com/pages/publications/85206107465

UR - https://www.mendeley.com/catalogue/d6366449-9549-34b3-bf3b-3082f916e796/

U2 - 10.1007/978-3-031-72244-8_5

DO - 10.1007/978-3-031-72244-8_5

M3 - Article in proceedings

SN - 9783031722431

T3 - Lecture Notes in Computer Science

SP - 72

EP - 88

BT - Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

PB - Springer Nature Switzerland

CY - Cham

T2 - Electronic Voting

Y2 - 2 October 2024 through 4 October 2024

ER -