The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Handbook of logic in computer science (vol. 4)
History-based access control for mobile code
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
ACM Transactions on Information and System Security (TISSEC)
Communications of the ACM
Stack inspection: Theory and variants
ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal Logic with Forgettable Past
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Synthesizing Monitors for Safety Properties
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
A Logic for Reasoning about Digital Rights
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Log Auditing through Model-Checking
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Towards a formal notion of trust
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Reputation-based trust management
Journal of Computer Security - Special issue on WITS'03
Distributed Approximation of Fixed-Points in Trust Structures
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
A survey of trust and reputation systems for online service provision
Decision Support Systems
Using Trust for Secure Collaboration in Uncertain Environments
IEEE Pervasive Computing
History-based access control with local policies
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A calculus for trust management
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Security protocols, properties, and their monitoring
Proceedings of the fourth international workshop on Software engineering for secure systems
Adjustable Trust Model for Access Control
ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
Qualitative trust modeling in SOA
Journal of Systems Architecture: the EUROMICRO Journal
Matching Trace Patterns with Regular Policies
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Do You Really Mean What You Actually Enforced?
Formal Aspects in Security and Trust
A First-Order Policy Language for History-Based Transaction Monitoring
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
GoCoMM: a governance and compliance maturity model
Proceedings of the first ACM workshop on Information security governance
A flexible architecture for privacy-aware trust management
Journal of Theoretical and Applied Electronic Commerce Research
Towards a decision model based on trust and security risk management
AISC '09 Proceedings of the Seventh Australasian Conference on Information Security - Volume 98
Deriving trust from experience
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Tools for traceable security verification
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
An adaptive and Socially-Compliant Trust Management System for virtual communities
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Relational abstraction in community-based secure collaboration
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Hi-index | 0.00 |
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.