Bounding trust under uncertain topology information in reputation-based trust systems

Xi Gong, Ting Yu, Adam J. Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Reputation-based trust evaluation relies on the feedback of an entity's past interactions to estimate its trustworthiness for future behavior. Past work commonly assumes that all the information needed in trust evaluation is always available, which, unfortunately, often does not hold in practice, due to a variety of reasons. A key problem is thus to study the quality of trust evaluation in the presence of incomplete information. In this paper, we investigate techniques to bound the output of a trust evaluation under uncertain graph topologies of a reputation system. We present a rigorous formalism of the problem, and establish connections between uncertain topology information and missing feedback information through a property called edge reducibility. We show that the trust bounding problem can be efficiently solved if a trust function is edge reducible.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages643-648
Number of pages6
Volume7923 LNCS
DOIs
Publication statusPublished - 16 Jul 2013
Externally publishedYes
Event14th International Conference on Web-Age Information Management, WAIM 2013 - Beidaihe, China
Duration: 14 Jun 201316 Jun 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7923 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other14th International Conference on Web-Age Information Management, WAIM 2013
CountryChina
CityBeidaihe
Period14/6/1316/6/13

Fingerprint

Topology
Feedback
Evaluation
Reputation System
Trustworthiness
Reducibility
Incomplete Information
Reputation
Output
Graph in graph theory
Interaction
Estimate

Keywords

  • Reputation
  • Trust Bounding
  • Trust management

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Gong, X., Yu, T., & Lee, A. J. (2013). Bounding trust under uncertain topology information in reputation-based trust systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7923 LNCS, pp. 643-648). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7923 LNCS). https://doi.org/10.1007/978-3-642-38562-9-65

Bounding trust under uncertain topology information in reputation-based trust systems. / Gong, Xi; Yu, Ting; Lee, Adam J.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7923 LNCS 2013. p. 643-648 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7923 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gong, X, Yu, T & Lee, AJ 2013, Bounding trust under uncertain topology information in reputation-based trust systems. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7923 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7923 LNCS, pp. 643-648, 14th International Conference on Web-Age Information Management, WAIM 2013, Beidaihe, China, 14/6/13. https://doi.org/10.1007/978-3-642-38562-9-65
Gong X, Yu T, Lee AJ. Bounding trust under uncertain topology information in reputation-based trust systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7923 LNCS. 2013. p. 643-648. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-38562-9-65
Gong, Xi ; Yu, Ting ; Lee, Adam J. / Bounding trust under uncertain topology information in reputation-based trust systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7923 LNCS 2013. pp. 643-648 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{8f914d13f8804f589603ed688ad12517,
title = "Bounding trust under uncertain topology information in reputation-based trust systems",
abstract = "Reputation-based trust evaluation relies on the feedback of an entity's past interactions to estimate its trustworthiness for future behavior. Past work commonly assumes that all the information needed in trust evaluation is always available, which, unfortunately, often does not hold in practice, due to a variety of reasons. A key problem is thus to study the quality of trust evaluation in the presence of incomplete information. In this paper, we investigate techniques to bound the output of a trust evaluation under uncertain graph topologies of a reputation system. We present a rigorous formalism of the problem, and establish connections between uncertain topology information and missing feedback information through a property called edge reducibility. We show that the trust bounding problem can be efficiently solved if a trust function is edge reducible.",
keywords = "Reputation, Trust Bounding, Trust management",
author = "Xi Gong and Ting Yu and Lee, {Adam J.}",
year = "2013",
month = "7",
day = "16",
doi = "10.1007/978-3-642-38562-9-65",
language = "English",
isbn = "9783642385612",
volume = "7923 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "643--648",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Bounding trust under uncertain topology information in reputation-based trust systems

AU - Gong, Xi

AU - Yu, Ting

AU - Lee, Adam J.

PY - 2013/7/16

Y1 - 2013/7/16

N2 - Reputation-based trust evaluation relies on the feedback of an entity's past interactions to estimate its trustworthiness for future behavior. Past work commonly assumes that all the information needed in trust evaluation is always available, which, unfortunately, often does not hold in practice, due to a variety of reasons. A key problem is thus to study the quality of trust evaluation in the presence of incomplete information. In this paper, we investigate techniques to bound the output of a trust evaluation under uncertain graph topologies of a reputation system. We present a rigorous formalism of the problem, and establish connections between uncertain topology information and missing feedback information through a property called edge reducibility. We show that the trust bounding problem can be efficiently solved if a trust function is edge reducible.

AB - Reputation-based trust evaluation relies on the feedback of an entity's past interactions to estimate its trustworthiness for future behavior. Past work commonly assumes that all the information needed in trust evaluation is always available, which, unfortunately, often does not hold in practice, due to a variety of reasons. A key problem is thus to study the quality of trust evaluation in the presence of incomplete information. In this paper, we investigate techniques to bound the output of a trust evaluation under uncertain graph topologies of a reputation system. We present a rigorous formalism of the problem, and establish connections between uncertain topology information and missing feedback information through a property called edge reducibility. We show that the trust bounding problem can be efficiently solved if a trust function is edge reducible.

KW - Reputation

KW - Trust Bounding

KW - Trust management

UR - http://www.scopus.com/inward/record.url?scp=84880026540&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880026540&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-38562-9-65

DO - 10.1007/978-3-642-38562-9-65

M3 - Conference contribution

SN - 9783642385612

VL - 7923 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 643

EP - 648

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -