Name
Abstract | ||
|---|---|---|
We present the first linkable ring signature scheme with both unconditional anonymity and forward-secure key update: a powerful tool which has direct applications in elegantly addressing a number of simultaneous constraints in remote electronic voting. We propose a comprehensive security model, and construct a scheme based on the hardness of finding discrete logarithms, and (for forward security) inverting bilinear or multilinear maps of moderate degree to match the time granularity of forward security. We prove efficient security reductions which, of independent interest, apply to, and are much tighter than, linkable ring signatures without forward security, thereby vastly improving the provable security of these legacy schemes. If efficient multilinear maps should ever admit a secure realisation, our contribution would elegantly address a number of problems heretofore unsolved in the important application of (multi-election) practical internet voting. Even if multilinear maps never obtain, our minimal two-epoch construction instantiated from bilinear maps can be combinatorially boosted to synthesize a polynomial time granularity, which would be sufficient for internet voting and more. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-319-93638-3_15 | INFORMATION SECURITY AND PRIVACY |
Keywords | Field | DocType |
Linkable ring signature, Bilinear map, Multilinear map, Electronic voting, Forward security, Unconditional anonymity | Bilinear map,Electronic voting,Computer science,Ring signature,Theoretical computer science,Forward secrecy,Anonymity,Multilinear map,Computer security model,Provable security,Distributed computing | Conference |
Volume | ISSN | Citations |
10946 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 13 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xavier Boyen | 1 | 9 | 3.53 |
| Thomas Haines | 2 | 5 | 10.26 |