A calculus of mobile processes, II
Information and Computation
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource access control in systems of mobile agents
Information and Computation
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
A Calculus for Access Control in Distributed Systems
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
The Receptive Distributed pi-Calculus (Extended Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Design of a Role-Based Trust-Management Framework
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
A Logical Language for Expressing Authorizations
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
Cassandra: Flexible Trust Management, Applied to Electronic Health Records
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
A framework for concrete reputation-systems with applications to history-based access control
Proceedings of the 12th ACM conference on Computer and communications security
A complete fuzzy logical system to deal with trust management systems
Fuzzy Sets and Systems
A logical framework for history-based access control and reputation systems
Journal of Computer Security
A robust methodology for prediction of trust and reputation values
Proceedings of the 2008 ACM workshop on Secure web services
Structured communication-centred programming for web services
ESOP'07 Proceedings of the 16th European conference on Programming
Towards a formal framework for computational trust
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
A calculus of trustworthy ad hoc networks
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Structured Communication-Centered Programming for Web Services
ACM Transactions on Programming Languages and Systems (TOPLAS)
A reputation system for multirole sessions
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
Petri nets for the verification of ubiquitous systems with transient secure association
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
| Hi-index | 0.00 |
We introduce ctm, a process calculus which embodies a notion of trust for global computing systems. In ctm each principal (location) is equipped with a policy, which determines its legal behaviour, and with a protocol, which allows interactions between principals and the flow of information from principals to policies. We elect to formalise policies using a Datalog-like logic, and to express protocols in the process algebra style. This yields an expressive calculus very suitable for the global computing scenarios, and provides a formalisation of notions such as trust evolution. For ctm we define barbed equivalences and study their possible applications.