Poster: privacy-preserving profile similarity computation in online social networks

Authors:
Arjan Jeckmans;Qiang Tang;Pieter Hartel
Affiliations:
University of Twente, Enschede, Netherlands;University of Twente, Enschede, Netherlands;University of Twente, Enschede, Netherlands
Venue:
Proceedings of the 18th ACM conference on Computer and communications security
Year:
2011

Citing 7
Cited 0

A public key cryptosystem and a signature scheme based on discrete logarithms

Proceedings of CRYPTO 84 on Advances in cryptology
NOYB: privacy in online social networks

Proceedings of the first workshop on Online social networks
FlyByNight: mitigating the privacy risks of social networking

Proceedings of the 7th ACM workshop on Privacy in the electronic society
Characterizing user behavior 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
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
User-friendly matching protocol for online social networks

Proceedings of the 17th ACM conference on Computer and communications security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Currently, none of the existing online social networks (OSNs) enables its users to make new friends without revealing their private information. This leaves the users in a vulnerable position when searching for new friends. We propose a solution which enables a user to compute her profile similarity with another user in a privacy-preserving way. Our solution is designed for a realistic OSN environment, where a pair of users is unlikely to be online at the same time.