direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Es gibt keine deutsche Übersetzung dieser Webseite.

Publications by Type: Conference and Workshop Publications

see also conference papers, workshop papers, demos, and posters. (under construction)

To Add or not to Add: Privacy and Social Honeypots
Zitatschlüssel HH-TAONTAPSH-10
Autor Haddadi, Hamed and Hui, Pan
Buchtitel Proceedings of First IEEE International Workshop on Social Networks
Seiten 1–5
Jahr 2010
ISBN 978-1-4244-6824-9
DOI http://dx.doi.org/10.1109/ICCW.2010.5503929
Ort Cape Town, South Africa
Adresse New York, NY, USA
Monat May
Notiz Invited paper
Verlag IEEE
Zusammenfassung Online Social Networks (OSNs) have become a mainstream cultural phenomenon in the past years, where million of people connect to each other and share memories, digital media and business relations. Many users also publish personal information about their activities, relationships, locations and interests on these sites, seemingly unaware of how these data can be used by other parties. Sites typically attempt to restrict data-sharing to members of a user's social network, but this is only effective if these social networks cannot be exploited by malicious users. In this paper we perform an experiment in order to assess the vulnerability and privacy awareness of users when engaging in online relations with random unknown users, or those pretending to be a famous character. We find that usually users do not accept random friendship requests, but some aggressively search for celebrities, making a perfect case for spammers to form honeypots using such fake profiles. We present a set of suggestions for enhancing privacy on social networks which could reduce the threats of identity theft in such environments.
Link zur Publikation Download Bibtex Eintrag

Zusatzinformationen / Extras

Direktzugang:

Schnellnavigation zur Seite über Nummerneingabe

Under Construction

This page/section is
still under construc-
tion. Please try again
later.