Checking risky events is enough for local policies

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

Volumn 3701 LNCS, Issue , 2005, Pages 97-112

  Bartoletti, Massimo ^a   Degano, Pierpaolo ^a   Ferrari, Gian Luigi ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; FINITE AUTOMATA; PARAMETER ESTIMATION; SECURITY SYSTEMS;

HISTORY-BASED ACCESS CONTROL; INSTRUMENTED CODE; SECURITY CONSTRAINTS; STATIC ANALYSIS;

DIFFERENTIATION (CALCULUS);

EID: 33646177666     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560586_9     Document Type: Conference Paper

References (21)

1. M. Abadi and C. Fournet. Access control based on execution history. In Proc. 10th Annual Network and Distributed System Security Symposium, 2003.
2. A. Banerjee and D. A. Naumann. History-based access control and secure information flow. In Workshop on Construction and Analysis of Safe, Secure and Interoperable Smart Cards (CASSIS), 2004.
3. M. Bartoletti, P. Degano, and G. L. Ferrari. Enforcing secure service composition. In Proc. 18th Computer Security Foundations Workshop (CSFW), 2005.
4. M. Bartoletti, P. Degano, and G. L. Ferrari. History based access control with local policies. In Proc. Fossacs, 2005.
5. L. Bauer, J. Ligatti, and D. Walker. More enforceable security policies. In Foundations of Computer Security (PCS '02), 2002.
6. J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77-121, 1985.
7. J. C. Bradfield. On the expressivity of the modal mu-calculus. In Proc. International Symposium on Theoretical Aspects of Computer Science, 1996.
8. T. Colcombet and P. Fradet. Enforcing trace properties by program transformation. In Proc. 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2000.
9. G. Edjlali, A. Acharya, and V. Chaudhary. History-based access control for mobile code. In Secure Internet Programming, 1999.
10. J. Esparza. On the decidability of model checking for several μ-calculi and Petri nets. In Proc. 19th Int. Colloquium on Trees in Algebra and Programming, 1994.
11. P. W. Fong. Access control by tracking shallow execution history. In IEEE Symposium on Security and Privacy, 2004.
12. C. Fournet and A. D. Gordon. Stack inspection: theory and variants. ACM Transactions on Programming Languages and Systems, 25(3):360-399, 2003.
13. A. Igarashi and N. Kobayashi. Resource usage analysis. In Proc. 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002.
14. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
15. K. Marriott, P. J. Stuckey, and M. Sulzmann. Resource usage verification. In Proc. First Asian Programming Languages Symposium, 2003.
16. G. C. Necula. Proof-carrying code. In Proc. 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997.
17. F. B. Schneider. Enforceable security policies. A CM Transactions on Information and System Security (TISSEC), 3(1):30-50, 2000.
18. P. Sewell and J. Vitek. Secure composition of untrusted code: box-π, wrappers and causality types. Journal of Computer Security, 11(2), 2003.
19. C. Skalka and S. Smith. History effects and verification. In Asian Programming Languages Symposium, 2004.
20. J.-P. Talpin and P. Jouvelot. The type and effect discipline. In Proc. 7th IEEE Symposium on Logic in Computer Science, 1992.
21. D. Walker. A type system for expressive security policies. In Proc. 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2000.