A logical framework for history-based access control and reputation systems

Krukow, Karl; Nielsen, Mogens; Sassone, Vladimiro

doi:10.3233/jcs-2008-16102

Cited by 28 publications

(39 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Summary structures (future formulas) précis no online yes no reduce [4] yes offline no no Chomicki [8,9] no online yes no Krukow et al [10] Bauer et al [11] yes online yes no Basin et al [5,7] no online yes yes Basin et al [6] yes online yes yes Bauer et al [19] no online (automata)* (automata)* Table 1: Comparison of design choices in précis and prior work using first-order temporal logic for privacy compliance. *Automata-based approaches have no explicit notion of summary structures.…”

Section: Implementation and Evaluationmentioning

confidence: 99%

“…Alternatively, an online program may monitor privacy-relevant events, check them against the prevailing privacy policy and report violations on the fly. Both approaches have been considered in literature: An algorithm for offline compliance checking has been proposed by a subset of the authors [4], whereas online monitoring has been the subject of extensive work by other researchers [5][6][7][8][9][10][11].…”

Section: Introductionmentioning

confidence: 99%

“…Unlike the safe-range check or the standard mode check, our new temporal mode check captures this information correctly and our monitoring algorithm, précis, implements this strategy. No existing work on online monitoring can handle this formula because r cannot be summarized [5][6][7][8][9][10][11]. The work on offline checking can handle this formula [4], it does not build summary structures and is needlessly inefficient on q.…”

Section: Introductionmentioning

confidence: 99%

“…Some work, e.g. [5,[8][9][10][11], is based on the safe-range check [5], which requires syntactic subformulas to have finite support independent of each other; other work, e.g. [4,7], is based on the mode check from logic programming [13][14][15], which is more general and can propagate variable groundedness information across subformulas.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Temporal Mode-Checking for Runtime Monitoring of Privacy Policies

Chowdhury

Jia

Garg³

et al. 2014

Computer Aided Verification

View full text Add to dashboard Cite

Fragments of first-order temporal logic are useful for representing many practical privacy and security policies. Past work has proposed two strategies for checking event trace (audit log) compliance with policies: online monitoring and offline audit. Although online monitoring is space-and timeefficient, existing techniques insist that satisfying instances of all subformulas of the policy be amenable to caching, which limits expressiveness when some subformulas have infinite support. In contrast, offline audit is brute force and can handle more policies but is not as efficient. This paper proposes a new online monitoring algorithm that caches satisfying instances when it can, and falls back to the brute force search when it cannot. Our key technical insight is a new flowand time-sensitive static check of variable groundedness, called the temporal mode check, which determines subformulas for which such caching is feasible and those for which it is not and, hence, guides our algorithm. We prove the correctness of our algorithm and evaluate its performance over synthetic traces and realistic policies.

show abstract

Section: Implementation and Evaluationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Temporal Mode-Checking for Runtime Monitoring of Privacy Policies

Chowdhury

Jia

Garg³

et al. 2014

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

“…[10] for a π-calculus dialect. A calculus for ubiquitous computing dealing with trust is proposed in [26], a framework allowing LTL model checking. An instance of a formal approach based on the actor model dealing with trust management is [41].…”

Section: Related Workmentioning

confidence: 99%

Architecting Security with Paradigm

Andova

Groenewegen

Verschuren

et al. 2009

Architecting Dependable Systems VI

View full text Add to dashboard Cite

Abstract. For large security systems a clear separation of concerns is achieved through architecting. Particularly the dynamic consistency between the architectural components should be addressed, in addition to individual component behaviour. In this paper, relevant dynamic consistency is specified through Paradigm, a coordination modeling language based on dynamic constraints. As it is argued, this fits well with security issues. A smaller example introduces the architectural approach towards implementing security policies. A larger casestudy illustrates the use of Paradigm in analyzing the FOO voting scheme. In addition, translating the Paradigm models into process algebra brings model checking within reach. Security properties of the examples discussed, are formally verified with the model checker mCRL2.

show abstract

Caching and Auditing in the RPPM Model

Crampton

Sellwood

2014

Security and Trust Management

View full text Add to dashboard Cite

Crampton and Sellwood recently introduced a variant of relationship-based access control based on the concepts of relationships, paths and principal matching, to which we will refer as the RPPM model. In this paper, we show that the RPPM model can be extended to provide support for caching of authorization decisions and enforcement of separation of duty policies. We show that these extensions are natural and powerful. Indeed, caching provides far greater advantages in RPPM than it does in most other access control models and we are able to support a wide range of separation of duty policies.

show abstract

A logical framework for history-based access control and reputation systems

Cited by 28 publications

References 31 publications

Temporal Mode-Checking for Runtime Monitoring of Privacy Policies

Temporal Mode-Checking for Runtime Monitoring of Privacy Policies

Architecting Security with Paradigm

Caching and Auditing in the RPPM Model

Contact Info

Product

Resources

About