Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proc. of the 28th symposium on Principles of Programming Languages POPL 2001, pp. 104–115. ACM Press, New York (2001)
Abiteboul, S., Hull, R., Vianu, V.: Foundations of databases. Addison-Wesley, Reading (1995)
Amadio, R., Boudol, G., Lhoussaine, C.: The receptive distributed pi-calculus. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 304–315. Springer, Heidelberg (1999)
Appel, A.W., Felten, E.W.: Proof-carrying authentication. In: Proc. of 6th ACM Conference on Computer and Communications Security, CCS 1999 (1999)
Becker, M.Y., Sewell, P.: Flexible trust management, applied to electronic health records. In: Proc. of the 17th IEEE Computer Security Foundations Workshop CSFW 2004. IEEE Computer Society Press, Los Alamitos (2004)
Burrows, M., Abadi, M., Lampson, B.W., Plotkin, G.: A calculus for access control in distributed systems. In: Proc. of 11th Annual International Cryptology Conference Advances in Cryptology CRYPTO 1991, vol. 576, pp. 1–23 (1991)
Carbone, M., Maffies, S.: On the expressive power of polyadic synchronisation in π-calculus. Nordic Journal of Computing (NJC) 10(2) (September 2003)
Carbone, M., Nielsen, M., Sassone, V.: A formal model for trust in dynamic networks. In: Proc. of International Conference on Software Engineering and Formal Methods SEFM 2003, pp. 54–61. IEEE Computer Society Press, Los Alamitos (2003)
Guttman, J., Thayer, J., Carlson, J., Herzog, J., Ramsdell, J., Sniffen, B.: Trust management in strand spaces: A rely-guarantee method. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 325–339. Springer, Heidelberg (2004)
Hennessy, M., Riely, J.: Resource access control in systems of mobile agents. Information and Computation 173(1), 82–120 (2002)
Jajodia, S., Samarati, P., Subrahmanian, V.S.: A logical language for expressing authorizations. In: Proc. of the IEEE Symposium on Security and Privacy, pp. 31–42. IEEE Computer Society Press, Los Alamitos (1997)
Jones, A.J.I., Firozabadi, B.S.: On the characterisation of a trusting agent. In: Workshop on Deception, Trust and Fraud in Agent Societies (2000)
Li, N., Mitchell, J.C., Winsborough, W.H.: Design of a role-based trust management framework. In: Proc. of the IEEE Symposium on Security and Privacy, pp. 114–130. IEEE Computer Society Press, Los Alamitos (2002)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I and II. Information and Computation 100(1), 1–40, 41–77 (1992)
Palamidessi, C.: Comparing the expressive power of the synchronous and the asynchronous π-calculus. In: Proc. of the 24th symposium on Principles of Programming Languages POPL1997, pp. 256–265. ACM Press, New York (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carbone, M., Nielsen, M., Sassone, V. (2004). A Calculus for Trust Management. In: Lodaya, K., Mahajan, M. (eds) FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2004. Lecture Notes in Computer Science, vol 3328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30538-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-30538-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24058-7
Online ISBN: 978-3-540-30538-5
eBook Packages: Computer ScienceComputer Science (R0)