2013 IEEE 33rd International Conference on Distributed Computing Systems (2005)

Columbus, Ohio, USA

June 6, 2005 to June 10, 2005

ISSN: 1063-6927

ISBN: 0-7695-2331-5

pp: 805-814

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCS.2005.23

Karl Krukow , University of Aarhus

Andrew Twigg , University of Cambridge

ABSTRACT

<p>We consider distributed algorithms for solving a range of problems in a framework for trust in large-scale distributed systems. The framework is based on the notion of trust structures; a set of ?trust-levels? with two distinct partial orderings. In the trust model, a global trust-state is defined as the least fixed-point of a collection of local policies of nodes in the network.</p> <p>We show that it is possible to compute the global trust-state using a simple, robust and totally asynchronous distributed-algorithm. We also consider a distributed notion of proof-carrying-requests as a means of approximating the least fixed-point, enabling sound reasoning about the global trust-state without computing the exact fixed-point. Our proof-carrying-request model is different than the notion of proof-of-compliance from traditional trust-management; in particular, all proofs are efficiently verifiable or easily rejected, but, in the worst case, may require as much communication as computing the actual trust-state itself.</p>

INDEX TERMS

null

CITATION

Karl Krukow,
Andrew Twigg,
"Distributed Approximation of Fixed-Points in Trust Structures",

*2013 IEEE 33rd International Conference on Distributed Computing Systems*, vol. 00, no. , pp. 805-814, 2005, doi:10.1109/ICDCS.2005.23