Skip to main content
SpringerLink
Log in

Research of Formal Analysis Based on Extended Strand Space Theories

  • Conference paper
  • First Online:
Intelligent Computing Theories and Application (ICIC 2019)

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

Included in the following conference series:

Abstract

In recent years, research based on strand space theories is a hotspot in the field of formal analysis method of security protocols. However, some extended theories based on strand space still has defects, and the analysis of security protocols is not accurate enough. And the model based on improved strand space theories is complex and not easy to develop automated verification tool. Based on this, the same execution bundle, matching strand, private item, etc. are proposed in this paper. In strand space, the matching strand of a given regular strand can be determined by the private item and the security key of the message item to prove the consistency of the security protocols. This paper proves the validity and accuracy of the extended strand space theories by analyzing Woo-Lam and Kerberos protocols.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

References

  1. Fabrega, F.J.T., Herzog, J.C., Guttman, J.D.: Strand space: Why is a security protocol correct. In: The 18th IEEE Symposium 1998, Oakland, USA, pp. 160–171. IEEE, Oakland (1998)

    Google Scholar 

  2. Fabrega, F.J.T., Herzog, J.C., Guttman, J.D.: Strand space: proving security protocols correct. J. Comput. Secur. 7(2,3), 191–230 (1999)

    Article  Google Scholar 

  3. Guttman, J.D., Thayer, F.J.: Authentication tests and the structure of bundles. Theoret. Comput. Sci. 283(2), 333–380 (2002)

    Article  MathSciNet  Google Scholar 

  4. Li, L., Wang, L., Chen, J., Wang, R., Zhang, Z.: Fairness analysis for multiparty nonrepudiation protocols based on improved strand space. Discrete Dyn. Nat. Soc. 2014(1), 1–7 (2014)

    Google Scholar 

  5. Chang, Y., Zhang, Z., Wang, J.: A security protocol for trusted access to cloud environment. Recent Adv. Electr. Electron. Eng. 8(2), 135–144 (2015)

    Google Scholar 

  6. Lei, Y.U., Wei, S., Zhuo, Z.: Research on consistence of strand parameters for protocol principals in authentication test theory. Comput. Eng. Appl. 51(13), 86–90 (2015)

    Google Scholar 

  7. Fan, Y., Escobar, S., Meadows, C., Meseguer, J., Santiago, S.: Strand spaces with choice via a process algebra semantics. In: International Symposium on Principles & Practice of Declarative Programming (2016)

    Google Scholar 

  8. Dong, X., Yang, C., Sheng, L., Wang, C., Ma, J.: A new method to deduce counterexamples in secure routing protocols based on strand space model. Secur. Commun. Netw. 9(18), 5834–5848 (2017)

    Article  Google Scholar 

  9. Xiong, L., Peng, D.Y.: An improved authentication test for security protocol analysis. Commun. Technol. 47(08), 951–954 (2014)

    Google Scholar 

  10. Sureshkumar, V., Anitha, R.: Analysis of electronic voting protocol using strand space model. In: Martínez Pérez, G., Thampi, Sabu M., Ko, R., Shu, L. (eds.) SNDS 2014. CCIS, vol. 420, pp. 416–427. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54525-2_37

    Chapter  Google Scholar 

  11. Song, W.T., Bin, H.U.: One strong authentication test suitable for analysis of nested encryption protocols. Comput. Sci. 42(1), 149–169 (2015)

    MathSciNet  Google Scholar 

  12. Wei, F., Feng, D.G.: Analyzing trusted computing protocol based on the strand spaces model. Chin. J. Comput. 38(4), 701–716 (2015)

    MathSciNet  Google Scholar 

  13. Song, W.T., Hu, B.: Approach to detecting type-flaw attacks based on extended strand spaces. Comput. J. 58(4), 572–587 (2018)

    Article  Google Scholar 

  14. Yao, M.M., Zhu, Z.C., Liu, M.D.: An improved formal analysis method based on authentication tests. Netinfo Secur. 19(1), 27–33 (2019)

    Google Scholar 

  15. Doghmi, S.F., Guttman, J.D., Thayer, F.J.: Searching for shapes in cryptographic protocols// Proceedings of the 13th TACAS. LNCS4424. Berlin: Springer. 523–537(2007)

    Google Scholar 

  16. Guttman, J.D.: State and progress in strand spaces: Proving fair exchange. J. Autom. Reason. 48(2), 159–195 (2012)

    Article  MathSciNet  Google Scholar 

  17. Ramsdell, J.D., Guttman, J.D.: CPSA Primer. The MITER Corporation, Bedford (2012)

    Google Scholar 

  18. Ramsedll, J.D.: Proving Security Goals with Shape Analysis Sentences. The MITER Corporation, Bedford (2013)

    Google Scholar 

  19. Ramsdell, J.D., Dougerty, D.J., et al.: A Hybrid Analysis for Security Protocols with State. The MITER Corporation, Bedford (2014)

    Book  Google Scholar 

  20. Liu, J.: Automatic verification of security protocols with strand space theory. J. Comput. Appl. 35(7), 1870–1876 (2015)

    Google Scholar 

  21. Yu, L., Wei, S.M., Jiang, M.M.: Formal analysis method of security protocol based on correlation degree of principals. Netinfo Secur. (2018)

    Google Scholar 

  22. Yuan, B.A., Liu, J., Zhou, H.G.: Study and development on cryptographic protocol. J. Mil. Commun. Technol. 38(1), 90–94 (2018)

    Google Scholar 

  23. Wei, H., Xie, Z.L., Yi, G.Z.: Analysis of kerberos protocol based on strand spacd theory. Comput. Technol. Dev. 2013(12), 109–112 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Jiangnan Institute of Computing Technology, Wuxi, China

    Meng-meng Yao, Jun Zhang & Xi Weng

Authors
  1. Meng-meng Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xi Weng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Meng-meng Yao .

Editor information

Editors and Affiliations

  1. Tongji University, Shanghai, China

    De-Shuang Huang

  2. University of Ulsan, Ulsan, Korea (Republic of)

    Kang-Hyun Jo

  3. Nanchang Institute of Technology, Nanchang, China

    Zhi-Kai Huang

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yao, Mm., Zhang, J., Weng, X. (2019). Research of Formal Analysis Based on Extended Strand Space Theories. In: Huang, DS., Jo, KH., Huang, ZK. (eds) Intelligent Computing Theories and Application. ICIC 2019. Lecture Notes in Computer Science(), vol 11644. Springer, Cham. https://doi.org/10.1007/978-3-030-26969-2_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-26969-2_61

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation