Security for mobility

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2946, Issue , 2004, Pages 207-265

  Nielson, Hanne Riis ^a   Nielson, Flemming ^a   Buchholtz, Mikael ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK SECURITY; POLYNOMIAL APPROXIMATION; SEMANTICS; STATIC ANALYSIS;

CONTEXT SENSITIVITY; CRYPTOGRAPHIC KEY EXCHANGES; DISCRETIONARY ACCESS CONTROL; MANDATORY ACCESS CONTROL; MOBILE AMBIENTS; OPERATIONAL SEMANTICS; POLYNOMIAL-TIME; SECURITY ISSUES;

ACCESS CONTROL;

EID: 34247854302     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24631-2_6     Document Type: Article

References (40)

1. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols - The Spi calculus. Information and Computation, 148(1):1-70, 1999.
2. A. Aiken. Introduction to set constraint-based program analysis. Science of Computer Programming (SCP), 35(2):79-111, 1999.
3. D. Bell and L. LaPadula. Secure computer system: Unified exposition and Multics interpretation. Technical Report ESDTR-75-306, MTR-2547, MITRE Corporation, 1975.
4. K. J. Biba. Integrity consideration for secure computer systems. Technical Report ESDTR-76-372, MTR-3153, MITRE Corporation, 1977.
5. C. Bodei, M. Buchholtz, P. Degano, F. Nielson, and H. Riis Nielson. Polynomial-time validation of protocol narration. Manuscript, 2002.
6. C. Braghin, A. Cortesi, and R. Focardi. Control flow analysis for information flow security in Mobile Ambients. In Proceedings of NordSec 2001. Technical Report IMM-TR-2001-14. Technical University of Denmark, 2001.
7. M. Buchholtz, F. Nielson, and H. Riis Nielson. Experiments with Succinct Solvers. Technical Report IMM-TR-2002-4, Technical University of Denmark, 2002.
8. M. Bugliesi, G. Castagna, and S. Crafa. Boxed Ambients. In Theoretical Aspects in Computer Science (TACS 2001), volume 2215 of Lecture Notes in Computer Science, pages 37-63. Springer, 2001.
9. M. Bugliesi, G. Castagna, and S. Crafa. Reasoning about security in Mobile Ambients. In CONCUR 2001 - Concurrency Theory, volume 2154 of Lecture Notes in Computer Science, pages 102-120. Springer, 2001.
10. M. Burrows, M. Abadi, and R. Needham. A logic of authentication. ACM Transactions on Computer Systems, pages 18-36, 1990.
11. L. Cardelli, G. Ghelli, and A. D. Gordon. Mobility types for Mobile Ambients. In Automata, Languages, and Programming. 26th International Colloquium, ICALP 1999, volume 1644 of Lecture Notes in Computer Science, pages 230-239. Springer, 1999.
12. L. Cardelli, G. Ghelli, and A. D. Gordon. Ambient groups and mobility types. In Theoretical Computer Science. International Conference IFIP TCS 2000, volume 1872 of Lecture Notes in Computer Science, pages 333-347. Springer, 2000.
13. L. Cardelli and A. D. Gordon. Mobile Ambients. In Foundations of Software Science and Computation Structures (FoSSaCS 1998), volume 1378 of Lecture Notes in Computer Science, pages 140-155. Springer, 1998.
14. L. Cardelli and A. D. Gordon. Types for Mobile Ambients. In Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 1999), pages 79-92. ACM Press, 1999.
15. L. Cardelli and A. D. Gordon. Anytime, anywhere: Modal logics for Mobile Ambients. In Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2000), pages 365-377. ACM Press, 2000.
16. L. Cardelli and A. D. Gordon. Mobile Ambients. Theoretical Computer Science, 240(1):177-213, 2000.
17. W. Charatonik, A. D. Gordon, and J.-M. Talbot. Finite-control Mobile Ambients. In Programming Languages and Systems. 11th European Symposium on Programming (ESOP 2001), volume 2305 of Lecture Notes in Computer Science. Springer, 2001.
18. J. Clark and J. Jacob. A survey of authentication protocol literature: Version 1.0. http://www-users.cs.york.ac.uk/∼jac/papers/drareviewps.ps, 1997.
19. P. Cousot and R. Cousot. Abstract Interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 1977), pages 238-252. ACM Press, 1977.
20. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proceedings of the 6th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 1979), pages 269-282. ACM Press, 1979.
21. S. Crafa, M. Bugliesi, and G. Castagna. Information flow security for Boxed Ambients. In F-WAN: Foundations of Wide Area Network Computing, volume 63 of Electronic Notes in Theoretical Computer Science, 2002.
22. D. Gollmann. Computer Security. Wiley, 1999.
23. F. Levi and S. Maffeis. An abstract interpretation framework for analysing Mobile Ambients. In Static Analysis, 8th International Symposium, SAS 2001, pages 395-411. Springer, 2001.
24. F. Levi and D. Sangiorgi. Controlling interference in ambients. In Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2000), pages 352-364. ACM Press, 2000.
25. D. McAllester. On the complexity analysis of static analyses. In Static Analysis, 6th International Symposium, SAS 1999, volume 1694 of Lecture Notes in Computer Science, pages 312-329. Springer, 1999.
26. M. Merro and V. Sassone. Typing and subtyping mobility in Boxed Ambients. In CONCUR 2002 - Concurrency Theory, volume 2421 of Lecture Notes in Computer Science, pages 304-320. Springer, 2002.
27. R. Needham and M. Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993-999, 1978.
28. F. Nielson and H. Riis Nielson. Flow Logics and operational semantics. Electronic Notes in Theoretical Computer Science, 10, 1998.
29. F. Nielson, H. Riis Nielson, and C. Hankin. Principles of Program Analysis. Springer, 1999.
30. F. Nielson, H. Riis Nielson, and R. R. Hansen. Validating firewalls using flow logics. Theoretical Computer Science, 283(2):381-418, 2002.
31. F. Nielson, H. Riis Nielson, R. R. Hansen, and J. G. Jensen. Validating firewalls in Mobile Ambients. In CONCUR 1999 - Concurrency Theory, volume 1664 of Lecture Notes in Computer Science, pages 463-477. Springer, 1999.
32. F. Nielson, H. Riis Nielson, and H. Seidl. Automatic complexity analysis. In Programming Languages and Systems. 11th European Symposium on Programming (ESOP 2002), number 2305 in Lecture Notes in Computer Science, pages 243-261. Springer, 2002.
33. F. Nielson, H. Riis Nielson, and H. Seidl. Cryptographic analysis in cubic time. Electronic Notes in Theoretical Computer Science, 62, 2002.
34. F. Nielson, H. Riis Nielson, and H. Seidl. Normalizable Horn clauses, strongly recognizable relations and Spi. In Static Analysis, 9th International Symposium, SAS 2002, volume 2477 of Lecture Notes in Computer Science, pages 20-35. Springer, 2002.
35. F. Nielson, H. Riis Nielson, and H. Seidl. Succinct Solvers. Manuscript, 2002.
36. F. Nielson and H. Seidl. Control-flow analysis in cubic time. In Programming Languages and Systems. 10th European Symposium on Programming (ESOP 2001), volume 2028 of Lecture Notes in Computer Science, pages 252-268. Springer, 2001.
37. H. Riis Nielson and F. Nielson. Shape analysis for Mobile Ambients. In Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2000), pages 142-154. ACM Press, 2000.
38. H. Riis Nielson and F. Nielson. Shape analysis for Mobile Ambients. Nordic Journal of Computing, 8:233-275, 2001.
39. H. Riis Nielson and F. Nielson. Flow Logic: a multi-paradigmatic approach to static analysis. In The Essence of Computation: Complexity, Analysis, Transformation, Lecture Notes in Computer Science. Springer, to appear.
40. D. T. Teller, P. Zimmer, and D. Hirschkoff. Using ambients to control resources. In CONCUR 2002 - Concurrency Theory, volume 2421 of Lecture Notes in Computer Science, pages 288-303. Springer, 2002.