Breaking Though the Limitation of Test Components Using in Authentication Test

  • Meng-meng YaoEmail author
  • Hai-ping Xia
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11204)


In order to break through the limitation that test components in authentication test cannot be encrypted, researchers have conducted plenty of extension study into strand space and made some achievements. Firstly, we analysis the new definitions and improved theorems raised by those researchers and point out their restriction and inaccuracy by way of strand theory and examples in this paper. Secondly, we propose in this paper a new definition named minimum encryption term, effectively limiting the number of forms in which components appear in strand space, lessening the redundancy of authentication test and simplifying the analysis process of nested term encryption. And, based on minimum encryption term, we provide improved authentication test theorems: NE outgoing test, NE incoming test and NE unsolicited test, which help to testify symmetric protocol and discover its flaws, that is, the protocol is an easy target of Man-In-The-Middle attack. These improved theorems increase the accuracy of authentication tests and extend its scope of use to both symmetric and asymmetric cryptosystem.


Strand space Authentication test Protocol 


  1. 1.
    Guttman, J.D.: State and progress in strand spaces: proving fair exchange. J. Autom. Reason. 48(2), 159–195 (2012)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Muhammad, S.: Applying authentication tests to discover Man-In-The-Middle attack in security protocols. In: Eighth International Conference on Digital Information Management (ICDIM), 2013. IEEE, pp. 35–40 (2013)Google Scholar
  3. 3.
    Guttman, J.D.: Establishing and preserving protocol security goals. J. Comput. Secur. 22(2), 203–267 (2014)CrossRefGoogle Scholar
  4. 4.
    Feng, W., Feng, D.-G.: Analyzing trusted computing protocol based on the strand spaces model. Chin. J. Comput. 38(4), 701–716 (2015)MathSciNetGoogle Scholar
  5. 5.
    Yu, L., Wei, S., Zhuo, Z.: Research on consistence of strand parameters for protocol principals in authentication test theory. Comput. Eng. Appl. 51(13), 86–91 (2015)Google Scholar
  6. 6.
    Liu, J.: Automatic verification of security protocols with strand space theory. J. Comput. Appl. 35(7), 1870–1876 (2015)Google Scholar
  7. 7.
    Guttman, J.D., Thayer, F.J.: Authentication tests and the structure of bundles. Theor. Comput. Sci. 283(2), 333–380 (2002)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Song, W.-T., Hu, B.: One strong authentication test suitable for analysis of nested encryption protocols. Comput. Sci. 42(1), 149–169 (2015)Google Scholar
  9. 9.
    Yuan, B.-A., Liu, J., Zhou, H.-G.: Study and development on cryptographic protocol. J. Mil. Commun. Technol. 38(1), 90–94 (2017)Google Scholar
  10. 10.
    Zhang, H.-G., Wu, F.-S., Wang, H.-Z., Wang, Z.-Y.: A survey: security verification analysis of cryptographic protocols implementations on real code. Chin. J. Comput. 38(1), 90–94 (2017)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Jiangnan Computing Technology Research InstituteWuxiChina

Personalised recommendations