The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Adaptive on-line page importance computation
WWW '03 Proceedings of the 12th international conference on World Wide Web
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Efficient search in unstructured peer-to-peer networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Efficient search for peer-to-peer information retrieval using semantic small world
Proceedings of the 15th international conference on World Wide Web
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Analysis of topological characteristics of huge online social networking services
Proceedings of the 16th international conference on World Wide Web
ACM Transactions on Computer Systems (TOCS)
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
SSW: A Small-World-Based Overlay for Peer-to-Peer Search
IEEE Transactions on Parallel and Distributed Systems
Enhancing Search Performance in Unstructured P2P Networks Based on Users' Common Interest
IEEE Transactions on Parallel and Distributed Systems
SybilGuard: defending against sybil attacks via social networks
IEEE/ACM Transactions on Networking (TON)
Brahms: byzantine resilient random membership sampling
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Social ranking: uncovering relevant content using tag-based recommender systems
Proceedings of the 2008 ACM conference on Recommender systems
A random walk method for alleviating the sparsity problem in collaborative filtering
Proceedings of the 2008 ACM conference on Recommender systems
Tag data and personalized information retrieval
Proceedings of the 2008 ACM workshop on Search in social media
Adaptive Approximate Similarity Searching through Metric Social Networks
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Self Organizing Semantic Topologies in P2P Data Integration Systems
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Rappel: Exploiting interest and network locality to improve fairness in publish-subscribe systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Epidemic-Style management of semantic overlays for content-based searching
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Clustering in p2p exchanges and consequences on performances
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Semantic overlay networks for p2p systems
AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
GROUP: a gossip based building community protocol
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Social market: combining explicit and implicit social networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
FAST: Friends Augmented Search Techniques - System Design & Data-Management Issues
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Diverging towards the common good: heterogeneous self-organisation in decentralised recommenders
Proceedings of the Fifth Workshop on Social Network Systems
Towards robust and scalable peer-to-peer social networks
Proceedings of the Fifth Workshop on Social Network Systems
Offline social networks: stepping away from the internet
Proceedings of the Fifth Workshop on Social Network Systems
Private similarity computation in distributed systems: from cryptography to differential privacy
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Semi-structured semantic overlay for information retrieval in self-organizing networks
Proceedings of the 21st international conference companion on World Wide Web
A peer-to-peer recommender system for self-emerging user communities based on gossip overlays
Journal of Computer and System Sciences
Cachet: a decentralized architecture for privacy preserving social networking with caching
Proceedings of the 8th international conference on Emerging networking experiments and technologies
BLIP: non-interactive differentially-private similarity computation on bloom filters
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
On the use of decentralization to enable privacy in web-scale recommendation services
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Trust-aware peer sampling: Performance and privacy tradeoffs
Theoretical Computer Science
| Hi-index | 0.00 |
While social networks provide news from old buddies, you can learn a lot more from people you do not know, but with whom you share many interests. We show in this paper how to build a network of anonymous social acquaintances using a gossip protocol we call Gossple, and how to leverage such a network to enhance navigation within Web 2.0 collaborative applications, à la LastFM and Delicious. Gossple nodes (users) periodically gossip digests of their interest profiles and compute their distances (in terms of interest) with respect to other nodes. This is achieved with little bandwidth and storage, fast convergence, and without revealing which profile is associated with which user. We evaluate Gossple on real traces from various Web 2.0 applications with hundreds of PlanetLab hosts and thousands of simulated nodes.