KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

An Improved Efficient Provable Secure Identity-Based Identification Scheme in the Standard Model

  • Tan, Syh-Yuan (Faculty of Information Science and Technology, Multimedia University) ;
  • Chin, Ji-Jian (Faculty of Information Science and Technology, Multimedia University) ;
  • Heng, Swee-Huay (Faculty of Information Science and Technology, Multimedia University) ;
  • Goi, Bok-Min (Faculty of Engineering and Science, Universiti Tunku Abdul Rahman)
  • Received : 2012.11.22
  • Accepted : 2013.04.29
  • Published : 2013.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

In 2008, Chin et al. proposed an efficient and provable secure identity-based identification scheme in the standard model. However, we discovered a subtle flaw in the security proof which renders the proof of security useless. While no weakness has been found in the scheme itself, a scheme that is desired would be one with an accompanying proof of security. In this paper, we provide a fix to the scheme to overcome the problem without affecting the efficiency as well as a new proof of security. In particular, we show that only one extra pre-computable pairing operation should be added into the commitment phase of the identification protocol to fix the proof of security under the same hard problems.

Keywords

References

  1. K. Kurosawa, S.-H. Heng, "From digital signature to id-based identification/signature," Public Key Cryptography, Vol. 2947 of Lecture Notes in Computer Science, Springer, pp. 248-261, 2004.
  2. M. Bellare, C. Namprempre, G. Neven, "Security proofs for identity-based identification and signature schemes," EUROCRYPT, Vol. 3027 of Lecture Notes in Computer Science, Springer, pp. 268-286, 2004.
  3. A. Shamir, "Identity-based cryptosystems and signature schemes," CRYPTO, Vol. 196 of Lecture Notes in Computer Science, Springer, pp. 47-53, 1984.
  4. M. Bellare, P. Rogaway, "Random oracles are practical: A paradigm for designing efficient protocols," in Proc. of ACM Conference on Computer and Communications Security, ACM, pp. 62-73, 1993.
  5. R. Canetti, O. Goldreich, S. Halevi, "The random oracle methodology, revised" Journal of ACM, vol. 51, no.4, pp.557-594,2004 https://doi.org/10.1145/1008731.1008734
  6. K. Kurosawa, S.-H. Heng, "Identity-based identification without random oracles," ICCSA, Vol. 3481 of Lecture Notes in Computer Science, Springer, pp. 603-613, 2005.
  7. K. Kurosawa, S.-H. Heng, The power of identification schemes," Public Key Cryptography, Vol. 3958 of Lecture Notes in Computer Science, Springer, pp. 364-377, 2006.
  8. J.-J. Chin, S.-H. Heng, B.-M. Goi, "An efficient and provable secure identity-based identification scheme in the standard model," EuroPKI, Vol. 5057 of Lecture Notes in Computer Science, Springer, pp. 60-73, 2008.
  9. D. Naccache, "Secure and practical identity-based encryption," IACR Cryptology ePrint Archive, 2005 (2005) 369.
  10. S. Chatterjee, P. Sarkar, "Trading time for space: Towards an efficient ibe scheme with short(er) public parameters in the standard model," ICISC, Vol. 3935 of Lecture Notes in Computer Science, Springer, pp. 424-440, 2005.
  11. A. Boldyreva, "Threshold signatures, multisignatures and blind signatures based on the gap-diffie-hellman-group signature scheme," Public Key Cryptography, Vol. 2567 of Lecture Notes in Computer Science, Springer, pp. 31-46, 2003.
  12. M. Bellare, A. Palacio, "GQ and Schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks," CRYPTO, Vol. 2442 of Lecture Notes in Computer Science, Springer, pp. 162-177, 2002.
  13. S.Y. Tan, S.H. Heng, B.M. Goi "Java implementation for pairing-based cryptosystems," ICCSA, Vol. Part IV, Springer, pp. 188-198, 2010.

Cited by

  1. An Efficient and Provable Secure Certificateless Identification Scheme in the Standard Model vol.8, pp.7, 2014, https://doi.org/10.3837/tiis.2014.07.019