LNCS A Calculus for Trust Management信托管理微积分.pdfVIP

A Calculus for Trust Management 1 1 2 Marco Carbone, Mogens Nielsen, and Vladimiro Sassone 1 BRICS∗ , University of Aarhus 2 Dept. of Informatics, University of Sussex Abstract. We introduce ctm, a process calculus which embodies a no- tion of trust for global computing systems. In ctm each principal (lo- cation) 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 pro- cess 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. 1 Introduction In the last few years Global Computing (GC) has emerged as an important part of computer science. A GC system is composed of entities which are autonomous, decentralised, mobile, dynamically configurable, and capable of operating under partial information. Such systems, e.g. the Internet, become easily very complex, and bring forward the need to guarantee security properties. Traditional security mechanisms, however, have severe limitations in this setting, as they often are either too weak to safeguard against actual risks, or too stringent, imposing unacceptable burdens on the effectiveness and flexibility of the infrastructure. Trust management systems, in which safety critical decision are made based on trust policies and their deployment in the presence of partial knowledge,