Cross-Tree: A Data Structure for Analysis of Security Protocols

D.X. Liu and Y.C. Bai

References

  1. [1] G. Lowe, An attack on the Needham-Schroeder public keyauthentication protocol, Information Processing Letters, 56 (3),1998, 131–136. doi:10.1016/0020-0190(95)00144-2
  2. [2] J. Zhou, Further analysis of the Internet key exchange protocol,Computer Communications, 23, 2000, 1606–1612. doi:10.1016/S0140-3664(00)00246-2
  3. [3] M. Burrows, M. Abadi, & R. Needham, A logic of authentication, ACM Trans. on Computer Systems, 8 (1), 1990, 18–36. doi:10.1145/77648.77649
  4. [4] J.C. Mitchell, M. Mitchell, & U. Stern, Automated analysis ofcryptographic protocols using murφ, Proc. 1997 IEEE Symp.on Security and Privacy, Oakland, CA, 1997, 141–151. doi:10.1109/SECPRI.1997.601329
  5. [5] G. Lowe, Breaking and fixing the Needham-Schroeder public-key protocol using FDR, Software Concepts and Tools, 17,1996, 93–102.
  6. [6] S. Schneider, Verifying authentication protocols in CSP, IEEETrans. on Software Engineering, 24 (9), 1998, 741–758. doi:10.1109/32.713329
  7. [7] J. Thayer, J.C. Herzog, & J.D. Guttman, Strand spaces: Proving security protocols correct, Journal of Computer Security,7 (2,3), 1999, 191–230.
  8. [8] L. Paulson, Proving properties of security protocols by induction. Proc. 1997 IEEE Symp. on Research in Security and Privacy, Oakland, CA , 1997, 70–83. doi:10.1109/CSFW.1997.596788
  9. [9] C. Meadows, The NRL protocol analyzer: An overview, Journalof Logic Programming, 26 (2), 1996, 113–131. doi:10.1016/0743-1066(95)00095-X
  10. [10] D. Song, Athena: A new efficient automated checker forsecurity protocol analysis, Proc. 12 th IEEE Computer SecurityFoundations Workshop, Mordano, Italy, 1999, 192–202. doi:10.1109/CSFW.1999.779773
  11. [11] A. Kumar, G-tree: A new data structure for organizing multidimensional data, IEEE Trans. on Knowledge and Data Engineering, 6(2), 1994, 341-347 doi:10.1109/69.277778

Important Links:

Go Back