Advertisement

A Provably Secure Scalable Revocable Identity-Based Signature Scheme Without Bilinear Pairings

  • Changji Wang
  • Hui HuangEmail author
  • Yuan Yuan
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 895)

Abstract

Revocation functionality is essential for the practical deployment of identity-based cryptosystems because a user’s private key may be corrupted by hacking or the period of a contract expires. Many researchers are focusing on revocable identity-based encryption scheme, while revocable identity-based signature scheme has received limited concentration. Recently, several revocable identity-based signature schemes have been proposed. However, these schemes are not scalable and are vulnerable to signing key exposure attack. In this paper, we first refine the security model of revocable identity-based signature scheme by considering the signing key exposure attack. Then, we propose a scalable revocable identity-based signature scheme with signing key exposure resistance. Finally, we prove the proposed scheme is existentially unforgeable against adaptively chosen message and identity attacks under the standard discrete logarithm assumption in the random oracle model.

Keywords

Revocable identity-based encryption Revocable identity-based signature KUNode algorithm Random oracle model 

Notes

Acknowledgments

This research is funded by Science and Technology Program of Guangzhou (Grant No. 201707010358) and Opening Project of Shanghai Key Laboratory of Integrated Administration Technologies for Information Security (Grant No. AGK201707).

References

  1. 1.
    Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G.R., Chaum, D. (eds.) Advances in Cryptology - CRYPTO 1984. Lecture Notes in Computer Science, vol. 196, pp. 47–53. Springer, Heidelberg (1985)Google Scholar
  2. 2.
    Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) Advances in Cryptology - CRYPTO 2001. Lecture Notes in Computer Science, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Chen, L.Q.: An interpretation of identity-based cryptography. In: Aldini, A., Gorrieri, R. (eds.) Foundations of Security Analysis and Design IV. Lecture Notes in Computer Science, vol. 4677, pp. 183–208. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. 4.
    Zhang, P.F.: Tradeoffs in certificate revocation schemes. Comput. Commun. Rev. 33(2), 103–112 (2003)CrossRefGoogle Scholar
  5. 5.
    Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) Advances in Cryptology - CRYPTO 2001. Lecture Notes in Computer Science, vol. 2139, pp. 41–62. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Boldyreva, A., Goyal, V., Kumar, V.: Identity-based encryption with efficient revocation. In: Proceedings of the 15th ACM Conference on Computer and Communications Security - CCS 2008, pp. 417–426. ACM, New York (2008)Google Scholar
  7. 7.
    Wu, T.Y., Tsai, T.T., Tseng, Y.M.: Revocable ID-based signature scheme with batch verifications. In: 8th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, pp. 49–54. IEEE (2012)Google Scholar
  8. 8.
    Sun, Y.X., Zhang, F.T., Shen, L.M., Deng, R.: Revocable identity-based signature without pairing. In: 5th International Conference on Intelligent Networking and Collaborative Systems, pp. 363–365. IEEE (2013)Google Scholar
  9. 9.
    Galindo, D., Garcia, F.D.: A Schnorr-like lightweight identity-based signature scheme. In: Preneel, B. (ed.) Progress in Cryptology - AFRICACRYPT 2009. Lecture Notes in Computer Science, vol. 5580, pp. 135–148. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  10. 10.
    Chatterjee, S., Kamath, C., Kumar, V.: Galindo-Garcia identity-based signature revisited. In: Kwon, T., Lee, M.K., Kwon, D. (eds.) International Conference on Information Security and Cryptology - ICISC 2012. Lecture Notes in Computer Science, vol. 7839, pp. 456–471. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  11. 11.
    Libert, B., Vergnaud, D.: Towards black-box accountable authority IBE with short ciphertexts and private keys. In: Jarecki, S., Tsudik, G. (eds.) Public Key Cryptography - PKC 2009. Lecture Notes in Computer Science, vol. 5443, pp. 235–255. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  12. 12.
    Seo, J.H., Emura, K.: Revocable identity-based encryption revisited: security model and construction. In: Kurosawa, K., Hanaoka, G. (eds.) Public Key Cryptography - PKC 2013. Lecture Notes in Computer Science, vol. 7778, pp. 216–234. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  13. 13.
    Tseng, Y.M., Tsai, T.T.: Efficient revocable ID-based encryption with a public channel. Comput. J. 55(4), 475–486 (2012)CrossRefGoogle Scholar
  14. 14.
    Boneh, D., Boyen, X.: Efficient selective-ID secure identity-based encryption without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) Advances in Cryptology - EUROCRYPT 2004. Lecture Notes in Computer Science, vol. 3027, pp. 223–238. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  15. 15.
    Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) Advances in Cryptology - EUROCRYPT 2005. Lecture Notes in Computer Science, vol. 3494, pp. 457–473. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  16. 16.
    Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Proceedings of the 13th ACM Conference on Computer and Communications Security - CCS 2006, pp. 390–399. ACM, New York (2006)Google Scholar
  17. 17.
    Libert, B., Vergnaud, D.: Adaptive-ID secure revocable identity-based encryption. In: Fischlin, M. (ed.) Topics in Cryptology - CT-RSA 2009. Lecture Notes in Computer Science, vol. 5473, pp. 1–15. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  18. 18.
    Lee, K., Lee, D.H., Park, J.H.: Efficient revocable identity-based encryption via subset difference methods. IACR Cryptology ePrint Archive, Report 2014/132 (2014). http://eprint.iacr.org/2014/132
  19. 19.
    Wang, C.J., Li, Y., Xia, X.N., Zheng, K.J.: An efficient and provable secure revocable identity-based encryption scheme. PLoS ONE 9(9), 1–11 (2014)Google Scholar
  20. 20.
    Boldyreva, A., Palacio, A., Warinschi, B.: Secure proxy signature schemes for delegation of signing rights. J. Cryptology 25(1), 57–115 (2012)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Chen, L., Cheng, Z., Smart, N.P.: Identity-based key agreement protocols from pairings. Int. J. Inf. Secur. 6(4), 213–241 (2007)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.School of Information Science and TechnologyGuangdong University of Foreign StudiesGuangzhouChina
  2. 2.Shanghai Key Laboratory of Integrated Administration Technologies for Information SecurityShanghaiChina
  3. 3.School of Statistics and MathematicsGuangdong University of Finance and EconomicsGuangzhouChina
  4. 4.School of Mathematics and StatisticsGuangdong University of Foreign StudiesGuangzhouChina

Personalised recommendations