Abstract
We present a novel design for stateless transitive signature (TS) for undirected graph to authenticate dynamically growing graph data. Our construction is built on the widely studied ZSS signature technology [19] with bilinear mapping and using general cryptographic hash functions (e.g. SHA-512 and MD6). Compared with the existing stateless TS schemes for undirected graph in the literature our scheme is more efficient. The scheme is also proven transitively unforgeable against adaptive chosen-message attack under the M2SDH assumption in the random oracle model.
Original language | English |
---|---|
Title of host publication | Network and System Security - 10th International Conference, NSS 2016, Proceedings |
Publisher | Springer |
Pages | 156-167 |
Number of pages | 12 |
Volume | 9955 LNCS |
ISBN (Print) | 9783319462974 |
DOIs | |
Publication status | Published - 2016 |
MoE publication type | A4 Conference publication |
Event | International Conference on Network and System Security - Taipei, Taiwan, Republic of China Duration: 28 Sept 2016 → 30 Sept 2016 Conference number: 10 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 9955 LNCS |
ISSN (Print) | 03029743 |
ISSN (Electronic) | 16113349 |
Conference
Conference | International Conference on Network and System Security |
---|---|
Abbreviated title | NSS |
Country/Territory | Taiwan, Republic of China |
City | Taipei |
Period | 28/09/2016 → 30/09/2016 |
Keywords
- M2SDH
- Transitive signature
- Transitively unforgeability