A New Transitive Signature Scheme

We present a novel design for stateless transitive signature (\(\mathrm {TS}\)) for undirected graph to authenticate dynamically growing graph data. Our construction is built on the widely studied \(\mathrm {ZSS}\) signature technology [19] with bilinear mapping, and using general cryptographic hash functions (e.g., \(\mathrm {SHA}\)-512 and \(\mathrm {MD}6\)). Compared with the existing stateless \(\mathrm {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 \(\mathrm {M2SDH}\) assumption in the random oracle model.

[1]  Brent Waters,et al.  Compact Group Signatures Without Random Oracles , 2006, EUROCRYPT.

[2]  Mahmoud Salmasizadeh,et al.  A Provably Secure Short Transitive Signature Scheme from Bilinear Group Pairs , 2004, SCN.

[3]  Silvio Micali,et al.  Transitive Signature Schemes , 2002, CT-RSA.

[4]  Xiaohui Liang,et al.  Short Group Signature Without Random Oracles , 2007, ICICS.

[5]  Dan Boneh,et al.  Short Signatures Without Random Oracles , 2004, EUROCRYPT.

[6]  Philippe Camacho,et al.  Short Transitive Signatures for Directed Trees , 2012, CT-RSA.

[7]  Reihaneh Safavi-Naini,et al.  An Efficient Signature Scheme from Bilinear Pairings and Its Applications , 2004, Public Key Cryptography.

[8]  Victor K.-W. Wei.  Tight Reductions among Strong Di e-Hellman Assumptions , 2005, IACR Cryptol. ePrint Arch..

[9]  Zhenfu Cao,et al.  Transitive Signatures from Braid Groups , 2007, INDOCRYPT.

[10]  Susan Rae Hohenberger,et al.  The cryptographic impact of groups with infeasible inversion , 2003 .

[11]  Brent Waters,et al.  Full-Domain Subgroup Hiding and Constant-Size Group Signatures , 2007, Public Key Cryptography.

[12]  Gregory Neven.  A simple transitive signature scheme for directed trees , 2008, Theor. Comput. Sci..

[13]  Zheng Huang,et al.  Transitive Signature Scheme from LFSR , 2010 .

[14]  Mihir Bellare,et al.  Transitive signatures: new schemes and proofs , 2005, IEEE Transactions on Information Theory.

[15]  Xun Yi.  Directed Transitive Signature Scheme , 2007, CT-RSA.

[16]  Amit Sahai,et al.  Efficient Non-interactive Proof Systems for Bilinear Groups , 2008, EUROCRYPT.

[17]  Hovav Shacham,et al.  Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.

[18]  Peng Wu,et al.  A New Method for the Design of Stateless Transitive Signature Schemes , 2006, APWeb Workshops.

[19]  Mihir Bellare,et al.  Transitive Signatures Based on Factoring and RSA , 2002, ASIACRYPT.