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


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]

CollectionsANU Research Publications
Date published: 2010
Type: Journal article
Source: SIGACT News


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