The week's pick
Random Articles
Reseach Article
Discrete Logarithm based (t, n) Threshold Group Signature Scheme
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 21 - Number 2 |
| Year of Publication: 2011 |
| Authors: Ganesh Mante, Dr.S.D.Joshi |
10.5120/2483-3343
|
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
Abstract
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.
References
- .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
- 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.
- 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.
- J.Camenisch and A.Lysyanskaya, A signature scheme with efficient protocols, In SCN’02, LNCS 2576, 2002, pp. 268-289.
- D.Boneh, X.Boyen, and H.Shacham, Short group signatures, In Advances in Cryptology-Crypto’04, LNCS 3152, 2004, pp. 41- 55.
- D.Boneh and H.Shacham, Group signatures with verifier-local revocation, In Proc. of the 11th ACM Conference on Computer and Communications Security (CCS 2004) , 2004, pp. 168-177.
- 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.
- 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.
- 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.
- 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.
- L.Harn,”Group-oriented (t,n) threshold digital signature scheme and digital Multisignature”, IEEE Proceedings-Computers and Digital Techniques, Vol.141, No.5, 1994.
- C.M.Li,T.Hwang and N.Y.Lee, ”Remark on the threshold RSA signature scheme”, Advances in Cryptology-Proceedings of CRYPTO ’93,LNCS,Vol.773,Springer-Verlag,1993.
- D.Chaum and E.van Heyst, Group signature, In advances in Cryptology-Eurocrypt, 1992, pp. 390-407.
Index Terms
Keywords