IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 7    
Website: http://www.ijser.org
scirp IJSER >> Volume 2, Issue 7, July 2011 Edition
A Modified (t, n) Threshold Group Signature Generation and (k, m) Threshold Group Signature Verification Scheme
Full Text(PDF, 3000)  PP.  
Ganesh Mante,Prof.Dr.S.D.Joshi
Discrete logarithm, Group Signature, Galois Field, Polynomial, Signers, Threshold, Verifiers
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.
[1] J.V.Merve, D.S.Dawoud and S.McDonald,”A fully Distributed Proactively Secure Threshold –MultiSignature Scheme”, IEEE Transactions on Parallel and Distributed Systems, Vol.18,No.4 ,2007

[2] F.Li,J.Yu and H.Ju, ”A new threshold Group Signature scheme based on discrete logarithm problem”, IEEE Eight ACIS International conference on software engineering, artificial intelligence ,Networking and Parallel Distributed computing ,2007.

[3] Y.F.Chung.C.H.Liu, F.Lai and T.S.Chen, ”Threshold signature scheme resistible for conspiracy attack”, IEEE Proceedings of the Seventh International Conference on Parallel and distributed Computing, Applications and Technologies,2006.

[4] J.Camenisch and A.Lysyanskaya, A signature scheme with efficient protocols, In SCN’02, LNCS 2576, 2002, pp. 268-289.

[5] D.Boneh, X.Boyen, and H.Shacham, Short group signatures, In Advances in Cryptology-Crypto’04, LNCS 3152, 2004, pp. 41- 55.

[6] D.Boneh and H.Shacham, Group signatures with verifierlocal revocation, In Proc. of the 11th ACM Conference on Computer and Communications Security (CCS 2004) , 2004, pp. 168-177.

[7] J.Camenisch and J.Groth, Group signatures: Better efficiency and new theoretical aspects, In Security in Communication Networks (SCN 2004), LNCS 3352, 2005, pp. 120-133.

[8] J.K.Jan, Y.M.Tseng,and H.Y.Chien, ”A threshold signature scheme withstanding the conspiracy attack”, Communications of Institute of Information and Computing Machinery,Vol.2,No.3,1999.

[9] C.T.Wang, C.H.Lin and C.C.Chang, ”Threshold signature schemes with traceable signers in group communications”, Elsevier ,Computer Communications,Vol 21 ,No.8,1998.

[10] C.M.Li, T.Hwang and N.Y.Lee,”Threshold multisignature schemes where suspected forgery implies traceability of adversarial shareholders”, Advances in Cryptology-Proceedings of EUROCRYPT ’94, LNCS, Vol.950, Springer –Verlag, 1995.

[11] L.Harn,”Group-oriented (t,n) threshold digital signature scheme and digital Multisignature”, IEEE Proceedings-Computers and Digital Techniques, Vol.141, No.5, 1994.

Untitled Page