CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Public Verifiable Identity based Multi-Proxy Multi-Signcryption Scheme from Bilinear Pairings

by Tej Singh, Rashid Ali
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 137 - Number 10
Year of Publication: 2016
Authors: Tej Singh, Rashid Ali
10.5120/ijca2016908887

Tej Singh, Rashid Ali . Public Verifiable Identity based Multi-Proxy Multi-Signcryption Scheme from Bilinear Pairings. International Journal of Computer Applications. 137, 10 ( March 2016), 37-41. DOI=10.5120/ijca2016908887

@article{ 10.5120/ijca2016908887,
author = { Tej Singh, Rashid Ali },
title = { Public Verifiable Identity based Multi-Proxy Multi-Signcryption Scheme from Bilinear Pairings },
journal = { International Journal of Computer Applications },
issue_date = { March 2016 },
volume = { 137 },
number = { 10 },
month = { March },
year = { 2016 },
issn = { 0975-8887 },
pages = { 37-41 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume137/number10/24312-2016908887/ },
doi = { 10.5120/ijca2016908887 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:38:01.639779+05:30
%A Tej Singh
%A Rashid Ali
%T Public Verifiable Identity based Multi-Proxy Multi-Signcryption Scheme from Bilinear Pairings
%J International Journal of Computer Applications
%@ 0975-8887
%V 137
%N 10
%P 37-41
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper presents public verifiable identity based multi-proxy multi- signcryption scheme from pairings. In this scheme a proxy signcrypter group could authorized as a proxy agent by the cooperation of all members in the original signcrypter group. Then the proxy signcryption can be generated by the cooperation of all the signcrypters in the authorized proxy signcrypter group on the behalf of the original signcrypter group. As compared to the scheme Liu and Xiao, the proposed scheme provides public verifiability of the signature along with simplified key management.

References
  1. M. Mambo, K. Usuda and E. Okamoto, “Proxy signature: delegation of the power to sign messages,” IEICE Trans. Fundamentals, E79-A:9, 1996, pp. 1338-1353.
  2. S.J. Hwang, C.H. Shi, “A simple Multi-Proxy Signature Scheme,” Proceeding of the Tenth National Conference on Information Security, Taiwan, 2000, pp. 134-138.
  3. S.J. Hwang, C.C. Chen, “A New Multi-Proxy Multi-Signature Scheme,” 2001 National Computer Symposium: Information Security, Taipei, Taiwan, 2001, pp. F019-F026.
  4. J.G. Li, Z.F. Cao, Y.C. Zhang, “Improvement of M-U-O and K-P-W proxy signature schemes,” Journal of Harbin Institute of Technology, Harbin, pp. 145-148, Feb.2002.
  5. J.G. Li, Z.F. Cao, Y.C. Zhang, “Nonrepudiable proxy multi-signature schemes,” Journal of Computer Science and Technology, Vol. 18, pp. 399- 402, Mar.2003.
  6. J.G. Li, Z.F. Cao, “Improvement of a Threshold proxy signature scheme,” Improvement of Computer Research and Development, Vol. 39, pp. 515-518, Nov.2002.
  7. X.X. Li and K.H. Chen, “Multi-proxy Signature and Proxy Multi- signature Scheme from bilinear pairing,” LNCS #3320, Springer-Verlag, Singapore, pp. 591-595, Dec.2004.
  8. Q.S. Xue, Z.F. Cao, “A Nonrepudiable Multi-proxy Multi-signature Scheme,” in Mobile Future, 2004 and the Symposium on Trends in Communications. Sympo TIC’04, pp. 102-105. Oct. 2004.
  9. Y. Zheng, “Digital signcryption or how to achieve cost (signature & encryption) < cost (signature) + cost (encryption),” in CRYPTO’97, LNCS #1924, Springer-Verlag, pp. 165-179, 1997.
  10. Steinfeld and Y. Zheng, “A Signcryption Scheme based on Integer factorization,” in The Third Information Security Workshop (ISW 2000), LNCS #1975, pp. 308-322, Springer-Verlag, 2000.
  11. J. Malone-Lee and W. Mao, “Two birds one stone: Signcryption using RSA,” in Topics in Cryptology-CT-RSA 2003, LNCS #2612, pp. 211-225, Springer-Verlag, 2003.
  12. A. Shamir, “How to share a secret,” Communications of the ACM, vol. 24, no.11, pp. 612-613, 1979.
  13. J. Malone-Lee, “Identity based Signcryption,” Cryptology ePrint Archive, Report 2002/098, 2002. Available from:
  14. http://eprint.iacr.org/2002/098.
  15. B. Libert and J. Quisquater, “A new Identity Based Signcryption Scheme from Pairings,” in 2003 IEEE Information Theory Workshop, pp. 155-158, Paris, France, 2003.
  16. J.B. Liu and G.Z. Xiao, “Multi-Proxy Multi-Signcryption Scheme from Pairings,” in 2005 available atarxiv.org/abs/cs.CR/0509030..
Index Terms

Computer Science
Information Sciences

Keywords

Bilinear pairings Identity-based cryptography ID based Signcryption multi signature proxy signature.

Powered by PhDFocusTM