This paper defines a framework in which one can formalize a variety of authorization and policy issues that arise in access control of shared computing resources. Instantiations of the framework address such issues as privacy, recency, validity, and trust. The paper presents an efficient algorithm for solving all authorization problems in the framework; this approach yields new algorithms for a number of specific authorization problems. 1
|
394
|
Secure computer systems: Unified exposition and MULTICS interpretation
– Bell, LaPadula
- 1976
|
|
344
|
Authentication in Distributed Systems: Theory and Practice
– Lampson, Abadi, et al.
- 1991
|
|
329
|
A lattice model of secure information flow
– Denning
- 1976
|
|
323
|
The Official PGP User’s Guide
– Zimmermann
- 1995
|
|
234
|
Precise interprocedural dataflow analysis via graph reachability
– Reps, Sagiv, et al.
- 1995
|
|
218
|
The Chinese Wall security policy
– Brewer, Nash
- 1989
|
|
216
|
Two approaches to interprocedural data flow analysis
– Sharir, Pnueli
- 1981
|
|
200
|
Reachability analysis of pushdown automata: Application to model-checking
– Bouajjani, Esparza, et al.
- 1997
|
|
186
|
The KeyNote Trust-Management System Version 2
– Blaze, Feigenbaum, et al.
- 1999
|
|
186
|
C.: System description: Twelf - a meta-logical framework for deductive systems,Proceedings of the 16th International Conference on Automated Deduction (CADE-16
– Pfenning, Schurmann
- 1999
|
|
120
|
Valuation of trust in open networks
– Beth, Borcherding, et al.
- 1994
|
|
117
|
The role of trust management in distributed systems security
– BLAZE, FEIGENBAUM, et al.
- 1999
|
|
115
|
MOPS: an infrastructure for examining security properties of software
– Chen, Wagner
|
|
111
|
Proof-carrying authentication
– Appel, Felten
- 1999
|
|
102
|
Distributed Credential Chain Discovery
– Li, Winsborough, et al.
- 2001
|
|
99
|
Modelling a public-key infrastructure
– Maurer
- 1996
|
|
97
|
Efficient algorithm for model checking pushdown systems
– Esparza, Hansel, et al.
- 2000
|
|
87
|
REFEREE: Trust Management for Web Applications
– Chu, Feigenbaum, et al.
- 1997
|
|
77
|
The interprocedural coincidence theorem
– Knoop, Steffen
- 1992
|
|
70
|
Certificate chain discovery in SPKI/SDSI
– CLARKE, ELIEN, et al.
- 2001
|
|
66
|
Analysis of recursive state ma-chines
– Alur, Etessami, et al.
- 2001
|
|
58
|
Understanding trust management systems
– WEEKS
|
|
54
|
Can we eliminate certificate revocation lists
– Rivest
- 1998
|
|
52
|
SPKI certificate theory
– Ellison, Frantz, et al.
- 1999
|
|
50
|
a logic-based security language
– Binder
- 2002
|
|
48
|
Authentication metric analysis and design
– Reiter, Stubblebine
- 1999
|
|
45
|
Verification of control flow based security properties
– Jensen, Métayer, et al.
- 1999
|
|
43
|
Weighted pushdown systems and theirapplication to interprocedural dataflow analysis
– Reps, Schwoon, et al.
- 1981
|
|
39
|
A generic approach to the static analysis of concurrent programs with procedures
– Bouajjani, Esparza, et al.
- 2003
|
|
36
|
A generalization of Dijkstra’s algorithm
– Knuth
- 1977
|
|
33
|
Model-checking LTL with regular valuations for pushdown systems
– Esparza, Kucera, et al.
- 2001
|
|
32
|
Model checking of unrestricted hierarchical state machines
– Benedikt, Godefroid, et al.
- 2001
|
|
31
|
Resilient authentication using path independence
– Reiter, Stubblebine
- 1998
|
|
28
|
Recent-secure authentication: Enforcing revocation in distributed systems
– STUBBLEBINE
- 1995
|
|
18
|
Path problems in graphs
– Rote
- 1990
|
|
17
|
Ellison Privacy and accountability in certificate systems
– Aura, Carl
- 2000
|
|
17
|
Confidence valuation in a public-key infrastructure based on uncertain evidence
– Kohlas, Maurer
- 2000
|
|
14
|
der Meyden. A logical reconstruction of SPKI
– Halpern, van
- 2004
|
|
13
|
Analysis of SPKI/SDSI certificates using model checking
– Jha, Reps
- 2002
|
|
13
|
Grammar Flow Analysis
– Moencke, Wilhelm
- 1991
|
|
12
|
SPKI certificate theory. RFC 2693
– Ellison, Frantz, et al.
- 1999
|
|
11
|
On the complexity of vertex-disjoint length-restricted path problems. Konrad-Zuse-Zentrum f"ur Informationstechnik Berlin
– Bley
- 1998
|
|
9
|
An Algebra for Assessing Trust in Certification Chains
– Jsang
- 1999
|
|
8
|
Bounded incremental computation, volume 1089
– Ramalingam
- 1996
|
|
8
|
An Authentication Logic with Formal Semantics Supporting Synchronization, Revocation, and Recency
– Stubblebine, Wright
|
|
6
|
D.: Heuristics for finding a maximum number of disjoint bounded paths. Networks 14
– Ronen, Perl
- 1984
|
|
2
|
WPDS -- a library for Weighted Pushdown Systems
– Schwoon
- 2003
|
|
2
|
ITU-T recommendation X.509 (08/97) – information technology – open systems interconnection – the directory: Authentication framework
– Union
- 1997
|
|
1
|
of Defense. DoD Trusted Computer System Evaluation Criteria (DOD
– Department
|
