![]() |
|
||||||
Type of Document Master's Thesis Author Kohler, Damon , Author's Email Address dakohler@ncsu.edu URN etd-05182006-143950 Title Improving Webs of Trust Through Predetermined Graph Structure Degree Master of Science Graduate Program Computer Science Advisory Committee
Advisor Name Title Dr. S. Purushothaman Iyer Committee Chair Dr. Khaled Harfoush Committee Member Dr. Ting Yu Committee Member Keywords
- public key infrastructure
- web of trust
- hypercube
Date of Defense 2006-05-15 Availability unrestricted Abstract Parallel computing topographies and webs of trust (WoTs) share many ofthe 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).
Files
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access etd.pdf 235.13 Kb 00:01:05 00:00:33 00:00:29 00:00:14 00:00:01