Name
Abstract | ||
|---|---|---|
Remote electronic voting has attracted increasing attention in cryptographic research. A promising protocol presented by Juels et al. is currently widely discussed. Although it offers a remarkably high degree of coercion-resistance under reasonable assumptions, it can not be employed in practice due to its poor efficiency. The improvements that have been proposed either require stronger trust assumptions or turned out to be insecure. In this paper, we present an enhancement of the protocol, which runs in linear time without changing the underlying trust assumptions. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-27576-0_15 | Financial Cryptography |
Keywords | Field | DocType |
poor efficiency,high degree,coercion-resistant remote e-voting,reasonable assumption,remote electronic voting,underlying trust assumption,promising protocol,linear time,new approach,cryptographic research,stronger trust assumption | Electronic voting,Voting,Cryptography,Computer science,Computer security,ElGamal encryption,Time complexity | Conference |
Volume | ISSN | Citations |
7035 | 0302-9743 | 27 |
PageRank | References | Authors |
0.80 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oliver Spycher | 1 | 68 | 4.99 |
| Reto E. Koenig | 2 | 83 | 8.38 |
| Rolf Haenni | 3 | 371 | 33.39 |
| Michael Schläpfer | 4 | 53 | 3.16 |