SmokeScreen: flexible privacy controls for presence-sharing
Proceedings of the 5th international conference on Mobile systems, applications and services
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Davis social links: integrating social networks with internet routing
Proceedings of the 2007 workshop on Large scale attack defense
Exploiting network structure for proactive spam mitigation
SS'07 Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium
Addressing email loss with SureMail: measurement, design, and evaluation
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Ostra: leveraging trust to thwart unwanted communication
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Peeking into spammer behavior from a unique vantage point
LEET'08 Proceedings of the 1st Usenix Workshop on Large-Scale Exploits and Emergent Threats
Lockr: social access control for web 2.0
Proceedings of the first workshop on Online social networks
Friendstore: cooperative online backup using trusted nodes
Proceedings of the 1st Workshop on Social Network Systems
Thwarting E-mail Spam Laundering
ACM Transactions on Information and System Security (TISSEC)
User interactions in social networks and their implications
Proceedings of the 4th ACM European conference on Computer systems
Design and Implementation of Davis Social Links OSN Kernel
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Scalable proximity estimation and link prediction in online social networks
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Lockr: better privacy for social networks
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Privacy-Preserving Relationship Path Discovery in Social Networks
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Measurement-calibrated graph models for social network experiments
Proceedings of the 19th international conference on World wide web
A collaboration-based autonomous reputation system for email services
INFOCOM'10 Proceedings of the 29th conference on Information communications
Collaborative, privacy-preserving data aggregation at scale
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Toward a behavioral approach to privacy for online social networks
SocInfo'10 Proceedings of the Second international conference on Social informatics
Prometheus: user-controlled P2P social data management for socially-aware applications
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
Comparing linkage graph and activity graph of online social networks
SocInfo'11 Proceedings of the Third international conference on Social informatics
Sharing graphs using differentially private graph models
Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference
Measurement and evaluation of a real world deployment of a challenge-response spam filter
Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference
A new closeness metric for social networks based on the k shortest paths
ISNN'10 Proceedings of the 7th international conference on Advances in Neural Networks - Volume Part II
Clustered embedding of massive social networks
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Survey: DNA-inspired information concealing: A survey
Computer Science Review
Efficient cooperative backup with decentralized trust management
ACM Transactions on Storage (TOS)
Beyond Social Graphs: User Interactions in Online Social Networks and their Implications
ACM Transactions on the Web (TWEB)
CIUCEU: Multi-Agent-Based Simulation of University Email Communities
International Journal of Agent Technologies and Systems
SocialWatch: detection of online service abuse via large-scale social graphs
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
The self-feeding process: a unifying model for communication dynamics in the web
Proceedings of the 22nd international conference on World Wide Web
Understanding latent interactions in online social networks
ACM Transactions on the Web (TWEB)
Trust-aware peer sampling: Performance and privacy tradeoffs
Theoretical Computer Science
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
The explosive growth in unwanted email has prompted the development of techniques for the rejection of email, intended to shield recipients from the onerous task of identifying the legitimate email in their inboxes amid a sea of spam. Unfortunately, widely used content-based filtering systems have converted the spam problem into a false positive one: email has become unreliable. Email acceptance techniques complement rejection ones; they can help prevent false positives by filing email into a user's inbox before it is considered for rejection. Whitelisting, whereby recipients accept email from some set of authorized senders, is one such acceptance technique. We present Reliable Email (RE:), a new whitelisting system that incurs zero false positives among socially connected users. Unlike previous whitelisting systems, which require that whitelists be populated manually, RE: exploits friend-of-friend relationships among email correspondents to populate whitelists automatically. To do so, RE: permits an email's recipient to discover whether other email users have whitelisted the email's sender, while preserving the privacy of users' email contacts with cryptographic private matching techniques. Using real email traces from two sites, we demonstrate that RE: renders a significant fraction of received email reliable. Our evaluation also shows that RE: can prevent up to 88% of the false positives incurred by a widely deployed email rejection system, at modest computational cost.