Delegation logic: A logic-based approach to distributed authorization

  • Authors:
  • Ninghui Li;Benjamin N. Grosof;Joan Feigenbaum

  • Affiliations:
  • Stanford University, Stanford, CA;Massachusetts Institute of Technology, Cambridge, MA;Yale University, New Haven, CT

  • Venue:
  • ACM Transactions on Information and System Security (TISSEC)
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We address the problem of authorization in large-scale, open, distributed systems. Authorization decisions are needed in electronic commerce, mobile-code execution, remote resource sharing, privacy protection, and many other applications. We adopt the trust-management approach, in which "authorization" is viewed as a "proof-of-compliance" problem: Does a set of credentials prove that a request complies with a policy?We develop a logic-based language, called Delegation Logic (DL), to represent policies, credentials, and requests in distributed authorization. In this paper, we describe D1LP, the monotonic version of DL. D1LP extends the logic-programming (LP) language Datalog with expressive delegation constructs that feature delegation depth and a wide variety of complex principals (including, but not limited to, k-out-of-n thresholds). Our approach to defining and implementing D1LP is based on tractably compiling D1LP programs into ordinary logic programs (OLPs). This compilation approach enables D1LP to be implemented modularly on top of existing technologies for OLP, for example, Prolog.As a trust-management language, D1LP provides a concept of proof-of-compliance that is founded on well-understood principles of logic programming and knowledge representation. D1LP also provides a logical framework for studying delegation.