The complexity of fixed point models of trust in distributed networks

DOI10.1016/J.TCS.2007.09.007MaRDI QIDQ2463564zbMATH OpenOpenAlexFDO

Authors Andrew Twigg, Karl Krukow

Publication date 14 December 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.09.007

zbMATH Keywords

distributed networksfixed point computationproof carrying requeststrust models

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Information Security
• Trust and trustworthiness in networked exchange
• An analysis of the exponential decay principle in probabilistic trust models

Cites work

• Communication Complexity
• scientific article; zbMATH DE number 439891 (Why is no real title available?)
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• The complexity of fixed point models of trust in distributed networks
• Theory Is Forever

Cited in

(2)

• The complexity of fixed point models of trust in distributed networks
• SCLP for Trust Propagation in Small-World Networks

This page was built for publication: The complexity of fixed point models of trust in distributed networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463564)