Weighted pushdown systems and trust-management systems

  • Authors:

  • Somesh Jha;Stefan Schwoon;Hao Wang;Thomas Reps

  • Affiliations:

  • Computer Science Department, University of Wisconsin, Madison, WI;Institut für Formale Methoden der Informatik, Universität Stuttgart, Stuttgart, Germany;Computer Science Department, University of Wisconsin, Madison, WI;Computer Science Department, University of Wisconsin, Madison, WI

  • Venue:
  • TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The authorization problem is to decide whether, according to a security policy, some principal should be allowed access to a resource. In the trust-management system SPKI/SDSI, the security policy is given by a set of certificates, and proofs of authorization take the form of certificate chains. The certificate-chain-discovery problem is to discover a proof of authorization for a given request. Certificate-chain-discovery algorithms for SPKI/SDSI have been investigated by several researchers. We consider a variant of the certificate-chain discovery problem where the certificates are distributed over a number of servers, which then have to cooperate to identify the proof of authorization for a given request. We propose two protocols for this purpose. These protocols are based on distributed model-checking algorithms for weighted pushdown systems (WPDSs). These protocols can also handle cases where certificates are labeled with weights and where multiple certificate chains must be combined to form a proof of authorization. We have implemented these protocols in a prototype and report preliminary results of our evaluation.