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)

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.
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
PublisherSpringer
Pages232-249
Number of pages18
VolumeLNCS 7904
ISBN (Electronic)9783642389085
ISBN (Print)9783642389078
DOIs
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
PublisherSpringer
Volume7904
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on Trust and Trustworthy Computing
Abbreviated titleTRUST 2013
CountryUnited Kingdom
CityLondon
Period17/06/1319/06/13

Fingerprint

Ecosystem
Process Algebra
Stochastic Methods
Assertion
System Modeling
Compliance
Mathematical Modeling
Complex Systems
Logic
Necessary
Dependent
Costs
Range of data
Framework
Business

Cite this

Anderson, G., Collinson, M., & Pym, D. (2013). Trust Domains: An Algebraic, Logical, and Utility-theoretic Approach. In M. Huth, N. Asokan, S. Čapkun, I. Flechais, & L. Coles-Kemp (Eds.), Trust and Trustworthy Computing: 6th International Conference, TRUST 2013, London, UK, June 17-19, 2013. Proceedings (Vol. LNCS 7904, pp. 232-249). (Lecture Notes in Computer Science; Vol. 7904). Berlin: Springer . https://doi.org/10.1007/978-3-642-38908-5

Trust Domains : An Algebraic, Logical, and Utility-theoretic Approach. / Anderson, Gabrielle; Collinson, Matthew; Pym, David.

Trust and Trustworthy Computing: 6th International Conference, TRUST 2013, London, UK, June 17-19, 2013. Proceedings. ed. / Michael Huth; N. Asokan; Srdjan Čapkun; Ivan Flechais; Lizzie Coles-Kemp. Vol. LNCS 7904 Berlin : Springer , 2013. p. 232-249 (Lecture Notes in Computer Science; Vol. 7904).

Research output: Chapter in Book/Report/Conference proceedingChapter

Anderson, G, Collinson, M & Pym, D 2013, Trust Domains: An Algebraic, Logical, and Utility-theoretic Approach. in M Huth, N Asokan, S Čapkun, I Flechais & L Coles-Kemp (eds), Trust and Trustworthy Computing: 6th International Conference, TRUST 2013, London, UK, June 17-19, 2013. Proceedings. vol. LNCS 7904, Lecture Notes in Computer Science, vol. 7904, Springer , Berlin, pp. 232-249, 6th International Conference on Trust and Trustworthy Computing, London, United Kingdom, 17/06/13. https://doi.org/10.1007/978-3-642-38908-5
Anderson G, Collinson M, Pym D. Trust Domains: An Algebraic, Logical, and Utility-theoretic Approach. In Huth M, Asokan N, Čapkun S, Flechais I, Coles-Kemp L, editors, Trust and Trustworthy Computing: 6th International Conference, TRUST 2013, London, UK, June 17-19, 2013. Proceedings. Vol. LNCS 7904. Berlin: Springer . 2013. p. 232-249. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-38908-5
Anderson, Gabrielle ; Collinson, Matthew ; Pym, David. / Trust Domains : An Algebraic, Logical, and Utility-theoretic Approach. Trust and Trustworthy Computing: 6th International Conference, TRUST 2013, London, UK, June 17-19, 2013. Proceedings. editor / Michael Huth ; N. Asokan ; Srdjan Čapkun ; Ivan Flechais ; Lizzie Coles-Kemp. Vol. LNCS 7904 Berlin : Springer , 2013. pp. 232-249 (Lecture Notes in Computer Science).
@inbook{0a2636f867f94b4e9829a8e8c86ff962,
title = "Trust Domains: An Algebraic, Logical, and Utility-theoretic Approach",
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.",
author = "Gabrielle Anderson and Matthew Collinson and David Pym",
year = "2013",
doi = "10.1007/978-3-642-38908-5",
language = "English",
isbn = "9783642389078",
volume = "LNCS 7904",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "232--249",
editor = "Michael Huth and Asokan, {N. } and Srdjan Čapkun and Ivan Flechais and Lizzie Coles-Kemp",
booktitle = "Trust and Trustworthy Computing",

}

TY - CHAP

T1 - Trust Domains

T2 - An Algebraic, Logical, and Utility-theoretic Approach

AU - Anderson, Gabrielle

AU - Collinson, Matthew

AU - Pym, David

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-38908-5

DO - 10.1007/978-3-642-38908-5

M3 - Chapter

SN - 9783642389078

VL - LNCS 7904

T3 - Lecture Notes in Computer Science

SP - 232

EP - 249

BT - Trust and Trustworthy Computing

A2 - Huth, Michael

A2 - Asokan, N.

A2 - Čapkun, Srdjan

A2 - Flechais, Ivan

A2 - Coles-Kemp, Lizzie

PB - Springer

CY - Berlin

ER -