Data Protection for Online Social Networks and P -Stability for Graphs

dc.contributor.authorTorra, Vicenc
dc.contributor.authorShafie, Termeh
dc.contributor.authorSalas, Julian
dc.date.accessioned2017-02-09T09:09:12Z
dc.date.available2017-02-09T09:09:12Z
dc.date.issued2016eng
dc.description.abstractGraphs can be used as a model for online social networks. In this framework, vertices represent individuals and edges relationships between individuals. In recent years, different approaches have been considered to offer data privacy to online social networks and for developing graph protection. Perturbative approaches are formally defined in terms of perturbation and modification of graphs. In this paper, we discuss the concept of P -stability on graphs and its relation to data privacy. The concept of P -stability is rooted in the number of graphs given a fixed degree sequence. In this paper, we show that for any graph there exists a class of P -stable graphs. This result implies that there is a fully polynomial randomized approximation for graph masking for the graphs in the class. In order to further refine the classification of a given graph, we introduce the concept of natural class of a graph. It is based on a class of scale-free networks.eng
dc.description.versionpublishedde
dc.identifier.doi10.1109/TETC.2015.2433923eng
dc.identifier.urihttps://kops.uni-konstanz.de/handle/123456789/37251
dc.language.isoengeng
dc.subject.ddc004eng
dc.titleData Protection for Online Social Networks and P -Stability for Graphseng
dc.typeJOURNAL_ARTICLEde
dspace.entity.typePublication
kops.citation.bibtex
@article{Torra2016Prote-37251,
  year={2016},
  doi={10.1109/TETC.2015.2433923},
  title={Data Protection for Online Social Networks and P -Stability for Graphs},
  number={3},
  volume={4},
  journal={IEEE Transactions on Emerging Topics in Computing},
  pages={374--381},
  author={Torra, Vicenc and Shafie, Termeh and Salas, Julian}
}
kops.citation.iso690TORRA, Vicenc, Termeh SHAFIE, Julian SALAS, 2016. Data Protection for Online Social Networks and P -Stability for Graphs. In: IEEE Transactions on Emerging Topics in Computing. 2016, 4(3), pp. 374-381. eISSN 2168-6750. Available under: doi: 10.1109/TETC.2015.2433923deu
kops.citation.iso690TORRA, Vicenc, Termeh SHAFIE, Julian SALAS, 2016. Data Protection for Online Social Networks and P -Stability for Graphs. In: IEEE Transactions on Emerging Topics in Computing. 2016, 4(3), pp. 374-381. eISSN 2168-6750. Available under: doi: 10.1109/TETC.2015.2433923eng
kops.citation.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/37251">
    <dc:language>eng</dc:language>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Shafie, Termeh</dc:creator>
    <dc:creator>Torra, Vicenc</dc:creator>
    <dc:contributor>Torra, Vicenc</dc:contributor>
    <dc:contributor>Salas, Julian</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/37251"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-02-09T09:09:12Z</dcterms:available>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:abstract xml:lang="eng">Graphs can be used as a model for online social networks. In this framework, vertices represent individuals and edges relationships between individuals. In recent years, different approaches have been considered to offer data privacy to online social networks and for developing graph protection. Perturbative approaches are formally defined in terms of perturbation and modification of graphs. In this paper, we discuss the concept of P -stability on graphs and its relation to data privacy. The concept of P -stability is rooted in the number of graphs given a fixed degree sequence. In this paper, we show that for any graph there exists a class of P -stable graphs. This result implies that there is a fully polynomial randomized approximation for graph masking for the graphs in the class. In order to further refine the classification of a given graph, we introduce the concept of natural class of a graph. It is based on a class of scale-free networks.</dcterms:abstract>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-02-09T09:09:12Z</dc:date>
    <dc:creator>Salas, Julian</dc:creator>
    <dcterms:issued>2016</dcterms:issued>
    <dc:contributor>Shafie, Termeh</dc:contributor>
    <dcterms:title>Data Protection for Online Social Networks and P -Stability for Graphs</dcterms:title>
  </rdf:Description>
</rdf:RDF>
kops.flag.knbibliographytrue
kops.sourcefieldIEEE Transactions on Emerging Topics in Computing. 2016, <b>4</b>(3), pp. 374-381. eISSN 2168-6750. Available under: doi: 10.1109/TETC.2015.2433923deu
kops.sourcefield.plainIEEE Transactions on Emerging Topics in Computing. 2016, 4(3), pp. 374-381. eISSN 2168-6750. Available under: doi: 10.1109/TETC.2015.2433923deu
kops.sourcefield.plainIEEE Transactions on Emerging Topics in Computing. 2016, 4(3), pp. 374-381. eISSN 2168-6750. Available under: doi: 10.1109/TETC.2015.2433923eng
relation.isAuthorOfPublicationb355b912-413f-4b09-92f1-cec3be857191
relation.isAuthorOfPublication.latestForDiscoveryb355b912-413f-4b09-92f1-cec3be857191
source.bibliographicInfo.fromPage374eng
source.bibliographicInfo.issue3eng
source.bibliographicInfo.toPage381eng
source.bibliographicInfo.volume4eng
source.identifier.eissn2168-6750eng
source.periodicalTitleIEEE Transactions on Emerging Topics in Computingeng

Dateien