Trust Domains: An Algebraic, Logical, and Utility-theoretic Approach

Gabrielle Anderson, Matthew Collinson, David Pym

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationTrust and Trustworthy Computing
Subtitle of host publication6th International Conference, TRUST 2013, London, UK, June 17-19, 2013. Proceedings
EditorsMichael Huth, N. Asokan, Srdjan Čapkun, Ivan Flechais, Lizzie Coles-Kemp
Place of PublicationBerlin
Number of pages18
VolumeLNCS 7904
ISBN (Electronic)9783642389085
ISBN (Print)9783642389078
Publication statusPublished - 2013
Event6th International Conference on Trust and Trustworthy Computing - London, United Kingdom
Duration: 17 Jun 201319 Jun 2013

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th International Conference on Trust and Trustworthy Computing
Abbreviated titleTRUST 2013
Country/TerritoryUnited Kingdom


Dive into the research topics of 'Trust Domains: An Algebraic, Logical, and Utility-theoretic Approach'. Together they form a unique fingerprint.

Cite this