Skip to search boxSkip to navigationSkip to main content

Efficient Cleansing in Coercion-Resistant Voting

  • Brandenburg University of Technology
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-review

Open access

Publication Information

Output type

Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-review

Original language

English

Pages from-to (Number of pages)

Pages 72-88 (17 pages)

Publication milestones

  • Published - 2024

Publication status

Published - 2024

Place of publication

Cham

Publisher

Springer Nature Switzerland

Book series

  • Book series name: Lecture Notes in Computer Science
    Volume: 15014
    ISSN: 0302-9743
9783031722431

Publication IDs

  • ORCID: /0000-0002-2917-9601/work/195874387
  • Scopus: 85206107465

Host publication title

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

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.

Publication metrics

PlumX, opens in new tab

Citations
4
Captures
3

Related Event

Title

Electronic Voting

Event type

Conference

Degree of recognition

International event

Date

02/10/2024 - 04/10/2024

Location

SpainTarragonaSpain