Skip to main content
SpringerLink
Log in

A Variant of Schnorr Identity-Based Identification Scheme with Tight Reduction

  • Conference paper
Future Generation Information Technology (FGIT 2011)

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

Included in the following conference series:

Abstract

Using the rewinding technique from Reset Lemma, Schnorr identity-based identification (IBI) can be proven secure against impersonation under passive attack, and active and concurrent attacks if the discrete logarithm problem and one-more discrete logarithm problem are hard in the random oracle model respectively. However, its security reduction is not tight. In this paper, we propose a variant of Schnorr IBI scheme and provide a direct proof with tight security reduction. In particular, we show that with only three additional elements in the system parameters, the proposed scheme can be proven secure against impersonation under passive attack, and active and concurrent attacks if the decisional Diffie-Hellman problem is hard in the random oracle model. This proving technique may also be applied on other IBI schemes.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arita, S., Kawashima, N.: An Identification Scheme with Tight Reduction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E90-A(9), 1949–1955 (2007)

    Article  Google Scholar 

  2. Bellare, M., Fischlin, M., Goldwasser, S., Micali, S.: Identification Protocols Secure against Reset Attacks. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 495–511. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Bellare, M., Namprempre, C., Neven, G.: Security Proofs for Identity-Based Identification and Signature Schemes. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 268–286. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Bellare, M., Palacio, A.: GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 162–177. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Bellare, M., Palacio, A.: The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 273–289. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Chin, J.-J., Heng, S.-H., Goi, B.-M.: An Efficient and Provable Secure Identity-Based Identification Scheme in the Standard Model. In: Mjølsnes, S.F., Mauw, S., Katsikas, S.K. (eds.) EuroPKI 2008. LNCS, vol. 5057, pp. 60–73. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Goh, E.-J., Jarecki, S., Katz, J., Wang, N.: Efficient signature schemes with tight reductions to the Diffie-Hellman problems. Journal of Cryptology 20(4), 493–514

    Google Scholar 

  8. Katz, J., Wang, N.: Efficiency improvements for signature schemes with tight security reductions. In: ACM — CCS 2003, pp. 155–164 (2003)

    Google Scholar 

  9. Kurosawa, K., Heng, S.-H.: From Digital Signature to ID-based Identification/Signature. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 248–261. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Kurosawa, K., Heng, S.-H.: Identity-Based Identification Without Random Oracles. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3481, pp. 603–613. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Kurosawa, K., Heng, S.-H.: The Power of Identification Schemes. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 364–377. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press (1997)

    Google Scholar 

  13. Rückert, M.: Adaptively Secure Identity-Based Identification from Lattices without Random Oracles. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 345–362. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. Schnorr, C.-P.: Efficient Identification and Signatures for Smart Cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239–252. Springer, Heidelberg (1990)

    Google Scholar 

  15. 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 

  16. Thorncharoensri, P., Susilo, W., Mu, Y.: Identity-Based Identification Scheme Secure against Concurrent-Reset Attacks without Random Oracles. In: Youm, H.Y., Yung, M. (eds.) WISA 2009. LNCS, vol. 5932, pp. 94–108. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  17. Yang, G., Chen, J., Wong, D.S., Deng, X., Wang, D.: A new framework for the design and analysis of identity-based identification schemes. Theoretical Computer Science 407, 370–388 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Communication and Technology, Tunku Abdul Rahman University, Perak, Malaysia

    Syh-Yuan Tan

  2. Faculty of Information Science and Technology, Multimedia University, Melaka, Malaysia

    Swee-Huay Heng

  3. Department of Electronic and Electrical Engineering, Loughborough University, Leicestershire, UK

    Raphael C. -W. Phan

  4. Faculty of Engineering and Science, Tunku Abdul Rahman University, Kuala Lumpur, Malaysia

    Bok-Min Goi

Authors
  1. Syh-Yuan Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Swee-Huay Heng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Raphael C. -W. Phan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bok-Min Goi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Hannam University, 133 Ojeong-dong, daeduk-gu, 306-791, Daejeon, South Korea

    Tai-hoon Kim

  2. Department of Neuroscience, The Ohio State University, 470 Hitchcock Hall, 2070 Neil Avenue, 43110, Columbus, Ohio, U.S.A.

    Hojjat Adeli

  3. Infobright, M5E 1P8, Toronto, ON, Canada

    Dominik Slezak

  4. Department of Computer Science, Oslo University College, P.O. Box 4, N-0130, St. Olavs plass, Oslo, Norway

    Frode Eika Sandnes

  5. Nanjing University of Aeronautics and Astronautics, 210016, Nanjing, China

    Xiaofeng Song

  6. Electronics and Communications Research Institute (ETRI), 305-700, Daejeon, Korea

    Kyo-il Chung

  7. Mississippi State University, 39762, Oktibbeha, MS, USA

    Kirk P. Arnett

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tan, SY., Heng, SH., Phan, R.C.W., Goi, BM. (2011). A Variant of Schnorr Identity-Based Identification Scheme with Tight Reduction. In: Kim, Th., et al. Future Generation Information Technology. FGIT 2011. Lecture Notes in Computer Science, vol 7105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27142-7_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27142-7_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27141-0

  • Online ISBN: 978-3-642-27142-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation