A Formal Framework for Concrete Reputation Systems
A Formal Framework for Concrete Reputation Systems
In a reputation-based trust-management system, agents maintain information about the past behaviour of other agents. This information is used to guide future trust-based decisions about interaction. However, while trust management is a component in security decision-making, many existing reputation-based trust-management systems provide no formal security-guarantees. In this extended abstract, we describe a mathematical framework for a class of simple reputation-based systems. In these systems, decisions about interaction are taken based on policies that are exact requirements on agents’ past histories. We present a basic declarative language, based on pure-past linear temporal logic, intended for writing simple policies. While the basic language is reasonably expressive (encoding e.g. Chinese Wall policies) we show how one can extend it with quantification and parameterized events. This allows us to encode other policies known from the literature, e.g., ‘one-out-of-k’. The problem of checking a history with respect to a policy is efficient for the basic language, and tractable for the quantified language when policies do not have too many variables.
reputation systems, trust, distributed systems, event structures, history-based access control, linear time temporal logic
1-59593-226-7
260-269
Krukow, K.
fcd8beaa-9872-4789-a28b-5b957dd97b64
Nielsen, M.
d6a4a4bb-e50c-4cd3-9b70-b0e34cf59059
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7
2005
Krukow, K.
fcd8beaa-9872-4789-a28b-5b957dd97b64
Nielsen, M.
d6a4a4bb-e50c-4cd3-9b70-b0e34cf59059
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7
Krukow, K., Nielsen, M. and Sassone, V.
(2005)
A Formal Framework for Concrete Reputation Systems.
12th ACM Conference on Computer and Communication Security, CCS'05..
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
In a reputation-based trust-management system, agents maintain information about the past behaviour of other agents. This information is used to guide future trust-based decisions about interaction. However, while trust management is a component in security decision-making, many existing reputation-based trust-management systems provide no formal security-guarantees. In this extended abstract, we describe a mathematical framework for a class of simple reputation-based systems. In these systems, decisions about interaction are taken based on policies that are exact requirements on agents’ past histories. We present a basic declarative language, based on pure-past linear temporal logic, intended for writing simple policies. While the basic language is reasonably expressive (encoding e.g. Chinese Wall policies) we show how one can extend it with quantification and parameterized events. This allows us to encode other policies known from the literature, e.g., ‘one-out-of-k’. The problem of checking a history with respect to a policy is efficient for the basic language, and tractable for the quantified language when policies do not have too many variables.
Text
concRepCCSFin.pdf
- Other
More information
Published date: 2005
Venue - Dates:
12th ACM Conference on Computer and Communication Security, CCS'05., 2005-01-01
Keywords:
reputation systems, trust, distributed systems, event structures, history-based access control, linear time temporal logic
Organisations:
Web & Internet Science
Identifiers
Local EPrints ID: 262306
URI: http://eprints.soton.ac.uk/id/eprint/262306
ISBN: 1-59593-226-7
PURE UUID: 404347be-b144-4b70-a4f4-da405c10588f
Catalogue record
Date deposited: 11 Apr 2006
Last modified: 10 Sep 2024 01:40
Export record
Contributors
Author:
K. Krukow
Author:
M. Nielsen
Author:
V. Sassone
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics