| Reference : On the Possibility of Non-Interactive E-Voting in the Public-key Setting |
| Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
| Engineering, computing & technology : Computer science | |||
| Security, Reliability and Trust | |||
| http://hdl.handle.net/10993/24799 | |||
| On the Possibility of Non-Interactive E-Voting in the Public-key Setting | |
| English | |
| Giustolisi, Rosario [> >] | |
Iovino, Vincenzo  [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >] | |
| Rønne, Peter [> >] | |
| 2016 | |
| Financial Cryptography and Data Security, FC 2016 International Workshops, BITCOIN, VOTING, and WAHC, Christ Church, Barbados, February 26, 2016, Revised Selected Papers | |
| Springer | |
| Lecture Notes in Computer Science 9604 | |
| Yes | |
| No | |
| International | |
| 978-3-662-53356-7 | |
| 1st Workshop on Advances in Secure Electronic Voting | |
| 26-02-2016 | |
| Barbados | |
| [en] e-voting ; bilinear maps ; secure computation ; electronic exams ; conference management systems | |
| [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 | |
| http://hdl.handle.net/10993/24799 | |
| FnR ; FNR7884937 > Vincenzo Iovino > > Cryptography for Cloud Homomorphic Encrypted Secure Systems > 01/12/2014 > 30/11/2016 > 2014 |
| File(s) associated to this reference | ||||||||||||||
|
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.
