International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 21 - Issue 2 |
Published: May 2011 |
Authors: Ganesh Mante, Dr.S.D.Joshi |
![]() |
Ganesh Mante, Dr.S.D.Joshi . Discrete Logarithm based (t, n) Threshold Group Signature Scheme. International Journal of Computer Applications. 21, 2 (May 2011), 23-27. DOI=10.5120/2483-3343
@article{ 10.5120/2483-3343, author = { Ganesh Mante,Dr.S.D.Joshi }, title = { Discrete Logarithm based (t, n) Threshold Group Signature Scheme }, journal = { International Journal of Computer Applications }, year = { 2011 }, volume = { 21 }, number = { 2 }, pages = { 23-27 }, doi = { 10.5120/2483-3343 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2011 %A Ganesh Mante %A Dr.S.D.Joshi %T Discrete Logarithm based (t, n) Threshold Group Signature Scheme%T %J International Journal of Computer Applications %V 21 %N 2 %P 23-27 %R 10.5120/2483-3343 %I Foundation of Computer Science (FCS), NY, USA
Globalization of the Internet has boosted electronic information exchange on both the personal and business levels. There is a need of the authentication of messages sent by a group of individuals to another group. A (t, n) threshold group signature scheme is a method for allowing a member of a group to anonymously sign a message on behalf of the group. The idea of threshold cryptography is to protect information by distributing it among a cooperating member. Following some ideas of the classical threshold signature scheme, a (t, n) threshold group signature scheme and (k, m) threshold group signature verification scheme based on discrete logarithm problem is proposed. The group signature is generated by at least t group members and is verified by at least k members in the group. Only one group public key is required. Each group member separately signs the message. The scheme is highly secure and resists the conspiracy attack.