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: 2015-05-01
Authors : Pankaj Sarde; Amitabh Banerjee;
Page : 2559-2562
Keywords : Group Signature; Bilinear Pairings; ID based Cryptography;
Abstract
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.
Other Latest Articles
- A Review on Speech Corpus Development for Automatic Speech Recognition in Indian Languages
- SAFETY: A Framework for Secure IaaS Clouds
- Review of Some Checkpointing Schemes for Distributed and Mobile Computing Environments
- Cooperative Spatial Decision Support System for Controlling Animal Diseases Outbreaks in Egypt
- ANALYSIS COMPARATIVE OF FINANCIAL PERFORMANCE OF SYARI’AH AND CONVENTIONAL BANKING IN INDONESIA
Last modified: 2015-12-01 14:25:50