Dynamic access control in a concurrent object calculus

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

Volumn 4137 LNCS, Issue , 2006, Pages 263-278

  Chaudhuri, Avik ^a  

^a University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENCY CONTROL; DATA PRIVACY; RESOURCE ALLOCATION;

CONCURRENT OBJECT CALCULUS; DYNAMIC SPECIFICATIONS; FLEXIBLE CCCESS CONTROL;

CONCURRENT ENGINEERING;

EID: 33749574802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817949_18     Document Type: Conference Paper

References (33)

1. M. Abadi and B. Blanchet. Secrecy types for asymmetric communication. Theoretical Computer Science, 298(3):387-415, 2003.
2. M. Abadi and L. Cardelli. An imperative object calculus. In TAPSOFT'95: Theory and Practice of Software Development, pages 471-485. Springer, 1995.
3. A. Banerjee and D. Naumann. Using access control for secure information flow in a Java-like language. In CSFW'03: Computer Security Foundations Workshop, pages 155-169. IEEE, 2003.
4. P. D. Blasio and K. Fisher. A calculus for concurrent objects. In CONCUR'96: Concurrency Theory, pages 655-670. Springer, 1996.
5. P. D. Blasio, K. Fisher, and C. Talcott. A control-flow analysis for a calculus of concurrent objects. IEEE Transactions on Software Engineering, 26(7):617-634, 2000.
6. C. Braghin, D. Gorla, and V. Sassone. A distributed calculus for role-based access control. In CSFW'04: Computer Security Foundations Workshop, pages 48-60. IEEE, 2004.
7. M. Bugliesi, G. Castagna, and S. Crafa. Access control for mobile agents: The calculus of boxed ambients. ACM Transactions on Programming Languages and Systems, 26(1 ):57-124,2004.
8. M. Bugliesi, D. Colazzo, and S. Crafa. Type based discretionary access control. In CONCUR'04: Concurrency Theory, pages 225-239. Springer, 2004.
9. L. Cardelli, G. Ghelli, and A. D. Gordon. Secrecy and group creation. Information and Computation, 196(2):127-155, 2005.
10. A. Chaudhuri and M. Abadi. Secrecy by typing and file-access control. In CSFW'06: Computer Security Foundations Workshop. To appear. IEEE, 2006.
11. T. Coquand. Pattern matching with dependent types. In Workshop on Types for Proofs and Programs, Electronic proceedings, 1992.
12. C. Flanagan. Hybrid type checking. In POPL '06: Principles of programming languages, pages 245-256. ACM, 2006.
13. C. Flanagan and M. Abadi. Object types against races. In CONCUR '99: Concurrency Theory, pages 288-303. Springer, 1999.
14. A. D. Gordon and P. D. Hankin. A concurrent object calculus: Reduction and typing. In HLCL'98: High-Level Concurrent Languages, pages 248-264. Elsevier, 1998.
15. A. D. Gordon and A. Jeffrey. Secrecy despite compromise: Types, cryptography, and the pi-calculus. In CONCUR'05: Concurrency Theory, pages 186-201. Springer, 2005.
16. D. Gorla and R. Pugliese. Resource access and mobility control with dynamic privileges acquisition. In ICALP'03: International Colloquium on Automata, Languages, and Programming, pages 119-132. Springer, 2003.
17. C. Haack and A. Jeffrey. Timed spi-calculus with types for secrecy and authenticity. In CONCUR'05: Concurrency Theory, pages 202-216. Springer, 2005.
18. K. W. Hamlen, G. Morrisett, and F. B. Schneider. Certified in-lined reference monitoring on .NET. In PLAS'06: Programming Languages and Analysis for Security, To appear. ACM, 2006.
19. C. Hawblitzel and T. von Eicken. Type system support for dynamic revocation. In Workshop on Compiler Support for System Software. Electronic proceedings, 1999.
20. M. Hennessy, M. Metro, and J. Rathke. Towards a behavioural theory of access and mobility control in distributed systems. In FOSSACS'03: Foundations of Software Science and Computational Structures, pages 282-298. Springer, 2003.
21. M. Hennessy and J. Riely. Resource access control in systems of mobile agents. In HLCL '98: High-Level Concurrent Languages, pages 174-188. Elsevier, 1998.
22. M. Hennessy and J. Riely. Information flow vs. resource access in the asynchronous picalculus. ACM Transactions on Programming Languages and Systems, 24(5):566-591, 2002.
23. Z. D. Kirli. Confined mobile functions. In CSFW'01: Computer Security Foundations Workshop, pages 283-294. IEEE, 2001.
24. J. Kleist and D. Sangiorgi. Imperative objects as mobile processes. Science of Computer Programming, 44(3):293-342, 2002.
25. G. Miklau and D. Suciu. Controlling access to published data using cryptography. In VLDB'03: Very Large Data Bases, pages 898-909. Springer, 2003.
26. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, 1997.
27. A. Myers, A. Sabelfeld, and S. Zdancewic. Enforcing robust declassification. In CSFW'04: Computer Security Foundations Workshop, pages 172-186. IEEE, 2004.
28. R. D. Nicola, G. Ferrari, R. Pugliese, and B. Venneri. Types for access control. Theoretical Computer Science, 240(1):215-254, 2000.
29. F. Pottier, C. Skalka, and S. Smith. A systematic approach to static access control. ACM Transactions on Programming Languages and Systems, 27(2):344-382, 2005.
30. D. D. Redell. Naming and protection in extendible operating systems. Technical Report 140, Project MAC, MIT, 1974.
31. F. B. Schneider. Enforceable security policies. ACM Transactions on Information and System Security, 3(1):30-50, 2000.
32. V. T. Vasconcelos. Typed concurrent objects. In ECOOP'94: European Conference on Object-Oriented Programming, pages 100-117. Springer, 1994.
33. L. Zheng and A. Myers. Dynamic security labels and noninterference. In FAST'04: Formal Aspects in Security and Trust, pages 27-40. Springer, 2004.