Access Control in a Core Calculus of Dependency

Electronic Notes in Theoretical Computer Science

Volumn 172, Issue , 2007, Pages 5-31

  Abadi, Martín ^a,b  

^a University of California Santa Cruz   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Authorization; Types

Indexed keywords

DEPENDENCY CORE CALCULUS (DCC); LAMBDA CALCULUS;

ACCESS CONTROL; COMPUTER PROGRAMMING LANGUAGES; DATA FLOW ANALYSIS; DISTRIBUTED COMPUTER SYSTEMS; PARTIAL DIFFERENTIAL EQUATIONS;

COMPUTATIONAL METHODS;

EID: 33847791903     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.02.002     Document Type: Article

References (31)

1. Martín Abadi. Logic in access control. In Proceedings of the Eighteenth Annual IEEE Symposium on Logic in Computer Science, pages 228-233, 2003
2. Martín Abadi. Access control in a core calculus of dependency. In Proceedings of the 11th ACM International Conference on Functional Programming (ICFP 2006), pages 263-273, September 2006
3. Martín Abadi, Anindya Banerjee, Nevin Heintze, and Jon G. Riecke. A core calculus of dependency. In Proceedings of the 26th ACM Symposium on Principles of Programming Languages, pages 147-160, January 1999
4. Abadi M., Burrows M., Lampson B., and Plotkin G. A calculus for access control in distributed systems. ACM Transactions on Programming Languages and Systems 15 4 (October 1993) 706-734
5. Andrew W. Appel and Edward W. Felten. Proof-carrying authentication. In Proceedings of the 5th ACM Conference on Computer and Communications Security, pages 52-62, November 1999
6. Lujo Bauer, Scott Garriss, and Michael K. Reiter. Distributed proving in access-control systems. In Proceedings of the 2005 IEEE Symposium on Security and Privacy, pages 81-95, May 2005
7. Cardelli L. Type systems. In: Tucker A.B. (Ed). The Computer Science and Engineering Handbook (1997), CRC Press, Boca Raton, FL 2208-2236 chapter 103
8. Denning D.E. Cryptography and Data Security (1982), Addison-Wesley, Reading, Mass.
9. John DeTreville. Binder, a logic-based security language. In Proceedings of the 2002 IEEE Symposium on Security and Privacy, pages 105-113, May 2002
10. Fairtlough M., and Mendler M. Propositional lax logic. Information and Computation 137 1 (1997) 1-33
11. Deepak Garg and Frank Pfenning. Non-interference in constructive authorization logic. A revised version of this paper appears in the Proceedings of the 19th IEEE Computer Security Foundations Workshop (CSFW 19). Manuscript, February 2006
12. Gasser M. Building a Secure Computer System (1988), Van Nostrand Reinhold Company Inc., New York
13. Jean-Yves Girard. Interprétation Fonctionnelle et Elimination des Coupures de l'Arithmétique d'Ordre Supérieur. Thèse de doctorat d'état, Université Paris VII, June 1972
14. Hudak P., Jones S.P., Wadler P., Boutel B., Fairbairn J., Fasel J., Guzmán M.M., Hammond K., Hughes J., Johnsson T., Kieburtz D., Nikhil R., Partain W., and Peterson J. Report on the programming language Haskell: a non-strict, purely functional language. Version 1.2. ACM SIGPLAN Notices 27 5 (1992) 1-164
15. Trevor Jim. SD3: A trust management system with certified evaluation. In Proceedings of the 2001 IEEE Symposium on Security and Privacy, pages 106-115, May 2001
16. Lampson B., Abadi M., Burrows M., and Wobberm E. Authentication in distributed systems: Theory and practice. ACM Transactions on Computer Systems 10 4 (November 1992) 265-310
17. Lampson B.W. Computer security in the real world. IEEE Computer 37 6 (June 2004) 37-46
18. David Langworthy. Private communication. February 2006
19. Li N., Grosof B.N., and Feigenbaum. Delegation logic: A logic-based approach to distributed authorization. ACM Transactions on Information and System Security 6 1 (February 2003) 128-171
20. Li N., and Mitchell J.C. Datalog with constraints: A foundation for trust-management languages. Proceedings of the Fifth International Symposium on Practical Aspects of Declarative Languages. (PADL 2003). Lecture Notes in Computer Science volume 2562 (January 2003), Springer-Verlag 58-73
21. Mitchell J.C. Foundations for Programming Languages (1996), The MIT Press, Cambridge, Mass.
22. Moggi E. Notions of computation and monads. Information and Control 93 1 (1991) 55-92
23. Andrew C. Myers. JFlow: Practical mostly-static information flow control. In Proceedings of the 26th ACM Symposium on Principles of Programming Languages, pages 228-241, January 1999
24. Plotkin G.D. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science 1 (1975) 125-159
25. François Pottier and Sylvain Conchon. Information flow inference for free. In Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming, pages 46-57, September 2000
26. Pottier F., and Simonet V. Information flow inference for ML. ACM Transactions on Programming Languages and Systems 25 1 (January 2003) 117-158
27. Stephen Tse and Steve Zdancewic. Translating dependency into parametricity. Journal of Functional Programming. To appear
28. Philip Wadler. The marriage of effects and monads. In Proceedings of the 3rd ACM SIGPLAN International Conference on Functional Programming, pages 63-74, 1998
29. Wallach D.S., Appel A.W., and Felten E.W. Safkasi: A security mechanism for language-based systems. ACM Transactions on Software Engineering and Methodology 9 4 (2000) 341-378
30. Wobber E., Abadi M., Burrows M., and Lampson B. Authentication in the Taos operating system. ACM Transactions on Computer Systems 12 1 (February 1994) 3-32
31. Steve Zdancewic. Private communication. August 2006