Consistent deniable lying : privacy in mobile social networks

Belle, Sebastian Kay; Waldvogel, Marcel

Consistent deniable lying : privacy in mobile social networks

Dateien

Consistent_deniable_lying.pdfGröße: 1.66 MBDownloads: 239

Datum

2008

Projekt

Traffic/Interest Hiding

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Sonstiges, textgebunden (z.B. Gutachten, Blogbeiträge)

Publikationsstatus

Published

Zusammenfassung

Social networking is moving to mobile phones. This not only means continuous access, but also allows to link virtual and physical neighbourhood in novel ways. To make such systems useful, personal data such as lists of friends and interests need to be shared with more and frequently unknown people, posing a risk to your privacy. In this paper, we present our approach to social networking, Consistent Deniable Lying (CDL). Using easy-to-understand mechanisms and tuned to this environment, it enables you to meet new friends with joint interests while limiting exposure of your private data. Not only can it be generalised to include friends of friends (transitivity) into interest search, it allows you to plausibly refute any allegations of your claimed interests. Unlike prior work, we focus on the application to similarity ﬁnding and include the novel aspects of transitivity and deniability, which are key to success in social networks.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

Soziale Netzwerke, Mobile Computing, Privatsphäre, Social Networks, Mobile Computing, Privacy

Zitieren

ISO 690

BELLE, Sebastian Kay, Marcel WALDVOGEL, 2008. Consistent deniable lying : privacy in mobile social networks

BibTex

@misc{Belle2008Consi-5553,
  year={2008},
  title={Consistent deniable lying : privacy in mobile social networks},
  author={Belle, Sebastian Kay and Waldvogel, Marcel}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5553">
    <dcterms:issued>2008</dcterms:issued>
    <dc:language>eng</dc:language>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5553"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5553/1/Consistent_deniable_lying.pdf"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Belle, Sebastian Kay</dc:contributor>
    <dc:rights>Attribution-ShareAlike 2.0 Generic</dc:rights>
    <dc:creator>Belle, Sebastian Kay</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:23Z</dc:date>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5553/1/Consistent_deniable_lying.pdf"/>
    <dcterms:title>Consistent deniable lying : privacy in mobile social networks</dcterms:title>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:abstract xml:lang="deu">Social networking is moving to mobile phones. This not only means continuous access, but also allows to link virtual and physical neighbourhood in  novel ways. To make such systems useful, personal data such as lists of friends  and interests need to be shared with more and frequently unknown people, posing  a risk to your privacy. In this paper, we present our approach to social networking, Consistent Deniable Lying (CDL). Using easy-to-understand mechanisms and  tuned to this environment, it enables you to meet new friends with joint interests  while limiting exposure of your private data. Not only can it be generalised to include  friends of friends  (transitivity) into interest search, it allows you to plausibly refute any allegations of your claimed interests. Unlike prior work, we focus on the application to similarity ﬁnding and include the novel aspects of transitivity and deniability, which are key to success in social networks.</dcterms:abstract>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-sa/2.0/"/>
    <dc:creator>Waldvogel, Marcel</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:23Z</dcterms:available>
    <dc:contributor>Waldvogel, Marcel</dc:contributor>
    <dc:format>application/pdf</dc:format>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja