The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
The official PGP user's guide
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
IBM Systems Journal
Graph Theoretic and Spectral Analysis of Enron Email Data
Computational & Mathematical Organization Theory
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed quota enforcement for spam control
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
I tube, you tube, everybody tubes: analyzing the world's largest user generated content video system
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Addressing email loss with SureMail: measurement, design, and evaluation
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
SybilGuard: defending against sybil attacks via social networks
IEEE/ACM Transactions on Networking (TON)
Sybil-resilient online content voting
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
On the evolution of user interaction in Facebook
Proceedings of the 2nd ACM workshop on Online social networks
Impact of altruism on opportunistic communications
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
Poster abstract: a secure P2P SIP system with SPAM prevention
ACM SIGMOBILE Mobile Computing and Communications Review
Selfishness, altruism and message spreading in mobile social networks
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Hermes: clustering users in large-scale e-mail services
Proceedings of the 1st ACM symposium on Cloud computing
FRAME: an innovative incentive scheme in vehicular networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Privacy-preserving P2P data sharing with OneSwarm
Proceedings of the ACM SIGCOMM 2010 conference
An analysis of social network-based Sybil defenses
Proceedings of the ACM SIGCOMM 2010 conference
On managing social data for enabling socially-aware applications and services
Proceedings of the 3rd Workshop on Social Network Systems
SybilLimit: a near-optimal social network defense against sybil attacks
IEEE/ACM Transactions on Networking (TON)
Bazaar: strengthening user reputations in online marketplaces
Proceedings of the 8th USENIX conference on Networked systems design and implementation
Personalized social recommendations: accurate or private
Proceedings of the VLDB Endowment
Vulnerability in socially-informed peer-to-peer systems
Proceedings of the 4th Workshop on Social Network Systems
Liquidity in credit networks: a little trust goes a long way
Proceedings of the 12th ACM conference on Electronic commerce
Prometheus: user-controlled P2P social data management for socially-aware applications
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Sybil defenses via social networks: a tutorial and survey
ACM SIGACT News
Social market: combining explicit and implicit social networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Comparing linkage graph and activity graph of online social networks
SocInfo'11 Proceedings of the Third international conference on Social informatics
Understanding Crowds' Migration on the Web
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Decentralized polling with respectable participants
Journal of Parallel and Distributed Computing
Canal: scaling social network-based Sybil tolerance schemes
Proceedings of the 7th ACM european conference on Computer Systems
Strategic formation of credit networks
Proceedings of the 21st international conference on World Wide Web
Scaling microblogging services with divergent traffic demands
Middleware'11 Proceedings of the 12th ACM/IFIP/USENIX international conference on Middleware
Addressing common vulnerabilities of reputation systems for electronic commerce
Journal of Theoretical and Applied Electronic Commerce Research
Evolution of social-attribute networks: measurements, modeling, and implications using google+
Proceedings of the 2012 ACM conference on Internet measurement conference
Defending against large-scale crawls in online social networks
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Scaling microblogging services with divergent traffic demands
Proceedings of the 12th International Middleware Conference
Trust-aware peer sampling: Performance and privacy tradeoffs
Theoretical Computer Science
| Hi-index | 0.00 |
Online communication media such as email, instant messaging, bulletin boards, voice-over-IP, and social networking sites allow any sender to reach potentially millions of users at near zero marginal cost. This property enables information to be exchanged freely: anyone with Internet access can publish content. Unfortunately, the same property opens the door to unwanted communication, marketing, and propaganda. Examples include email spam, Web search engine spam, inappropriately labeled content on YouTube, and unwanted contact invitations in Skype. Unwanted communication wastes one of the most valuable resources in the information age: human attention. In this paper, we explore the use of trust relationships, such as social links, to thwart unwanted communication. Such relationships already exist in many application settings today. Our system, Ostra, bounds the total amount of unwanted communication a user can produce based on the number of trust relationships the user has, and relies on the fact that it is difficult for a user to create arbitrarily many trust relationships. Ostra is applicable to both messaging systems such as email and content-sharing systems such as YouTube. It does not rely on automatic classification of content, does not require global user authentication, respects each recipient's idea of unwanted communication, and permits legitimate communication among parties who have not had prior contact. An evaluation based on data gathered from an online social networking site shows that Ostra effectively thwarts unwanted communication while not impeding legitimate communication.