All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A Memory Efficient Privacy Preserving Representation of Connection Graphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00224213" target="_blank" >RIV/68407700:21230/14:00224213 - isvavai.cz</a>

  • Alternative codes found

    RIV/28943601:_____/14:#0000005

  • Result on the web

    <a href="http://dl.acm.org/citation.cfm?id=2602947" target="_blank" >http://dl.acm.org/citation.cfm?id=2602947</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/2602945.2602947" target="_blank" >10.1145/2602945.2602947</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Memory Efficient Privacy Preserving Representation of Connection Graphs

  • Original language 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 aneed 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 basedon 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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/VG20122014086" target="_blank" >VG20122014086: Applied research of a metod of an efficient management of network security of data centers, servers and cloud services verified by practical measurements</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2014

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    ACySE '14 Proceedings of the 1st International Workshop on Agents and CyberSecurity

  • ISBN

    978-1-4503-2728-2

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

  • Publisher name

    ACM

  • Place of publication

    New York

  • Event location

    Paris

  • Event date

    May 6, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article