Improving Webs of Trust Through Predetermined Graph Structure

Show full item record

Title: Improving Webs of Trust Through Predetermined Graph Structure
Author: Kohler, Damon
Advisors: Dr. Ting Yu, Committee Member
Dr. Khaled Harfoush, Committee Member
Dr. S. Purushothaman Iyer, Committee Chair
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).
Date: 2006-05-19
Degree: MS
Discipline: Computer Science
URI: http://www.lib.ncsu.edu/resolver/1840.16/617


Files in this item

Files Size Format View
etd.pdf 229.6Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record