ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

An Efficient and Secure ID Based Group Signature Scheme from Bilinear Pairings

Journal: International Journal of Advanced Networking and Applications (Vol.6, No. 06)

Publication Date:

Authors : ; ;

Page : 2559-2562

Keywords : Group Signature; Bilinear Pairings; ID based Cryptography;

Source : Downloadexternal Find it from : Google Scholarexternal


We propose an efficient and secure identity based group signature scheme from bilinear pairings. Group signature allows group member to sign arbitrary number of messages on behalf of the group without revealing their identity. Under certain circumstances the group manger holding a tracing key can reveal the identities of the signer from the signature. Our scheme is based on the Computation Diffie-Hellman Problem (CDHP) assumption and bilinear pairings. In the scheme, the size of the group public key and length of the signature are independent on the numbers of the group members.

Last modified: 2015-12-01 14:25:50