About: A Memory Efficient Privacy Preserving Representation of Connection Graphs

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Memory Efficient Privacy Preserving Representation of Connection Graphs Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://dl.acm.org/citation.cfm?id=2602947
Description	Connection graphs are often used for network traffic classification and P2P networks analysis. With the appearance of Software Defined Networks (SDN), a novel approach to proactive distributed network management based on multi-agent paradigm, there is a need to develop specialized graph representations. Once transmitted between elements of SDN network, they provide answers to specific queries while protecting other information about the graph. In this paper we propose one such graph representation based on Bloom Filters and show that it provides considerable reduction of required memory and strong privacy while keeping low false positive rate that does not have negative impact on its intended use. Connection graphs are often used for network traffic classification and P2P networks analysis. With the appearance of Software Defined Networks (SDN), a novel approach to proactive distributed network management based on multi-agent paradigm, there is a need to develop specialized graph representations. Once transmitted between elements of SDN network, they provide answers to specific queries while protecting other information about the graph. In this paper we propose one such graph representation based on Bloom Filters and show that it provides considerable reduction of required memory and strong privacy while keeping low false positive rate that does not have negative impact on its intended use. (en)
Title	A Memory Efficient Privacy Preserving Representation of Connection Graphs A Memory Efficient Privacy Preserving Representation of Connection Graphs (en)
skos:prefLabel	A Memory Efficient Privacy Preserving Representation of Connection Graphs A Memory Efficient Privacy Preserving Representation of Connection Graphs (en)
skos:notation	RIV/68407700:21230/14:00224213!RIV15-MSM-21230___
http://linked.open...avai/riv/aktivita	I
http://linked.open...avai/riv/aktivity	I
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Pevný, Tomáš Rehák, Martin Jusko, Ján
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	813
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/14:00224213
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	bloom; preserving privacy; graph (en)
http://linked.open.../riv/klicoveSlovo	graph preserving privacy bloom
http://linked.open...ontrolniKodProRIV	[FA6E3F7D968E]
http://linked.open...v/mistoKonaniAkce	Paris
http://linked.open...i/riv/mistoVydani	New York
http://linked.open...i/riv/nazevZdroje	ACySE '14 Proceedings of the 1st International Workshop on Agents and CyberSecurity
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Pevný, Tomáš Rehák, Martin Jusko, Ján
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-05-06 (xsd:date)
number of pages	8 (xsd:int)
http://bibframe.org/vocab/doi	10.1145/2602945.2602947
http://purl.org/ne...btex#hasPublisher	ACM
https://schema.org/isbn	978-1-4503-2728-2
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software