skip to main content
article

Access control in a core calculus of dependency

Authors Info & Claims
Published:16 September 2006Publication History
Skip Abstract Section

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.

References

  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. 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 ScholarGoogle Scholar
  7. Dorothy E. Denning. Cryptography and Data Security Addison-Wesley, Reading, Mass., 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. Morrie Gasser. Building a Secure Computer System Van Nostrand Reinhold Company Inc., New York, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle Scholar
  12. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. Butler W. Lampson. Computer security in the real world. Available from http://www.research.microsoft.com/lampson/.Google ScholarGoogle Scholar
  16. David Langworthy. Private communication. February 2006.Google ScholarGoogle Scholar
  17. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  18. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  19. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  20. Eugenio Moggi. Notions of computation and monads. Information and Control 93(1):55--92, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  22. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  23. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  24. Stephen Tse and Steve Zdancewic. Translating dependency into parametricity. Journal of Functional Programming To appear. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  26. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  27. 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 ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Access control in a core calculus of dependency

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image ACM SIGPLAN Notices
                ACM SIGPLAN Notices  Volume 41, Issue 9
                Proceedings of the 2006 ICFP conference
                September 2006
                296 pages
                ISSN:0362-1340
                EISSN:1558-1160
                DOI:10.1145/1160074
                Issue’s Table of Contents
                • cover image ACM Conferences
                  ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
                  September 2006
                  308 pages
                  ISBN:1595933093
                  DOI:10.1145/1159803
                  • General Chair:
                  • John Reppy,
                  • Program Chair:
                  • Julia Lawall

                Copyright © 2006 ACM

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 16 September 2006

                Check for updates

                Qualifiers

                • article

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader
              About Cookies On This Site

              We use cookies to ensure that we give you the best experience on our website.

              Learn more

              Got it!