The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
ACM Transactions on Computer Systems (TOCS)
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Analysis of topological characteristics of huge online social networking services
Proceedings of the 16th international conference on World Wide Web
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
ACM Transactions on Computer Systems (TOCS)
Trust-aware recommender systems
Proceedings of the 2007 ACM conference on Recommender systems
Ostra: leveraging trust to thwart unwanted communication
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
SybilGuard: defending against sybil attacks via social networks
IEEE/ACM Transactions on Networking (TON)
TrustWalker: a random walk model for combining trust-based and item-based recommendation
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Controversial users demand local trust metrics: an experimental study on Epinions.com community
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
SUNNY: a new algorithm for trust inference in social networks using probabilistic confidence models
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
P2P trading in social networks: the value of staying connected
INFOCOM'10 Proceedings of the 29th conference on Information communications
GoDisco: selective gossip based dissemination of information in social community based overlays
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
SybilLimit: a near-optimal social network defense against sybil attacks
IEEE/ACM Transactions on Networking (TON)
The GOSSPLE anonymous social network
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Social market: combining explicit and implicit social networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Epidemic-Style management of semantic overlays for content-based searching
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Bayesian network trust model in peer-to-peer networks
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
Anonymous connections and onion routing
IEEE Journal on Selected Areas in Communications
Hi-index | 5.23 |
The ability to identify people that share one's own interests is one of the most interesting promises of the Web 2.0 driving user-centric applications such as recommendation systems or collaborative marketplaces. To be truly useful, however, information about other users also needs to be associated with some notion of trust. Consider a user wishing to sell a concert ticket. Not only must she find someone who is interested in the concert, but she must also make sure she can trust this person to pay for it. This paper addresses the need for trust in user-centric applications by proposing two novel distributed protocols that combine interest-based connections between users with explicit links obtained from social networks a-la Facebook. Both protocols build trusted multi-hop paths between users in an explicit social network supporting the creation of semantic overlays backed up by social trust. The first protocol, TAPS2, extends our previous work on TAPS (Trust-Aware Peer Sampling), by improving the ability to locate trusted nodes. Yet, it remains vulnerable to attackers wishing to learn about trust values between arbitrary pairs of users. The second protocol, PTAPS (Private TAPS), improves TAPS2 with provable privacy guarantees by preventing users from revealing their friendship links to users that are more than two hops away in the social network. In addition to proving this privacy property, we evaluate the performance of our protocols through event-based simulations, showing significant improvements over the state of the art.