Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information and Communications Security

ICICS 2019: Information and Communications Security pp 324–340Cite as

Provably Secure Group Authentication in the Asynchronous Communication Model

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 11999))

Abstract

Authentication is one of the most fundamental services in information security. Compared with traditional authentication methods, group authentication enables a group of users to be authenticated at once rather than authenticating each user individually. Therefore, it is preferred in the group-oriented environment, such as multicast/conference communications. While several group authentication schemes have been proposed over the past few years, no formal treatment for this cryptographic problem has ever been suggested. Existing papers only provide heuristic evidences of security and some of these schemes have later been found to be flawed. In this paper, we present a formal security model for this problem. Our model not only captures the basic requirement in group authentication that an adversary cannot pretend to be a group member without being detected, but also considers some desirable features in real-world applications, such as re-use of the credentials in multiple authentication sessions and allowance for users to exchange messages through asynchronous networks. We then introduce an efficient group authentication scheme where its security can be reduced to some well-studied complexity theoretic assumptions.

This is a preview of subscription content, 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 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

Learn about institutional subscriptions

References

  1. Ahmadian, Z., Jamshidpour, S.: Linear subspace cryptanalysis of Harn’s secret sharing-based group authentication scheme. IEEE Trans. Inf. Forensics Secur. 13(2), 502–510 (2018)

    Article  Google Scholar 

  2. Bellare, M., Canetti, R., Krawczyk, H.: A modular approach to the design and analysis of authentication and key exchange protocols. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 419–428. ACM (1998)

    Google Scholar 

  3. Bresson, E., Chevassut, O., Pointcheval, D., Quisquater, J.-J.: Provably authenticated group Diffie-Hellman key exchange. In: Proceedings of the 8th ACM conference on Computer and Communications Security, pp. 255–264. ACM (2001)

    Google Scholar 

  4. Bresson, E., Manulis, M.: Securing group key exchange against strong corruptions. In: Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, pp. 249–260. ACM (2008)

    Google Scholar 

  5. Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65–75 (1988)

    Article  MathSciNet  Google Scholar 

  6. Chien, H.-Y.: Group authentication with multiple trials and multiple authentications. Secur. Commun. Netw. 2017, 7 (2017)

    Article  Google Scholar 

  7. Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644–654 (1976)

    Article  MathSciNet  Google Scholar 

  8. Elmouaatamid, O., Lahmer, M., Belkasmi, M.: Group authentication with fault tolerance for internet of things. In: Sabir, E., García, A.A., Ghogho, M., Debbah, M. (eds.) UNet 2017. LNCS, vol. 10542, pp. 299–307. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68179-5_26

    Chapter  Google Scholar 

  9. Fiat, A., Shamir, A.: How To prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987). https://doi.org/10.1007/3-540-47721-7_12

    Chapter  Google Scholar 

  10. Guo, C., Zhuang, R., Yuan, L., Feng, B.: A group authentication scheme supporting cheating detection and identification. In: 2015 Ninth International Conference on Frontier of Computer Science and Technology (FCST), pp. 110–114. IEEE (2015)

    Google Scholar 

  11. Hao, F., Zieliński, P.: A 2-round Anonymous Veto protocol. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2006. LNCS, vol. 5087, pp. 202–211. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04904-0_28

    Chapter  Google Scholar 

  12. Harn, L.: Group authentication. IEEE Trans. Comput. 62(9), 1893–1898 (2013)

    Article  MathSciNet  Google Scholar 

  13. Katz, J., Shin, J.S.: Modeling insider attacks on group key-exchange protocols. In: Proceedings of the 12th ACM Conference on Computer and Communications Security, pp. 180–189. ACM (2005)

    Google Scholar 

  14. Katz, J., Yung, M.: Scalable protocols for authenticated group key exchange. J. Cryptol. 20(1), 85–113 (2007)

    Article  MathSciNet  Google Scholar 

  15. Li, J., Wen, M., Zhang, T.: Group-based authentication and key agreement with dynamic policy updating for MTC in LTE-a networks. IEEE Internet Things J. 3(3), 408–417 (2016)

    Article  Google Scholar 

  16. Liu, Y., Sun, Q., Wang, Y., Zhu, L., Ji, W.: Efficient group authentication in RFID using secret sharing scheme. Cluster Comput. 22, 1–7 (2018)

    Google Scholar 

  17. Mahalle, P.N., Prasad, N.R., Prasad, R.: Novel threshold cryptography-based group authentication (TCGA) scheme for the internet of things (IoT) (2014)

    Google Scholar 

  18. Miao, F., Jiang, H., Ji, Y., Xiong, Y.: Asynchronous group authentication. Chin. J. Electron. 26(4), 820–826 (2017)

    Article  Google Scholar 

  19. Schnorr, C.-P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161–174 (1991)

    Article  Google Scholar 

  20. Shafi, G., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270–299 (1984)

    Article  MathSciNet  Google Scholar 

  21. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  Google Scholar 

  22. Su, W.-T., Wong, W.-M., Chen, W.-C.: A survey of performance improvement by group-based authentication in IoT. In: 2016 International Conference on Applied System Innovation (ICASI), pp. 1–4. IEEE (2016)

    Google Scholar 

  23. Xia, Z., Yang, X., Xiao, M., He, D.: Provably secure threshold paillier encryption based on hyperplane geometry. In: Liu, J.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9723, pp. 73–86. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40367-0_5

    Chapter  Google Scholar 

Download references

Acknowledgement

This work was partially supported by the National Natural Science Foundation of China (Grant No. 61572303, 61772326, 61672010, 61872087) and Guangxi Key Laboratory of Trusted Software (Grant No. KX201908). We are very grateful to the anonymous reviewers for their valuable comments on the paper.

Author information

Authors and Affiliations

  1. School of Computer Science, Wuhan University of Technology, Wuhan, China

    Zhe Xia

  2. Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin, China

    Zhe Xia

  3. Department of Computer Science and Electronic Engineering, University of Missouri-Kansas City, Kansas City, USA

    Lein Harn

  4. School of Computer Science, Shaanxi Normal University, Xi’an, China

    Bo Yang

  5. School of Computers, Hubei University of Technology, Wuhan, China

    Mingwu Zhang

  6. State Key Laboratory of Cryptology, Beijing, China

    Mingwu Zhang

  7. Fujian Provincial Key Laboratory of Network Security and Cryptology, College of Mathematics and Informatics, Fujian Normal University, Fuzhou, China

    Yi Mu

  8. School of Computing and Information Technology, University of Wollongong, Wollongong, Australia

    Willy Susilo

  9. DTU Compute, Technical University of Denmark, Copenhagen, Denmark

    Weizhi Meng

Authors
  1. Zhe Xia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lein Harn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bo Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mingwu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yi Mu
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Willy Susilo
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Weizhi Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhe Xia .

Editor information

Editors and Affiliations

  1. Singapore University of Technology and Design, Singapore, Singapore

    Jianying Zhou

  2. The Hong Kong Polytechnic University, Kowloon, Hong Kong

    Xiapu Luo

  3. Peking University, Beijing, China

    Qingni Shen

  4. Institute of Information Engineering, Beijing, China

    Zhen Xu

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Xia, Z. et al. (2020). Provably Secure Group Authentication in the Asynchronous Communication Model. In: Zhou, J., Luo, X., Shen, Q., Xu, Z. (eds) Information and Communications Security. ICICS 2019. Lecture Notes in Computer Science(), vol 11999. Springer, Cham. https://doi.org/10.1007/978-3-030-41579-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-41579-2_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-41578-5

  • Online ISBN: 978-3-030-41579-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation