Complexity Problems in the Analysis of Information Systems Security - Computer Network Security - page 55

7. Canetti, R.: Universally composable security: a new paradigm for cryptographic
protocols. In IEEE, editor, 42nd IEEE Symposium on Foundations of Computer
Science: proceedings: October 14-17, 2001, Las Vegas, Nevada, USA , 1109 Spring
Street, Suite 300, Silver Spring, MD 20910, USA. IEEE Computer Society Press
(2001) 136-145
8. Comon, H. and Cortier, V.: Tree automata with one memory, set constraints and
cryptographic protocols. Theoretical Computer Science (2003) To appear
9. Comon, H., Cortier, V., and Mitchell, J.: Tree automata with one memory, set
constraints, and ping-pong protocols. In Proc. of the Intern. Conf. on Automata,
languages and Programming (ICALP'01, ) Lect. Notes in Comput. Sci., vol. 2076
(2001) 682-693
10. Comon, H. and Shmatikov, V.: Is it possible to decide whether a cryptographic
protocol is secure or not?, (2002) Draft. 10 pages. Available at
http://www.lsv.ens-cachan.fr/
11. Dolev, D., Even, S., and Karp, R.: On the security of ping-pong protocols. Infor-
mation and Control , 55 (1982) 57-68
12. Durgin, N., Lincoln, P., Mitchell, J.C., and Scedrov, A.: Undecidability of bounded
security protocols. In Proc. of the Workshop on Formal Methods and Security
Protocols, Trento, Italy (1999)
13. Fournet, C. and Gordon, A.D.: Stack inspection: Theory and variants. ACM
Transactions on Programming Languages and Systems , 25(3) (May 2003) 360-399
14. Gorodetski, V. and Kotenko, I.: Attacks against computer network: Formal
grammar-based framework and simulation tool. Lecture Notes in Computer Sci-
ence , 2516 (2002) 219-238
15. Goldreich, O.: Foundations of Cryptography: Basic Tools . Cambridge University
Press, Cambridge, UK, 2001. Parts of volumes 2 and 3 (drafts of Chapers 5-7) can
be found at http://www.wisdom.weizman.ac.il/ oded/
16. Hunter, J.: An information security handbook . Springer (2001)
17. Katz, J. and Yung, M.: Complete characterization of security notions for proba-
bilistic private-key encryption. In Proceedings of the ACM Symposium on Theory
of Computing , ACM Press (2000) 245-254
18. Lincoln, P., Mitchell, J., Mitchell, M., and Scedrov, V.: A probabilistic poly-time
framework for protocol analysis. In Proceedings of the 5th ACM Conference on
Computer and Communications Security , San Francisco, California, ACM Press
(November 1998) 112-121
19. Necula, G.C.: Proof-carrying code. In Proceedings of the 24th ACM Symposium
on Principles of Programming Languages , Paris, France (January 1997)
20. Paulson, L.C.: The inductive approach to verifying cryptographic protocols. Jour-
nal of Computer Security , 6(1) (1998) 85-128
21. Rusinovich, M. and Turuani, M.: Protocol insecurity with finite number of sessions
is NP-complete. In Proc. of the 14th Computer Security Foundations Workshop
(CSFW'01) . IEEE Computer Society Press (2001) 174-190
22. Schneider, F.B.: Enforceable security policies. ACM Transactions on Information
and System Security , 3(1) (February 2000) 30-50
23. Schneier, B.: Secrets & Lies — Digital Security in a Networked World . John Wiley
& Sons (2000)
24. Sheyner, O., Jha, S., Wing, J., Lippmann, R., and Haines, J.: Automated gener-
ation and analysis of attack graphs. In Proceedings of the IEEE Symposium on
Research in Security and Privacy , Oakland, CA, May 2002. IEEE Computer Soci-
ety, Technical Committee on Security and Privacy, IEEE Computer Society Press,
273-284