A new transitive signature scheme

Chao Lin, Fei Zhu, Wei Wu*, Kaitai Liang, Kim Kwang Raymond Choo

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

2 Citations (Scopus)


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 languageEnglish
Title of host publicationNetwork and System Security - 10th International Conference, NSS 2016, Proceedings
PublisherSpringer Verlag
Number of pages12
Volume9955 LNCS
ISBN (Print)9783319462974
Publication statusPublished - 2016
MoE publication typeA4 Article in a conference publication
EventInternational Conference on Network and System Security - Taipei, Taiwan, Republic of China
Duration: 28 Sep 201630 Sep 2016
Conference number: 10

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9955 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349


ConferenceInternational Conference on Network and System Security
Abbreviated titleNSS
CountryTaiwan, Republic of China


  • M2SDH
  • Transitive signature
  • Transitively unforgeability

Fingerprint Dive into the research topics of 'A new transitive signature scheme'. Together they form a unique fingerprint.

Cite this