Improving Webs of Trust Through Predetermined Graph Structure
No Thumbnail Available
Files
Date
2006-05-19
Authors
Journal Title
Series/Report No.
Journal ISSN
Volume Title
Publisher
Abstract
Parallel computing topographies and webs of trust (WoTs) share many of the same goals: minimum distance routing, an abundance of quickly determinable parallel paths, uniform structure, and fault tolerance. The structure of WoTs follows that of the social interaction between members of the WoT and are thus appropriately modeled by random graphs. However, it is the random structure of WoTs that contributes significantly to their insecurity. When using a WoT in a small, closed or secret society, such as a darknet, the random structure can be replaced with certain orderly structures, like the hypercube, which are commonly used for parallel computing networks. Imposing structure on the WoT, at its inception and throughout its lifetime, improves both security and the efficiency. To this end, I define the hypercube of trust (HoT).
Description
Keywords
public key infrastructure, web of trust, hypercube
Citation
Degree
MS
Discipline
Computer Science
