Cooperative peer groups in NICE

@inproceedings{lee-et-al-03, abstract = {A distributed scheme for trust inference in peer-to-peer networks is presented. Our work is in context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify noncooperative users in NICE. We present a simulation based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly, we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious.}, author = {Lee, S. and Sherwood, R. and Bhattacharjee, Bobby }, citeulike-article-id = {1197287}, comment = {Broadcast search on WoT to find trust paths, plus Bloom Filters to implement neighbor-of-neighbor routing.}, journal = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE}, keywords = {nice, reputation, trust-path}, pages = {1272--1282 vol.2}, posted-at = {2008-01-29 13:26:33}, priority = {0}, title = {Cooperative peer groups in NICE}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1208963}, volume = {2}, year = {2003} }

TY - CONF ID - lee-et-al-03 L3 - citeulike-article-id:1197287 TI - Cooperative peer groups in NICE JF - INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE VL - 2 SP - 1272 EP - 1282 vol.2 N2 - A distributed scheme for trust inference in peer-to-peer networks is presented. Our work is in context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify noncooperative users in NICE. We present a simulation based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly, we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious. KW - nice KW - reputation KW - trust-path N1 - Broadcast search on WoT to find trust paths, plus Bloom Filters to implement neighbor-of-neighbor routing. AU - Lee, S AU - Sherwood, R AU - Bhattacharjee, Bobby PY - 2003/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1208963 ER -