Nothing Special   »   [go: up one dir, main page]

Skip to main content

A Revocable Certificateless Signature Scheme Without Pairing

  • Conference paper
  • First Online:
Cloud Computing and Security (ICCCS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10039))

Included in the following conference series:

Abstract

In a public key cryptosystem, an important problem is how to revoke a user. As we know, the certificateless public key cryptography (CLPKC) unites the qualities of the traditional public key system and the identity-based public key system. It is free of complicated certificate management and key escrow. However, there are few solutions to the revocation problem in CLPKC. In this paper, we present an efficient revocable certificateless signature scheme. Moreover, this new scheme is free of bilinear pairing. Under the assumption of Discrete Logarithm problem, our scheme is provably secure.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Al-Riyami, S.S.: Cryptographic schemes based on elliptic curve pairings. Ph.D. thesis, Royal Holloway, University of London (2004)

    Google Scholar 

  2. Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 452–473. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Boldyreva, A., Goyal, V., Kumar, V.: Identity-based encryption with efficient revocation. In: Proceedings of CCS 2008, pp. 417–426. ACM (2008)

    Google Scholar 

  5. Fu, Z., Ren, K., Shu, J., Sun, X., Huang, F.: Enabling Personalized Search over Encrypted Outsourced Data with Efficiency Improvement. IEEE Trans. Parallel Distrib. Syst. (2015). doi:10.1109/TPDS.2015.2506573

    Google Scholar 

  6. Bin, G., Sheng, V.S., Tay, K.Y., Romano, W., Li, S.: Incremental support vector learning for ordinal regression. IEEE Trans. Neural Netw. Learn. Syst. 26(7), 1403–1416 (2015)

    Article  MathSciNet  Google Scholar 

  7. Libert, B., Vergnaud, D.: Adaptive-ID secure revocable identity-based encryption. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 1–15. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Micali, S.: Novomodo: scalable certificate validation and simplified PKI management. In: Proceedings of 1st Annual PKI Research Workshop, pp. 15–25 (2002)

    Google Scholar 

  9. Myers, M., Ankney, R., Alpani, A., Galperin, S., Adams, C.: X.509 Internet public key infrastructure: online certificate status protocol (OCSP). RFC 2560

    Google Scholar 

  10. Seo, J.H., Emura, K.: Revocable identity-based encryption revisited: security model and construction. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 216–234. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  11. Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  12. Sun, Y., Zhang, F., Shen, L.: Efficient revocable certificateless encryption secure against decryption key exposure. IET Inf. Secur. 9(3), 158–166 (2015)

    Article  Google Scholar 

  13. Tseng, Y.M., Tasi, T.T.: Efficient revocable ID-based encryption with a public channel. Comput. J. 55(4), 475–486 (2012)

    Article  Google Scholar 

  14. Xia, Z., Wang, X., Sun, X., Wang, Q.: A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans. Parallel Distrib. Syst. 27(2), 340–352 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgement

This work is supported by the Nature Science Foundation of China [No. 61502237], NSF of Jiangsu Province [No. BK20130908].

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yinxia Sun .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Sun, Y., Zhang, Z., Shen, L. (2016). A Revocable Certificateless Signature Scheme Without Pairing. In: Sun, X., Liu, A., Chao, HC., Bertino, E. (eds) Cloud Computing and Security. ICCCS 2016. Lecture Notes in Computer Science(), vol 10039. Springer, Cham. https://doi.org/10.1007/978-3-319-48671-0_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48671-0_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48670-3

  • Online ISBN: 978-3-319-48671-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics