[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Designing efficient proxy signature schemes for mobile communication

  • Published:
Science in China Series F: Information Sciences Aims and scope Submit manuscript

Abstract

Proxy signature is an active cryptographic research area, and a wide range of literatures can be found nowadays suggesting improvement and generalization of existing protocols in various directions. However, from the efficiency view, many proposed proxy signature schemes in these literatures are not satisfying and cannot fit to the mobile communication. Therefore, there is a desire to design efficient proxy signature schemes. Based on Boneh et al.’s pairing-based short signature, this paper presents two proxy signature schemes. One is proxy-protected signature scheme, and the other is proxy aggregate signature scheme. Since both of them can achieve high efficiency, it is believed that they are specially suitable for mobile communication environment.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Mambo M, Usuda K, Okamoto E. Proxy signatures: delegation of the power to sign message. IEICE Trans Funct, 1996, E79-A(9): 1338–1354

    Google Scholar 

  2. Mambo M, Usuda K, Okamoto E. Proxy signatures for delegation signing operation. In: Proc. Third ACM Conference on Computer and Communication Security, New Delhi, India, January 1996. 48–57

  3. Sun H M. An efficient nonrepudiable threshold proxy signature scheme with known signers. Compu Commu, 1999, 22(8): 717–722

    Article  Google Scholar 

  4. Sun H M, Lee N Y, Hwang T. Threshold proxy signatures. IEE Proc Compu Dig Tech, 1999, 146(5): 259–263

    Article  Google Scholar 

  5. Yi L, Bai G, Xiao G. Proxy multi-signature scheme: A new type of proxy signature scheme. Electr Lett, 2000, 36(6): 527–528

    Article  Google Scholar 

  6. Hwang S J, Chen C C. A new proxy multi-signature scheme. In: International Workshop on Cryptology and Network Security, Taipei, December 2000. 134–138

  7. Hsu C L, Wu T S, Wu T C. New nonrepudiable threshold proxy signature scheme with known signers. J Syst Software, 2001, 58(2): 119–124

    Article  MathSciNet  Google Scholar 

  8. Shao Z. Proxy signature schemes based on factoring. Inf Proc Lett, 2003, 85(3): 137–143

    Article  MATH  Google Scholar 

  9. Lu R, Cao Z, Zhou Y. Proxy blind multi-signature scheme without a secure channel. Appl Math Comput, 2005, 164(1): 179–187

    Article  MATH  MathSciNet  Google Scholar 

  10. Lu R, Cao Z, Zhu H. A robust (k, n) + 1 threshold proxy signature scheme based on factoring. Appl Math Comput, 2005, 166(1): 35–45

    Article  MATH  MathSciNet  Google Scholar 

  11. Zhang F, Safavi-Naini R, Susilo W. An efficient signature scheme from bilinear pairings and its applications. In: Lecture Notes in Computer Science, Vol. 2947. Berlin: Springer-Verlag, 2004. 277–290

    Google Scholar 

  12. Boneh D, Lynn B, Shacham H. Short signature from the Weil pairing. In: Lecture Notes in Computer Science, Vol. 2248. Berlin: Springer-Verlag, 2001. 514–532

    Google Scholar 

  13. Boneh D, Franklin M. Identity-based encryption from the Weil pairing. In: Lecture Notes in Computer Science, Vol. 2139. Berlin: Springer-Verlag, 2001. 213–229

    Google Scholar 

  14. Bellare M, Rogaway P. Random oracles are practical: a paradigm for designing efficient protocols. In: Proc. First ACM Conference on Computer and Communication Security, Fairfax, Virginia, USA, 1993. 62–73

  15. Boneh D, Gentry C, Lynn B, et al. Aggregrate and verfiably encrypted signatures from bilinear maps. In: Lecture Notes in Computer Science, Vol. 2656. Berlin: Springer-Verlag, 2003. 416–432

    Google Scholar 

  16. Schnorr CP. Efficient identification and signatures for smart cards. In: Lecture Notes in Computer Science, Vol. 435. Berlin: Springer-Verlag, 1990. 235–251

    Google Scholar 

  17. Pointcheval D, Stern J. Security proofs for signature schemes. In: Lecture Notes in Computer Science, Vol. 1070. Berlin: Springer-Verlag, 1996. 387–398

    Google Scholar 

  18. Yi X. Identity-based fault-tolerant conference key agreement. IEEE Trans Depend Secure Comput, 2004, 1(3): 170–178

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, 200030, China

    Lu RongXing, Dong XiaoLei & Cao ZhenFu

Authors
  1. Lu RongXing
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dong XiaoLei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cao ZhenFu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cao ZhenFu.

Additional information

Supported by the National Natural Science Foundation of China (Grant Nos. 60572155 and 60673079), the National High Technology Development Program of China (Grant No. 2006AA01Z424), and the National Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20060248008)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lu, R., Dong, X. & Cao, Z. Designing efficient proxy signature schemes for mobile communication. Sci. China Ser. F-Inf. Sci. 51, 183–195 (2008). https://doi.org/10.1007/s11432-008-0017-1

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-008-0017-1

Keywords

Search

Navigation