Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On the Possibility of Non-Interactive E-Voting in the Public-key Setting
RISE, Swedish ICT, SICS, Security Lab.
University of Luxembourg, Luxembourg.
Inria, France; University of Luxembourg, Luxembourg.
2016 (English)In: Financial Cryptography and Data Security: FC 2016 International Workshops / [ed] Jeremy Clark, Sarah Meiklejohn, Peter Y.A. Ryan, Dan Wallach, Michael Brenner, Kurt Rohloff, Springer Berlin/Heidelberg, 2016, 23, Vol. 9604, p. 193-208Conference paper, Published paper (Refereed)
Abstract [en]

In 2010 Hao, Ryan and Zielinski proposed a simple decentralized e-voting protocol that only requires 2 rounds of communication. Thus, for k elections their protocol needs 2k rounds of communication. Observing that the first round of their protocol is aimed to establish the public-keys of the voters, we propose an extension of the protocol as a non-interactive e-voting scheme in the public-key setting (NIVS) in which the voters, after having published their public-keys, can use the corresponding secret-keys to participate in an arbitrary number of one-round elections.

We first construct a NIVS with a standard tally function where the number of votes for each candidate is counted.

Further, we present constructions for two alternative types of elections. Specifically in the first type (dead or alive elections) the tally shows if at least one voter cast a vote for the candidate. In the second one (elections by unanimity), the tally shows if all voters cast a vote for the candidate.

Our constructions are based on bilinear groups of prime order.

As definitional contribution we provide formal computational definitions for privacy and verifiability of NIVSs. We conclude by showing intriguing relations between our results, secure computation, electronic exams and conference management systems.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2016, 23. Vol. 9604, p. 193-208
Series
Lecture Notes in Computer Science (LNCS), ISSN 0302-9743 ; 9604
Keywords [en]
e-voting, bilinear maps, secure computation, electronic exams, conference management systems
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-24562DOI: 10.1007/978-3-662-53357-4_13ISBN: 978-3-662-53356-7 (print)ISBN: 978-3-662-53357-4 (electronic)OAI: oai:DiVA.org:ri-24562DiVA, id: diva2:1043647
Conference
20th International Conference on Financial Cryptography and DataSecurity (FC 2016), February 22-26, 2016, Christ Church, Barbados
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2019-07-10Bibliographically approved

Open Access in DiVA

fulltext(426 kB)27 downloads
File information
File name FULLTEXT01.pdfFile size 426 kBChecksum SHA-512
606dd9778e190c05fe5623a4ba1737c5437e13be5255ea1aa0fe07c6050d5a8b24846a461347e0b3ab376cb38b0b23f3e6d69c0ceab0c796971ab056b867ce89
Type fulltextMimetype application/pdf

Other links

Publisher's full text
By organisation
Security Lab
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 27 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 66 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.35.7