Nonmonotonic Trust Management for P2P Applications | Zendy

Marcin Czenko | Zendy; Ha Manh Tran | Zendy; Jeroen Doumen | Zendy; Sandro Etalle | Zendy; Pieter Hartel | Zendy; Jerry den Hartog | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Nonmonotonic Trust Management for P2P Applications

Author(s) -

Marcin Czenko,

Ha Manh Tran,

Jeroen Doumen,

Sandro Etalle,

Pieter Hartel,

Jerry den Hartog

Publication year - 2006

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.09.037

Subject(s) - negation , monotonic function , trust management (information system) , computer science , semantics (computer science) , programming language , theoretical computer science , mathematics , computer security , mathematical analysis

We show that community decisions about access control in virtual communities cannot be expressed in current trust management languages. The problem is that trust management languages such as the family of Role Based Trust Management languages (RT) are monotonic. To solve the problem we propose RT-, which adds a restricted form of negation to the standard RT language, thus admitting a controlled form of non-monotonicity. The semantics of RT- is presented in terms of the well-founded semantics for Logic Programs. An implementation of RT- is given using XSB

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research