Generalizing data to provide anonymity when disclosing information (abstract)
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Communications of the ACM
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
A study of preferences for sharing and privacy
CHI '05 Extended Abstracts on Human Factors in Computing Systems
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Fundamental Limits on the Anonymity Provided by the MIX Technique
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Towards a model of understanding social search
Proceedings of the 2008 ACM conference on Computer supported cooperative work
Vida: How to Use Bayesian Inference to De-anonymize Persistent Communications
PETS '09 Proceedings of the 9th International Symposium on Privacy Enhancing Technologies
Inferring privacy policies for social networking services
Proceedings of the 2nd ACM workshop on Security and artificial intelligence
Towards an information theoretic metric for anonymity
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Efficient k-anonymization using clustering techniques
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Differential privacy: a survey of results
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Statistical disclosure or intersection attacks on anonymity systems
IH'04 Proceedings of the 6th international conference on Information Hiding
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Imagined communities: awareness, information sharing, and privacy on the facebook
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
k-indistinguishable traffic padding in web applications
PETS'12 Proceedings of the 12th international conference on Privacy Enhancing Technologies
| Hi-index | 0.00 |
Personalised social search is a promising avenue to increase the relevance of search engine results by making use of recommendations made by friends in a social network. More generally a whole class of systems take user preferences, aggregate and process them, before providing a view of the result to others in a social network. Yet, those systems present privacy risks, and could be used by spammers to propagate their malicious preferences. We present a general framework to preserve privacy while maximizing the benefit of sharing information in a social network, as well as a concrete proposal making use of cohesive social group concepts from social network analysis. We show that privacy can be guaranteed in a k-anonymity manner, and disruption through spam is kept to a minimum in a real world social network.