S4h is a peer-to-peer search engine with explicit trust. By using a complaint-based reputation system in conjunction with the established peer-to-peer building block of a Kademlia-based distributed hash table, the search engine is built with the ability to use indirect knowledge to remove peers that act maliciously, thereby minimizing common attacks against search engines including censorship and promoting. I developed an implementation of the design and ran experiments to validate that the combined behavior works as the reputation system expects.
|Commitee:||Holzbauer, Buster, Adali, Sibel|
|School:||Rensselaer Polytechnic Institute|
|School Location:||United States -- New York|
|Source:||MAI 81/1(E), Masters Abstracts International|
|Keywords:||Kademlia, Peer-to-peer, Reputation, S4h, Search, Trust|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be