Advertisement

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.

Keywords

Predicate Symbol Label Transition System Process Calculus Policy Equivalence Reduction Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of databases. Addison-Wesley, Reading (1995)zbMATHGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Appel, A.W., Felten, E.W.: Proof-carrying authentication. In: Proc. of 6th ACM Conference on Computer and Communications Security, CCS 1999 (1999)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Carbone, M., Maffies, S.: On the expressive power of polyadic synchronisation in π-calculus. Nordic Journal of Computing (NJC) 10(2) (September 2003)Google Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Hennessy, M., Riely, J.: Resource access control in systems of mobile agents. Information and Computation 173(1), 82–120 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I and II. Information and Computation 100(1), 1–40, 41–77 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Marco Carbone
    • 1
  • Mogens Nielsen
    • 1
  • Vladimiro Sassone
    • 2
  1. 1.BRICSUniversity of Aarhus 
  2. 2.Dept. of InformaticsUniversity of Sussex 

Personalised recommendations