Abstract
Complex systems of interacting agents are ubiquitous in the highly interconnected, information-rich ecosystems upon which the world is more-or-less wholly dependent. Within these systems, it is often necessary for an agent, or a group of agents, such as a business, to establish within a given ecosystem a trusted group, or a region of trust. Building on an established mathematical systems modelling framework — based on process algebra, logic, and stochastic methods — we give a characterization of such ‘trust domains’ that employs logical assertions of the properties required for trust and utility-theoretic constraints on the cost of establishing compliance with those properties. We develop the essential meta-theory and give a range of examples.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abadi, M.: Logic in access control. In: Proc. LICS 2003, pp. 228–233. IEEE (2003)
Abadi, M., Burrows, M., Lampson, B., Plotkin, G.: A calculus for access control in distributed systems. ACM Trans. Prog. Langs. Sys. 15(4), 706–734 (1993)
Anderson, G., Collinson, M., Pym, D.: Utility-based Decision-making in Distributed Systems Modelling. In: Schipper, B.C. (ed.) Proc. 14th TARK, Chennai (2013), Computing Research Repository (CoRR): http://arxiv.org/corr/home ISBN: 978-0-615-74716-3
Barwise, J., Seligman, J.: Information Flow: The Logic of Distributed Systems. CUP (1997)
Beautement, A., Coles, R., Griffin, J., Ioannidis, C., Monahan, B., Pym, D., Sasse, A., Wonham, M.: Modelling the Human and Technological Costs and Benefits of USB Memory Stick Security. In: Johnson, M.E. (ed.) Managing Information Risk and the Economics of Security, pp. 141–163. Springer (2008)
Collinson, M., Monahan, B., Pym, D.: A Discipline of Mathematical Systems Modelling. College Publications (2012)
Coulouris, G., Dollimore, J., Kindberg, T.: Distributed Systems: Concepts and Design, 3rd edn. Addison Wesley (2000)
Hennessy, M.: A calculus for costed computations. Logical Methods in Computer Science 7(1), paper 9 (2011), doi:10.2168/LMCS-7(1:7)2011
Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32(1), 137–161 (1985)
Hennessy, M., Plotkin, G.: On observing nondeterminism and concurrency. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 299–308. Springer, Heidelberg (1980)
Jamroga, W.: A temporal logic for Markov chains. In: Proc. AAMAS 2008, pp. 607–704. ACM Digital Library (2008)
Joyal, A., Nielsen, M., Winskel, G.: Bisimulation from open maps. Information and Computation 127(2), 164–185 (1996)
Keeney, R., Raiffa, H.: Decisions with multiple objectives: Preferences and value tradeoffs. Wiley (1976)
McCarthy, J.: Formalizing context. In: IJCAI, pp. 555–562 (1993)
Milner, R.: Calculi for synchrony and asynchrony. Theoret. Comp. Sci. 25(3), 267–310 (1983)
Milner, R.: Communication and Concurrency. Prentice Hall, New York (1989)
O’Hearn, P., Pym, D.: The logic of bunched implications. Bulletin of Symbolic Logic 5(2), 215–244 (1999)
Ramchurn, S., Huynh, D., Jennings, N.: Trust in multi-agent systems. The Knowledge Engineering Review 19(1), 1–25 (2004)
Reynolds, J.: Separation logic: A logic for shared mutable data structures. In: Proc. 17th LICS, pp. 55–74. IEEE (2002)
Tofts, C.: Processes with probability, priority and time. Formal Aspects of Computing 6(5), 536–564 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anderson, G., Collinson, M., Pym, D. (2013). Trust Domains: An Algebraic, Logical, and Utility-Theoretic Approach. In: Huth, M., Asokan, N., Čapkun, S., Flechais, I., Coles-Kemp, L. (eds) Trust and Trustworthy Computing. Trust 2013. Lecture Notes in Computer Science, vol 7904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38908-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-38908-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38907-8
Online ISBN: 978-3-642-38908-5
eBook Packages: Computer ScienceComputer Science (R0)