TY - GEN
T1 - Declustering the itrust search and retrieval network to increase trustworthiness
AU - Badger, Christopher M.
AU - Moser, Louise E.
AU - Melliar-Smith, P. Michael
AU - Lombera, Isai Michel
AU - Chuang, Yung-Ting
PY - 2012
Y1 - 2012
N2 - The iTrust search and retrieval network aims to provide trustworthy access to information on the Web by making it difficult to censor or filter information. The declustering algorithm, presented in this paper, randomizes the network in a manner that reduces the clustering, or cliquishness, of the network. This randomization also reduces the necessary amount of cooperation between nodes by ensuring that a connection to any node is short-lived and can be replaced with a connection to another node from a large pool of known peers. Thus, the declustering algorithm reduces the expectation of cooperation among peers, which represents the degree to which the nodes rely on, or act on, information provided by their peers. In general, the smaller the expectation of cooperation, the less susceptible the network is to malicious attacks. Simulation results demonstrate that the declustering algorithm succeeds in randomizing the neighbors of a node in the network and, thus, in reducing the likelihood of malicious attacks.
AB - The iTrust search and retrieval network aims to provide trustworthy access to information on the Web by making it difficult to censor or filter information. The declustering algorithm, presented in this paper, randomizes the network in a manner that reduces the clustering, or cliquishness, of the network. This randomization also reduces the necessary amount of cooperation between nodes by ensuring that a connection to any node is short-lived and can be replaced with a connection to another node from a large pool of known peers. Thus, the declustering algorithm reduces the expectation of cooperation among peers, which represents the degree to which the nodes rely on, or act on, information provided by their peers. In general, the smaller the expectation of cooperation, the less susceptible the network is to malicious attacks. Simulation results demonstrate that the declustering algorithm succeeds in randomizing the neighbors of a node in the network and, thus, in reducing the likelihood of malicious attacks.
KW - Declustering
KW - Retrieval
KW - Search
KW - Trustworthiness
UR - http://www.scopus.com/inward/record.url?scp=84864874983&partnerID=8YFLogxK
U2 - 10.5220/0003908503120322
DO - 10.5220/0003908503120322
M3 - Conference contribution
AN - SCOPUS:84864874983
SN - 9789898565082
T3 - WEBIST 2012 - Proceedings of the 8th International Conference on Web Information Systems and Technologies
SP - 312
EP - 322
BT - WEBIST 2012 - Proceedings of the 8th International Conference on Web Information Systems and Technologies
PB - SciTePress
T2 - 8th International Conference on Web Information Systems and Technologies, WEBIST 2012
Y2 - 18 April 2012 through 21 April 2012
ER -