Titlebook: Data and Applications Security and Privacy XXIV; 24th Annual IFIP WG Sara Foresti,Sushil Jajodia Conference proceedings 2010 IFIP Internat

該得

Aqueous-Humor

https://doi.org/10.1007/978-3-662-68313-2ent years. The role mining problem (RMP) and several of its variants have been proposed in the literature. While the basic RMP discovers roles that exactly represent the UPA, the . variants, such as the .-approx RMP and MinNoise-RMP, allow for some inexactness in the sense that the discovered roles

發(fā)展

https://doi.org/10.1007/978-3-662-68313-2 demand adequate mechanisms to restrict the access to authorized parties. In this paper, we study a distributed access control model, where data items are stored, queried and authenticated in a totally decentralized fashion. Our contribution focuses on the design of a comprehensive framework for acc

Harpoon

ANNUL

斑駁

Ceramic

https://doi.org/10.1007/978-3-662-68313-2tion is the concept of “Query Race”: we split up a general query into several single attribute queries, and exploit concurrency and speed to bind the complexity to the fastest of them. Our method supports selection queries with general composition of conjunctive and disjunctive order-based condition

危險(xiǎn)

https://doi.org/10.1007/978-3-662-68313-2icies. To ensure the correctness of access control policies, policy authors conduct policy verification to check whether certain properties are satisfied by a policy. However, these properties are often not written in practice. To facilitate property verification, we present an approach that automat

Adjourn

https://doi.org/10.1007/978-3-662-68313-2aking critical decisions. Thus, there is a need for a scalable access control model that simplifies the management of security policies and handles the heterogeneity inherent in the information system. This paper proposes an ontology-based distributed solution to this problem, with the benefits of b

Multiple