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 article in proceedingsScientificpeer-review

6 Citations (Scopus)

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

Conference

ConferenceInternational Conference on Network and System Security
Abbreviated titleNSS
Country/TerritoryTaiwan, Republic of China
CityTaipei
Period28/09/201630/09/2016

Keywords

  • 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