Loading...

A provably secure short transitive signature scheme from bilinear group Pairs

Shahandashti, S. F ; Sharif University of Technology | 2005

145 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-30598-9_5
  3. Publisher: Springer Verlag , 2005
  4. Abstract:
  5. We present a realization of the transitive signature scheme based on the algebraic properties of bilinear group pairs. The scheme is proven secure, i.e. transitively unforgeable under adaptive chosen message attack, assuming hardness of the computational co-Diffie-Hellman problem in bilinear group pairs and the security of the underlying standard signature scheme under known message attack. Our scheme mostly conforms to previously designed schemes of Micali-Rivest and Bellare-Neven in structure; yet there are two contributions: firstly, we take advantage of bilinear group pairs which were previously used by Boneh, Lynn, and Shacham to build short signature schemes. Secondly, we show that a slight modification in previous definitions of the transitive signature relaxes the security requirement for the underlying standard signature from being secure under chosen message attack to being secure under known message attack; thus shorter and more efficient signatures can be chosen for the underlying standard signature. These two facts eventually yield to short transitive signatures with respect to both node and edge signature size. © Springer-Verlag Berlin Heidelberg 2005
  6. Keywords:
  7. Algebra ; Electronic document identification systems ; Modification ; Problem solving ; Bilinear group pairs ; Diffie-Hellman problem ; Message attack ; Transitive signature scheme ; Security of data
  8. Source: 4th International Conference on Security in Communication Networks, SCN 2004, Amalfi, 8 September 2004 through 10 September 2004 ; Volume 3352 , 2005 , Pages 60-76 ; 03029743 (ISSN)
  9. URL: https://link.springer.com/chapter/10.1007/978-3-540-30598-9_5