An efficient generalized group-oriented signature scheme

International Journal of Innovative Computing, Information and Control

Volumn 4, Issue 6, 2008, Pages 1335-1345

  Chen, Chih Ying ^a   Lin, Hsiu Feng ^a   Chang, Chin Chen ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Generalized group oriented signature; Group oriented signature; Threshold signature; Universal modulus

Indexed keywords

EID: 48249090019     PISSN: 13494198     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. D. Boneh and M. Ranklin, Efficient generation of shared RSA keys, Journal of the ACM, vol.48, no.4, pp.702-722, 2001.
2. C. C. Chang and H. C. Lee, A new generalized group-oriented cryptoscheme without truster center, IEEE Journal on Selected Area in Communications, vol.11, no.5, pp.725-729, 1993.
3. C. Y. Chen and H. F. Lin, The design of a distributed RSA weakly undeniable blind multisignature using universal modulus, NSA TR-03-10-05, Dept. of CE, University of Feng Chia, Taiwan, 2003.
4. Y. Chen and X. Chen, Efficient and robust two-party RSA key generation, Wuhan University Journal of Natural Sciences, no.6, 2006.
5. Y. Desmedt and Y. Frankel, Shared generation of authenticators and signatures, Crypto'91, pp.457-469, 1991.
6. Y. Frankel, A practical protocol for large group-oriented networks, Eurocrypt'89, pp.56-61, 1989.
7. Y. Frankel and Y. Desmedt, Parallel Reliable Threshold Multisignature, TR-92-04-02, Dept. of EE and CS, U of Wisconsin, 1992.
8. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, Robust and efficient sharing of RSA functions, Crypto'96, pp.157-172, 1996.
9. N. Gilboa, Two Party RSA Key Generation, LNCS 1666, Springer-Verlag, pp.116-129, 1999.
10. J. Gordan, Strong RSA key, Electronics Letters, vol.20, pp.514-516, 1984.
11. L. Harn and S. Yang, Group-oriented undeniable signature schemes without the assistance of a mutually trusted party, Auscrypt'92, pp.133-142, 1992.
12. L. Harn, Group-oriented (t, n) threshold digital signature scheme and digital multisignature, IEE Proceedings Computers Digital Techniques, vol.141, no.5 pp.307-313, Sep.1994.
13. M. He, P. Fan and X. Zhang, K-party shared RSA key generation, Journal of Electronics (China), no.1, 2001.
14. C. L. Hsu, T. S. Wu and T. C. Wu, Group-oriented signature scheme with distinguished signing authorities, Future Generation Computer Systems, vol.20, no.5, pp.865-873, 2004.
15. F.Huang, Y. Feng and X. Yu, A symmetric image encryption scheme based on a simple novel two-dimensional map, Int. J. of Innovative Computing, Information and Control, vol.3, no.6(B), pp.1593-1602, 2007.
16. C. S. Laih, W. C. Yang and C. H. Chen, Efficient method for generating strong primes with constraint of bit length, Electronics Letters, vol.27, no.20, pp.1807-1808, 1991.
17. N. Y. Lee and T. Hwang, Group-oriented undeniable signature schemes with a trusted center, Proc. of the 8th National Conference on Information Security, Kaohsiung, Taiwan, pp.234-243, 1998.
18. G. Poupard and J. Stern, Generation of Shared RSA Keys by Two Parties, LNCS 1514, Springer-Verlag, pp.11-24, 1998.
19. T. Rabin, A simplified approach to threshold and proactive RSA, Crypto'98, pp.89-104, 1998.
20. R. L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public key cryptosystem, CACM, vol.21, no.2, pp.120-126, 1978.
21. K. H. Rosen, Elementary Number Theory and Its Applications, Second Edition, Addison-Wesley Publishing Company, pp.299-342, 1987.
22. A. D. Santis, Y. Desmedt, Y. Frankel and M. Yung, How to share a function securely, Proc. of the 26th Annual Symp. on the Theory of Computing, pp.522-533, 1994.
23. J. Zhang, J. Zou and Y. Yang, A group-Oriented anonymous signature scheme with subliminal channel, networking, Sensing and Control, 2005 Proceedings, pp.49-53, 2005.