Skip navigation
Skip navigation

Formal definitions and complexity results for trust relations and trust domains fit for TTPs, the Web of Trust, PKIs, and ID-Based Cryptography

Kramer, Simon; Gore, Rajeev; Okamoto, Eiji

Description

We propose computational, declarative definitions of the concepts of weak and strong trust relations between interacting agents, and trust domains of trust-related agents in distributed systems. Our definitions yield computational complexity results for deciding potential and actual trust relationships and membership in trust domains. We instantiate our trust concepts in four major applications of trust, namely: Trusted Third Parties (TTPs), the Web of Trust, Public-Key Infrastructures...[Show more]

dc.contributor.authorKramer, Simon
dc.contributor.authorGore, Rajeev
dc.contributor.authorOkamoto, Eiji
dc.date.accessioned2021-03-26T03:09:39Z
dc.identifier.issn0163-5700
dc.identifier.urihttp://hdl.handle.net/1885/227870
dc.description.abstractWe propose computational, declarative definitions of the concepts of weak and strong trust relations between interacting agents, and trust domains of trust-related agents in distributed systems. Our definitions yield computational complexity results for deciding potential and actual trust relationships and membership in trust domains. We instantiate our trust concepts in four major applications of trust, namely: Trusted Third Parties (TTPs), the Web of Trust, Public-Key Infrastructures (PKIs), and Identity-Based Cryptography. Finally, we point out computational means for building trust, and by that, building up trust relations and trust domains. Our defining principle for weak and strong trust is (common) belief in and knowledge of agent correctness, respectively.
dc.format.mimetypeapplication/pdf
dc.language.isoen_AU
dc.publisherAssociation for Computing Machinery Inc (ACM)
dc.rights© Simon Kramer, Rajeev Gore, Eiji Okamoto, 2010
dc.sourceSIGACT News
dc.titleFormal definitions and complexity results for trust relations and trust domains fit for TTPs, the Web of Trust, PKIs, and ID-Based Cryptography
dc.typeJournal article
local.description.notesImported from ARIES
local.identifier.citationvolume41
dc.date.issued2010
local.identifier.absfor080203 - Computational Logic and Formal Languages
local.identifier.ariespublicationu3968803xPUB12
local.publisher.urlhttp://www.sigact.org/pubs.php
local.type.statusPublished Version
local.contributor.affiliationKramer, Simon, University of Tsukuba
local.contributor.affiliationGore, Rajeev, College of Engineering and Computer Science, ANU
local.contributor.affiliationOkamoto, Eiji, University of Tsukuba
local.description.embargo2099-12-31
local.bibliographicCitation.issue1
local.bibliographicCitation.startpage75
local.bibliographicCitation.lastpage98
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
dc.date.updated2020-11-22T07:29:42Z
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Kramer_Formal_definitions_and_2010.pdf802.78 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator