Abstract
The Dependency Core Calculus (DCC) is an extension of the computational lambda calculus that was designed in order to capture the notion of dependency that arises in information-flow control, partial evaluation, and other programming-language settings. We show that, unexpectedly, DCC can also be used as a calculus for access control in distributed systems. Initiating the study of DCC from this perspective, we explore some of its appealing properties.
- Martín Abadi. Logic in access control. In Proceedings of the Eighteenth Annual IEEE Symposium on Logic in Computer Science pages 228--233, 2003. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Martín Abadi, Michael Burrows, Butler Lampson, and Gordon Plotkin. A calculus for access control in distributed systems. ACM Transactions on Programming Languages and Systems 15(4):706--734, October 1993. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Luca Cardelli. Type systems. In Allen B. Tucker, editor, The Computer Science and Engineering Handbook chapter 103, pages 2208--2236. CRC Press, Boca Raton, FL, 1997.Google Scholar
- Dorothy E. Denning. Cryptography and Data Security Addison-Wesley, Reading, Mass., 1982. Google Scholar
Digital Library
- John DeTreville. Binder, a logic-based security language. In Proceedings of the 2002 IEEE Symposium on Security and Privacy pages 105--113, May 2002. Google Scholar
Digital Library
- Deepak Garg and Frank Pfenning. Non-interference in constructive authorization logic. A version of this paper will appear in the Proceedings of the 19th IEEE Computer Security Foundations Workshop (CSFW-19)Manuscript, February 2006. Google Scholar
Digital Library
- Morrie Gasser. Building a Secure Computer System Van Nostrand Reinhold Company Inc., New York, 1988. Google Scholar
Digital Library
- Jean-Yves Girard. Interprétation Fonctionnelle et Elimination des Coupures de l'Arithmétique d'Ordre Supérieur Thésededoctorat d'état, Université Paris VII, June 1972.Google Scholar
- Paul Hudak, Simon Peyton Jones, Philip Wadler, Brian Boutel, Jon Fairbairn, Joseph Fasel, María M. Guzmán, Kevin Hammond, John Hughes, Thomas Johnsson, Dick Kieburtz, Rishiyur Nikhil, Will Partain, and John Peterson. Report on the programming language Haskell:a non-strict, purely functional language. Version 1. 2. ACM SIGPLAN Notices 27(5):1--164, 1992. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Butler Lampson, Martín Abadi, Michael Burrows, and Edward Wobber. Authentication in distributed systems: Theory and practice. ACM Transactions on Computer Systems 10(4):265--310, November 1992. Google Scholar
Digital Library
- Butler W. Lampson. Computer security in the real world. Available from http://www.research.microsoft.com/lampson/.Google Scholar
- David Langworthy. Private communication. February 2006.Google Scholar
- Ninghui Li, Benjamin N. Grosof, and Feigenbaum. Delegation logic:A logic-based approach to distributed authorization. ACM Transactions on Information and System Security 6(1):128--171, February 2003. Google Scholar
Digital Library
- Ninghui Li and John C. Mitchell. Datalog with constraints:A foundation for trust-management languages. In Proceedings of the Fifth International Symposium on Practical Aspects of Declarative Languages (PADL 2003)volume 2562 of Lecture Notes in Computer Science pages 58--73. Springer-Verlag, January 2003. Google Scholar
Digital Library
- John C. Mitchell. Foundations for Programming Languages The MIT Press, Cambridge, Mass., 1996.Eugenio Moggi. Notions of computation and monads. Information and Control 93(1):55--92, 1991. Google Scholar
Digital Library
- Eugenio Moggi. Notions of computation and monads. Information and Control 93(1):55--92, 1991. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- François Pottier and Vincent Simonet. Information flow inference for ML. ACM Transactions on Programming Languages and Systems 25(1):117--158, January 2003. Google Scholar
Digital Library
- Stephen Tse and Steve Zdancewic. Translating dependency into parametricity. Journal of Functional Programming To appear. Google Scholar
Digital Library
- Philip Wadler. The marriage of effects and monads. In Proceedings of the 3rd ACM SIGPLAN International Conference on Functional Programming pages 63--74, 1998. Google Scholar
Digital Library
- Dan S. Wallach, Andrew W. Appel, and Edward W. Fel ten. Safkasi A security mechanism for language-based systems. ACM Transactions on Software Engineering and Methodol ogy 9(4):341--378, 2000. Google Scholar
Digital Library
- Edward Wobber, Martín Abadi, Michael Burrows, and Butler Lampson. Authentication in the Taos operating system. ACM Transactions on Computer Systems 12(1):3--32, February 1994. Google Scholar
Digital Library
Index Terms
Access control in a core calculus of dependency
Recommendations
Access control in a core calculus of dependency
ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programmingThe Dependency Core Calculus (DCC) is an extension of the computational lambda calculus that was designed in order to capture the notion of dependency that arises in information-flow control, partial evaluation, and other programming-language settings. ...
Access Control in a Core Calculus of Dependency
The Dependency Core Calculus (DCC) is an extension of the computational lambda calculus that was designed in order to capture the notion of dependency that arises in information-flow control, partial evaluation, and other programming-language settings. ...
A Perspective on the Dependency Core Calculus
PLAS '18: Proceedings of the 13th Workshop on Programming Languages and Analysis for SecurityThis paper presents a simple but equally expressive vari- ant on the terminating fragment of the Dependency Core Calculus (DCC) of Abadi et al. [2]. DCC is a concise and elegant calculus for tracking dependency. The calculus has applications in, among ...







Comments