Proceedings of the 14th ACM Symposium on Access Control Models and Technologies 2009
DOI: 10.1145/1542207.1542232
|View full text |Cite
|
Sign up to set email alerts
|

Efficient access enforcement in distributed role-based access control (RBAC) deployments

Abstract: We address the distributed setting for enforcement of a centralized Role-Based Access Control (RBAC) protection state. We present a new approach for time-and space-efficient access enforcement. Underlying our approach is a data structure that we call a cascade Bloom filter. We describe our approach, provide details about the cascade Bloom filter, its associated algorithms, soundness and completeness properties for those algorithms, and provide an empirical validation for distributed access enforcement of RBAC.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
20
0

Year Published

2010
2010
2014
2014

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 16 publications
(21 citation statements)
references
References 24 publications
1
20
0
Order By: Relevance
“…The third factor is the frequency of policy changes and the scope of these changes, that is, how many elements in the PA they affect. The fourth factor is the relative benefits brought by one-time replication of the PA (or some subset of it)-as proposed by Tripunitara and Carbunar [2009], for example-to the SDPs, as opposed to item-by-item caching of the responses.…”
Section: Discussionmentioning
confidence: 99%
“…The third factor is the frequency of policy changes and the scope of these changes, that is, how many elements in the PA they affect. The fourth factor is the relative benefits brought by one-time replication of the PA (or some subset of it)-as proposed by Tripunitara and Carbunar [2009], for example-to the SDPs, as opposed to item-by-item caching of the responses.…”
Section: Discussionmentioning
confidence: 99%
“…Good performance for authorization recycling depends heavily on cache warmness, which can be a problem especially for short duration sessions or access requests with low temporal locality. To circumvent the problem of a cold cache, Tripunitara and Carbunar [27] proposed implementing an SDP using a push model that prefetches authorizations into the SDP. The authors proposed the novel cascade Bloom filter as a data structure for caching authorizations.…”
Section: Related Workmentioning
confidence: 99%
“…Because the orchestration engine acts as a central controller, it is able to keep a central process execution history. On the other hand, the orchestration engine is also a single point of failure which (in case of a system crash) will stop the entire system from working (see, e.g., [3,23]). …”
Section: Motivationmentioning
confidence: 99%