|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Karl Krukow, Andrew Twigg, "Distributed Approximation of Fixed-Points in Trust Structures," 2012 IEEE 32nd International Conference on Distributed Computing Systems, pp. 805-814, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 2005. | |||
| BibTex | x | ||
| @article{ 10.1109/ICDCS.2005.23, author = {Karl Krukow and Andrew Twigg}, title = {Distributed Approximation of Fixed-Points in Trust Structures}, journal ={2012 IEEE 32nd International Conference on Distributed Computing Systems}, volume = {0}, year = {2005}, issn = {1063-6927}, pages = {805-814}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCS.2005.23}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE 32nd International Conference on Distributed Computing Systems TI - Distributed Approximation of Fixed-Points in Trust Structures SN - 1063-6927 SP805 EP814 A1 - Karl Krukow, A1 - Andrew Twigg, PY - 2005 KW - null VL - 0 JA - 2012 IEEE 32nd International Conference on Distributed Computing Systems ER - | |||
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.
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.