Identity-Based Key Issuing Without Secure Channel in a Broad Area

  • Saeran Kwon
  • Sang-Ho Lee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4298)


Despite many advantages of identity (ID)-based cryptosystems in removing certificates of public keys over the traditional public key cryptosystems (PKC), some problems related to the inherent key escrow property, user authentication and the need for the confidential channel for private key distribution remain as important issues to be resolved. In this paper, we propose a new key issuing scheme reasonably reducing the burden employed to a trust key issuing authority called key generation center (KGC) in checking the identifications of all users maintained by the KGC by means of separating the duties of the KGC; user identification function by a local trust authority, and private key extracting and issuing function by the KGC, respectively. Furthermore, our scheme provides secure transmission channel through blinding technique between the KGC and users, and deals efficiently with the key escrow problem. Hence, our scheme makes ID-PKC more applicable to real environment, and cover the wider area.


Bilinear Pairing Trust Authority Blind Signature Scheme Polynomial Time Adversary Blinding Factor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Al-Riyami, S., Paterson, K.: Certificateless Public Key Cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 452–473. Springer, Heidelberg (2003)Google Scholar
  2. 2.
    Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The One-More-RSA-Inversion Problems and the Security of Chaum’s Blind Signature Scheme. Journal of Cryptology 16(3), 185–215 (2003) Extended abstract of the preliminary version entitled: The Power of RSA Inversion Oracles and the Security of Chaum’s RSA-Based Blind Signature Scheme. Financial Cryptography ’01, LNCS 2339, Springer, Heidelberg (2002)Google Scholar
  3. 3.
    Bellare, M., Palacio, A.: GQ and Schnorr Identification Schemes: Proof of Security against Impersonation under Active and Concurrent Attacks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 162–177. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Boldyreva, A.: Efficient Threshhold Signature, Multisignature and Blind Signature Based on the Gap Diffie-Hellman-Group Signature Scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31–46. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Boneh, D., Lynn, A., Shacham, H.: Short Signatures from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Cha, J.C., Cheon, J.H.: An Identity-Based Signature from Gap Diffie-Hellman Groups. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 18–30. Springer, Heidelberg (2002)Google Scholar
  8. 8.
    Chen, L., Harrison, K., Smart, N.P., Soldera, D.: Applications of Multiple Trust Authorities in Pairing Based Cryptosystems. In: Davida, G.I., Frankel, Y., Rees, O. (eds.) InfraSec 2002. LNCS, vol. 2437, pp. 260–275. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Feige, U., Fiat, A., Shamir, A.: Zero knowledge proofs of identity. Journal of Cryptology 1(2), 77–94 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Gangshetti, R., Gorantla, M.C., Das, M.L.: An Efficient Secure Key Issuing Protocol in ID-Based Cryptosystem. In: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC’05), IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
  11. 11.
    Gemmel, P.: An Introduction to Threshold Cryptography. CryptoBytes, a Technical Newsletter of RSA Laboratories 2(7) (1997)Google Scholar
  12. 12.
    Gentry, C.: Certificate-Based Encryption and the Certificate Revocation Problem. In: Biham, E. (ed.) Advances in Cryptology – EUROCRPYT 2003. LNCS, vol. 2656, pp. 272–293. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  13. 13.
    Girault, M.: Self-Certified Public Keys. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 490–497. Springer, Heidelberg (1991)Google Scholar
  14. 14.
    Hess, F.: Efficient Identity-based Signature Schemes based on Pairings. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 310–324. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  15. 15.
    Joux, A., Nguyen, K.: Separatin Decision Diffie-Hellman from Diffe-Hellman in Cryptographic Groups. IACR Eprint Archive, available from
  16. 16.
    Lee, B., Boyd, C., Dawson, E., Kim, K., Yang, J., Yoo, S.: Secure Key Issuing in ID-based Cryptography. In: Proc. of AISW’04, vol. 32 (2004)Google Scholar
  17. 17.
    Okamoto, T., Pointcheval, D.: The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 104–118. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  18. 18.
    Pointcheval, D., Stern, J.: Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology 13(3), 361–396 (2000)zbMATHCrossRefGoogle Scholar
  19. 19.
    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)CrossRefGoogle Scholar
  20. 20.
    Sui, A., Chow, S.S.M., Hui, L.C.K., Yiu, S.M., Chow, K.P., Tsang, W.W., Chong, C.F., Pun, K.H., Chan, H.W.: Separable and Anonymous Identity-Based Key Issuing without Secure Channel. In: Proceedings of the 1st International Workshop on Security in Networks and Distributed Systems (SNDS 2005), IEEE Computer Society Press, Los Alamitos (2005), Available from IACR Eprint Archive, (Revied on 18 Jul. 2005)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Saeran Kwon
    • 1
  • Sang-Ho Lee
    • 1
  1. 1.Dept. of Computer Science and Engineering, Ewha Womans University, 11-1 Daehyun-Dong, Seodaemoon-Gu, SeoulKorea

Personalised recommendations