Quantifying and Qualifying Trust: Spectral Decomposition of Trust Networks

Dusko Pavlovic

doi:10.1007/978-3-642-19751-2_1

Quantifying and Qualifying Trust: Spectral Decomposition of Trust Networks

Dusko Pavlovic

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

4 Citations (Scopus)

Abstract

In a previous FAST paper, I presented a quantitative model of the process of trust building, and showed that trust is accumulated like wealth: the rich get richer. This explained the pervasive phenomenon of adverse selection of trust certificates, as well as the fragility of trust networks in general. But a simple explanation does not always suggest a simple solution. It turns out that it is impossible to alter the fragile distribution of trust without sacrificing some of its fundamental functions. A solution for the vulnerability of trust must thus be sought elsewhere, without tampering with its distribution. This observation was the starting point of the present paper. It explores different methods for securing trust: not by redistributing, but by qualifying it. The methods used to break privacy can be used to secure trust.

Original language	English
Title of host publication	Formal Aspects of Security and Trus
Subtitle of host publication	7th International Workshop, FAST 2010, Pisa, Italy, September 16-17, 2010. Revised Selected Papers
Editors	Pierpaolo Degano, Sandro Etalle, Joshua Guttman
Place of Publication	Berlin
Publisher	Springer
Pages	1-17
Number of pages	17
ISBN (Electronic)	978-3-642-19751-2
ISBN (Print)	978-3-642-19751-2
DOIs	https://doi.org/10.1007/978-3-642-19751-2_1
Publication status	Published - Sept 2010
Event	7th International Workshop on Formal Aspects of Security and Trust, FAST 2010 - Pisa, Italy Duration: 16 Sept 2010 → 17 Sept 2010 Conference number: 7

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	6561
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Workshop

Workshop	7th International Workshop on Formal Aspects of Security and Trust, FAST 2010
Abbreviated title	FAST
Country/Territory	Italy
City	Pisa
Period	16/09/10 → 17/09/10

Keywords

SCS-Cybersecurity

Access to Document

10.1007/978-3-642-19751-2_1

Cite this

Pavlovic, D. (2010). Quantifying and Qualifying Trust: Spectral Decomposition of Trust Networks. In P. Degano, S. Etalle, & J. Guttman (Eds.), Formal Aspects of Security and Trus: 7th International Workshop, FAST 2010, Pisa, Italy, September 16-17, 2010. Revised Selected Papers (pp. 1-17). (Lecture Notes in Computer Science; Vol. 6561). Springer. https://doi.org/10.1007/978-3-642-19751-2_1

@inproceedings{a97fcc6ced5f4872bf8413d052b98bc9,

title = "Quantifying and Qualifying Trust: Spectral Decomposition of Trust Networks",

abstract = "In a previous FAST paper, I presented a quantitative model of the process of trust building, and showed that trust is accumulated like wealth: the rich get richer. This explained the pervasive phenomenon of adverse selection of trust certificates, as well as the fragility of trust networks in general. But a simple explanation does not always suggest a simple solution. It turns out that it is impossible to alter the fragile distribution of trust without sacrificing some of its fundamental functions. A solution for the vulnerability of trust must thus be sought elsewhere, without tampering with its distribution. This observation was the starting point of the present paper. It explores different methods for securing trust: not by redistributing, but by qualifying it. The methods used to break privacy can be used to secure trust.",

keywords = "SCS-Cybersecurity",

author = "Dusko Pavlovic",

year = "2010",

month = sep,

doi = "10.1007/978-3-642-19751-2_1",

language = "English",

isbn = "978-3-642-19751-2",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "1--17",

editor = "Pierpaolo Degano and Sandro Etalle and Joshua Guttman",

booktitle = "Formal Aspects of Security and Trus",

address = "Germany",

note = "7th International Workshop on Formal Aspects of Security and Trust, FAST 2010, FAST ; Conference date: 16-09-2010 Through 17-09-2010",

}

Pavlovic, D 2010, Quantifying and Qualifying Trust: Spectral Decomposition of Trust Networks. in P Degano, S Etalle & J Guttman (eds), Formal Aspects of Security and Trus: 7th International Workshop, FAST 2010, Pisa, Italy, September 16-17, 2010. Revised Selected Papers. Lecture Notes in Computer Science, vol. 6561, Springer, Berlin, pp. 1-17, 7th International Workshop on Formal Aspects of Security and Trust, FAST 2010, Pisa, Italy, 16/09/10. https://doi.org/10.1007/978-3-642-19751-2_1

Quantifying and Qualifying Trust: Spectral Decomposition of Trust Networks. / Pavlovic, Dusko.
Formal Aspects of Security and Trus: 7th International Workshop, FAST 2010, Pisa, Italy, September 16-17, 2010. Revised Selected Papers. ed. / Pierpaolo Degano; Sandro Etalle; Joshua Guttman. Berlin: Springer, 2010. p. 1-17 (Lecture Notes in Computer Science; Vol. 6561).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Quantifying and Qualifying Trust: Spectral Decomposition of Trust Networks

AU - Pavlovic, Dusko

N1 - Conference code: 7

PY - 2010/9

Y1 - 2010/9

N2 - In a previous FAST paper, I presented a quantitative model of the process of trust building, and showed that trust is accumulated like wealth: the rich get richer. This explained the pervasive phenomenon of adverse selection of trust certificates, as well as the fragility of trust networks in general. But a simple explanation does not always suggest a simple solution. It turns out that it is impossible to alter the fragile distribution of trust without sacrificing some of its fundamental functions. A solution for the vulnerability of trust must thus be sought elsewhere, without tampering with its distribution. This observation was the starting point of the present paper. It explores different methods for securing trust: not by redistributing, but by qualifying it. The methods used to break privacy can be used to secure trust.

AB - In a previous FAST paper, I presented a quantitative model of the process of trust building, and showed that trust is accumulated like wealth: the rich get richer. This explained the pervasive phenomenon of adverse selection of trust certificates, as well as the fragility of trust networks in general. But a simple explanation does not always suggest a simple solution. It turns out that it is impossible to alter the fragile distribution of trust without sacrificing some of its fundamental functions. A solution for the vulnerability of trust must thus be sought elsewhere, without tampering with its distribution. This observation was the starting point of the present paper. It explores different methods for securing trust: not by redistributing, but by qualifying it. The methods used to break privacy can be used to secure trust.

KW - SCS-Cybersecurity

U2 - 10.1007/978-3-642-19751-2_1

DO - 10.1007/978-3-642-19751-2_1

M3 - Conference contribution

SN - 978-3-642-19751-2

T3 - Lecture Notes in Computer Science

SP - 1

EP - 17

BT - Formal Aspects of Security and Trus

A2 - Degano, Pierpaolo

A2 - Etalle, Sandro

A2 - Guttman, Joshua

PB - Springer

CY - Berlin

T2 - 7th International Workshop on Formal Aspects of Security and Trust, FAST 2010

Y2 - 16 September 2010 through 17 September 2010

ER -

Pavlovic D. Quantifying and Qualifying Trust: Spectral Decomposition of Trust Networks. In Degano P, Etalle S, Guttman J, editors, Formal Aspects of Security and Trus: 7th International Workshop, FAST 2010, Pisa, Italy, September 16-17, 2010. Revised Selected Papers. Berlin: Springer. 2010. p. 1-17. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-19751-2_1

Quantifying and Qualifying Trust: Spectral Decomposition of Trust Networks

Abstract

Publication series

Workshop

Keywords

Access to Document

Fingerprint

Cite this