A Modal Logical Framework for Security Policies
ISMIS '97 Proceedings of the 10th International Symposium on Foundations of Intelligent Systems
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
A framework for concrete reputation-systems with applications to history-based access control
Proceedings of the 12th ACM conference on Computer and communications security
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
A Bayesian Model for Event-based Trust
Electronic Notes in Theoretical Computer Science (ENTCS)
A logical framework for history-based access control and reputation systems
Journal of Computer Security
Attestation: Evidence and Trust
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
PathTrust: a trust-based reputation service for virtual organization formation
iTrust'06 Proceedings of the 4th international conference on Trust Management
A logic for reasoning about evidence
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
A trust-augmented voting scheme for collaborative privacy management
STM'10 Proceedings of the 6th international conference on Security and trust management
Defamation-free networks through user-centered data control:
STM'10 Proceedings of the 6th international conference on Security and trust management
A trust-augmented voting scheme for collaborative privacy management
Journal of Computer Security - STM'10
| Hi-index | 0.00 |
In everyday life, trust is largely built from experience. Reputation-based trust models have been developed to formalize this concept. The application to networks like the Internet where a very large number of predominantly unknown principal identities engage in interactions is appealing considering that the evaluation of trusted experience may result in a more successful choice of trusted parties to interact with. In this paper we pick the SECURE framework, as developed within the equally named EU project on Global Computing, which builds upon event structures to model possible outcomes of interactions. We extend it by three concepts: (i) a flexible way to determine a degree of trust from given past behavior, (ii) a basic notion of context, exemplarily in the form of roles the interacting parties may occupy, and (iii) we explicitly equip observed events with a time component to refine the granularity of observations. We extend definitions of concepts used in SECURE in order to incorporate our notion of context information, we provide the syntax and semantics of an LTL-like logic, in its basics similar to the one proposed by Krukow, Nielsen and Sassone, that allows for layered reasoning about context information. We then show how this new language relates to the one used in SECURE and we determine under which conditions our concept of deriving trust from experience may be used within SECURE’s computational model to obtain a global state of trust.