Skip to main content
SpringerLink
Log in

Analysis and Design of Protocol for Enhanced Threshold Proxy Signature Scheme Based on RSA for Known Signers

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Many threshold proxy signature schemes are proposed in which the t out of n threshold schemes are deployed; but they still lack the property of security. In this research paper, secret sharing proxy signature could permit the shares of designated signers, called proxy signers, renew their own proxy shares periodically without changing the secret. In particular, our scheme applies the (t, n) threshold proxy signature scheme and allows any t or more then t signers to form a designated group from n proxy signers to sign messages on behalf of the original signer. In the proposed scheme, furthermore, a proxy signer can recover his/her own share from t other proxy shares without revealing any information about other proxy shares. Unless more than t other proxy signers cooperate and collude, the secret share algorithm is always secure. We compare the performance of four schemes: Hwang et al., Wen et al., Geng et al. and Fengying et al. with the performance of a scheme that has been proposed by the authors of this article earlier. In the proposed scheme, both the combiner and the secret share holder can verify the correctness of the information that they are receiving from each other. Therefore, the enhanced threshold proxy signature scheme is secure and efficient against notorious conspiracy attacks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29
Fig. 30
Fig. 31
Fig. 32
Fig. 33
Fig. 34
Fig. 35
Fig. 36
Fig. 37
Fig. 38

Similar content being viewed by others

References

  1. Agrawal, M., Kayal, N., & Saxena, N. (2004). PRIMES in P. Annals of Mathematics, 160(2), 781–793.

    Article  MATH  MathSciNet  Google Scholar 

  2. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Section 31.8: Primality testing, introduction to algorithms (2nd ed., pp. 889–890). MIT Press, McGraw-Hill. ISBN 0-262-03293-7.

  3. Desmedt, Y., & Frankel, Y. (1989). Threshold cryptosystems. In Proceedings of the advances in cryptology (Crypto ’89) (pp. 307–315).

  4. Desmedt, Y., & Frankel, Y. (1991). Shared generation of authenticators and signatures (extended abstract). In Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology (pp. 457–469).

  5. ElGamal, T. (1985). A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions of Information Theory, 31(4), 469–472.

    Article  MATH  MathSciNet  Google Scholar 

  6. Fengying, L., Qingshui, X., & Zhenfu, C. (2007). Crypanalysis of Kuo and Chen’s threshold proxy signature scheme based on the RSA. In Proceedings of the international conference on information technology (ITNG’07) (pp. 815–818).

  7. Geng, Y.-J., Hui, T., & Fan, H. (2007). A modified and practical threshold proxy signature scheme based on RSA. In Proceedings of the ICACT (ICACT ’07) (pp. 1958–1960).

  8. Hwang, M.-S., Lee, C.-C., & Hwang, S.-J. (2002). Cryptanalysis of the Hwang-Shi proxy signature scheme. Fundamenta Informaticae, 53(2), 131–134.

    MATH  MathSciNet  Google Scholar 

  9. Hwang, M.-S., Lin, I.-C., & Lu, E. J.-L. (2000). A secure nonrepudiable threshold proxy signature scheme with known signers. Informatica, 11(2), 137–144.

    MATH  Google Scholar 

  10. Hwang, M.-S., Lu, E. J.-L., & Lin, I.-C., (2003). A practical (t, n) threshold proxy signature scheme based on the RSA cryptosystem. IEEE Transactions on Knowledge and Data Engineering, 15(6), 1552–1560.

  11. Hwang, M.-S., Tzeng, S.-F., & Chiou, S.-F. (2009). A non-repudiable multi-proxy multi-signature scheme. Innovative Computing, Information and Control Express Letters, 3(3), 259–264.

    Google Scholar 

  12. Hwang, M.-S., Tzeng, S.-F., & Tsai, C.-S. (2004). Generalization of proxy signature based on elliptic curves. Computer Standards & Interfaces, 26(2), 73–84.

    Article  Google Scholar 

  13. Jiang, X., Wang, X., & Xu, D. (2007). Stealthy malware detection through VMM-based ‘out-of-the-box’ semantic view reconstruction. In Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS 2007), Alexandria, VA, November 2007.

  14. Katzenbeisser, S. (2001). Recent advances in RSA cryptography. Berlin: Springer.

    Book  MATH  Google Scholar 

  15. Kim, S., Park, S., & Won, D. (1997). Proxy signatures, revisited. In Prceedings of the ICICS (ICICS’97), LNCS (Vol. 1334, pp. 223–232). Berlin: Springer.

  16. Kong, F., Yu, J., Qin, B., & Li, D. (2007). Cryptanalysis of server-aided RSA key generation protocols at MADNES 2005. Autonomic and Trusted Computing (pp. 52–60). Berlin: Springer.

    Chapter  Google Scholar 

  17. Kumar, R., Verma, H. K., & Dhir, R. (2012). Security analysis and performance evaluation of enhanced threshold proxy signature scheme based on RSA for known signers. International Journal of Computer Network and Information Security, IJCNIS, Hong Kong, 4(9), 63–76.

    Article  MATH  Google Scholar 

  18. Kumar, R., Verma, H. K., & Dhir, R. (2013). Cryptanalysis and performance evaluation of enhanced threshold proxy signature scheme based on RSA for known signers. Mathematical Problems in Engineering, 2013, 24 pp, Article ID 790257. doi:10.1155/2013/790257.

  19. Kuo, W.-C., & Chen, M.-Y. (2005). A modified (t, n) threshold proxy signature scheme based on the RSA cryptosystem. In Proceedings of the third international conference on information technology and applications (ICITA’05) (pp. 576–579).

  20. Lee, N. Y., Hwang, T., & Wang, C. H. (1998). On Zang’s nonrepudiable proxy signature schemes. In Prceedings of the ACISP’98, LNCS (pp. 415–422).

  21. Lee, N. Y., Hwang, T., Wang, C. H., & Zhang, O. (1998). Nonrepudiable proxy signature schemes. In Proceedings of Australasian conference on information security and privacy (ACISP ‘98) (pp. 415–422).

  22. Lee, B., Kim, H., & Kim, K. (2001). Secure mobile agent using strong non-designated proxy signature. In Proceedings of ACISP, LNCS (Vol. 2119, pp. 474–486). Springer.

  23. Lee, C.-C., Lin, T.-C., Tzeng, S.-F., & Hwang, M.-S. (2011). Generalization of proxy signature based on factorization. International Journal of Innovative Computing, Information and Control, 7(3), 1039–1054.

    Google Scholar 

  24. Li, C.-T. (2008). Multimedia foresics and security (1st ed., pp. 73–74). IGI Global. ISBN 978-1-59904-869-7.

  25. Li, L.-H., Tzeng, S.-F., & Hwang, M.-S. (2003). Generalization of proxy signature based on discrete logarithms. Computers & Security, 22(3), 245–255.

    Article  Google Scholar 

  26. Lu, E. J.-L., Hwang, M.-S., & Huang, C.-J. (2005). A new proxy signature scheme with revocation. Applied Mathematics and Computation, 161(3), 799–806.

    Article  MATH  MathSciNet  Google Scholar 

  27. Mambo, M., Usuda, K., & Okamoto, E. (1996). Proxy signature delegation of the power to sign message. IEICE Transactions on Fundamentals, E-79A(9), 1338–1353.

  28. Mambo, M., Usuda, K., & Okamoto, E. (1996). Proxy signatures for delegating signing operation. In Proceeding of third ACM conference of computer and communications security (pp. 48–57).

  29. Okamoto, T., Mitsuru, T., & Okamoto, E. (1999). Extended proxy signature for smart cards, LNCS. Berlin: Springer.

    Google Scholar 

  30. Rivest, R. L., Shamir, A., & Adleman, L. M. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120–126.

    Article  MATH  MathSciNet  Google Scholar 

  31. Shamir, A. (1979). How to share a secret. Communications of the ACM, 22(11), 612–613. doi:10.1145/359168.359176.

  32. Sun, H.-M. (1999). An efficient nonrepudiable threshold proxy signature scheme with known signers. Computer Communications, 22(8), 717–722.

    Article  Google Scholar 

  33. Sun, H.-M. (2000). An efficient remote use authentication scheme using smart cards. Consumer Electronics, IEEE Transactions on, 46(4), 958–961. doi:10.1109/30.920446.

  34. Sun, H.-M., Lee, N.-Y., & Hwang, T. (1999). Threshold proxy signatures. IEEE Proceedings of Computers and Digital Techniques, 146(5), 259–263.

    Article  Google Scholar 

  35. Tsai, C.-S., Tzeng, S.-F., & Hwang, M.-S. (2003). Improved non-repudiable threshold proxy signature scheme with known signers. Informatica, 14(3), 393–402.

    MATH  MathSciNet  Google Scholar 

  36. Tzeng, S.-F., Hwang, M.-S., & Yang, C.-Y. (2004). An improvement of nonrepudiable threshold proxy signature scheme with known signers. Computers & Security, 23(2), 174–178.

    Article  Google Scholar 

  37. Tzeng, S.-F., Lee, C.-C., & Hwang, M.-S. (2011). A batch verification for multiple proxy signature. Parallel Processing Letters, 21(1), 77–84.

    Article  MATH  MathSciNet  Google Scholar 

  38. Tzeng, S.-F., Yang, C.-Y., & Hwang, M.-S. (2004). A nonrepudiable threshold multi-proxy multi-signature scheme with shared verification. Future Generation Computer Systems, 20(5), 887–893.

    Article  Google Scholar 

  39. Wang, G., Bao, F., Zhou, J., & Deng, R. H. (2004). Comments on a practical (t, n) threshold proxy signature scheme based on the RSA cryptosystem. IEEE Transactions on Knowledge and Data Engineering, 16(10), 1309–1311.

    Article  Google Scholar 

  40. Yang, C.-Y., Tzeng, S.-F., & Hwang, M.-S. (2004). On the efficiency of nonrepudiable threshold proxy signature scheme with known signers. The Journal of Systems and Software, 73(3), 507–514.

    Article  Google Scholar 

  41. Yen, S. M., Hung, C. P., & Lee, Y. Y. (2000). Remarks on some proxy signature schemes. In Proceedings of the 2000 International Computer Symposium, Workshop on Cryptography and Information Security, December 6–8 2000.

  42. Zhang, K. (1997). Threshold proxy signature schemes. In Proceedings of information security workshop (pp. 191–197).

Download references

Acknowledgments

The authors also wish to thank many anonymous referees for their suggestions to improve this paper.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Dr B R Ambedkar National Institute of Technology, Jalandhar, Punjab, India

    Raman Kumar, Harsh Kumar Verma & Renu Dhir

Authors
  1. Raman Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Harsh Kumar Verma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Renu Dhir
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raman Kumar.

Appendices

Appendix I

See Table 15.

Table 15 Histogram Analysis for overall threshold proxy signature schemes
Full size table

Appendix II

See Table 16.

Table 16 Results of Friedman test for various threshold proxy signature schemes
Full size table

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kumar, R., Verma, H.K. & Dhir, R. Analysis and Design of Protocol for Enhanced Threshold Proxy Signature Scheme Based on RSA for Known Signers. Wireless Pers Commun 80, 1281–1345 (2015). https://doi.org/10.1007/s11277-014-2087-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-014-2087-2

Keywords

Search

Navigation