2043 search results - page 190 / 409 » Reasoning About Security Models |
164
click to vote
SAC
2005
ACM
15 years 11 months ago
2005
ACM
In traditional access control models like MAC, DAC, and RBAC, authorization decisions are determined according to identities of subjects and objects, which are authenticated by a ...
150
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
165
Voted
ESORICS
2008
Springer
15 years 8 months ago
2008
Springer
Current tools for analysing information flow in programs build upon ideas going back to Denning's work from the 70's. These systems enforce an imperfect notion of informa...
165
Voted
CTRSA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper, we give a first example of identity based undeniable signature using pairings over elliptic curves. We extend to the identity based setting the security m...
148
Voted
ENTCS
2007
15 years 6 months ago
2007
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...