Communications in Unknown Networks: Preserving the Secret of Topology

Cryptography investigates security aspects of data distributed in a network. This kind of security does not protect the secrecy of the network topology against being discovered if some kind of communication has to be established. But there are several scenarios where even the network topology has to...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Hinkelmann, Markus, Jakoby, Andreas
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 169
container_issue
container_start_page 155
container_title
container_volume
creator Hinkelmann, Markus
Jakoby, Andreas
description Cryptography investigates security aspects of data distributed in a network. This kind of security does not protect the secrecy of the network topology against being discovered if some kind of communication has to be established. But there are several scenarios where even the network topology has to be a part of the secret. In this paper we study the question of communication within a secret network where all processing nodes of the network have only partial knowledge (e.g. given as routing tables) of the complete topology. We introduce a model for measuring the loss of security of the topology when far distance communication takes place. We will investigate lower bounds on the knowledge that can be deduced from the communication string. Several kinds of routing tables are not sufficient to guarantee the secrecy of topology. On the other hand, if a routing table allows to specify the direction from which a message is coming from we can run a protocol solving the all–to–all communication problem such that no processing node can gain additional knowledge about the network. Finally, we investigate the problem, whether a knowledge base can be generated from local knowledge of the processing nodes without losing the state of secrecy. It will be shown that this is not possible for static networks and most kinds of dynamic networks.
doi_str_mv 10.1007/11429647_14
format Conference Proceeding
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16882965</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16882965</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-9fbfa24d952120b6853120214cb99800e0e82b971675a4d2c2e39ee32cf7b2803</originalsourceid><addsrcrecordid>eNpNkDtPwzAUhc1Loiqd-ANeGBgC19dOHLOhqjykCpBoZ8txnRLa2pEdWvXfE1SEOMsZzmP4CLlkcMMA5C1jAlUhpGbiiIyULHkugCNIro7JgBWMZZwLdfKXYQE58lMyAA6YKSn4ORml9Am9-h0KHJDJOGw2X76xpmuCT7TxdO5XPuw8fXHdLsRVuqNv0SUXt41f0u7D0Xdno-toqOkstGEdlvsLclabdXKjXx-S-cNkNn7Kpq-Pz-P7adYiU12m6qo2KBYqR4ZQFWXOe0cmbKVUCeDAlVgpyQqZG7FAi44r5zjaWlZYAh-Sq8Nva5I16zoab5uk29hsTNxrVpRljyjve9eHXuojv3RRVyGskmagf1Dqfyj5N2O_XyY</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Communications in Unknown Networks: Preserving the Secret of Topology</title><source>Springer Books</source><creator>Hinkelmann, Markus ; Jakoby, Andreas</creator><contributor>Pelc, Andrzej ; Raynal, Michel</contributor><creatorcontrib>Hinkelmann, Markus ; Jakoby, Andreas ; Pelc, Andrzej ; Raynal, Michel</creatorcontrib><description>Cryptography investigates security aspects of data distributed in a network. This kind of security does not protect the secrecy of the network topology against being discovered if some kind of communication has to be established. But there are several scenarios where even the network topology has to be a part of the secret. In this paper we study the question of communication within a secret network where all processing nodes of the network have only partial knowledge (e.g. given as routing tables) of the complete topology. We introduce a model for measuring the loss of security of the topology when far distance communication takes place. We will investigate lower bounds on the knowledge that can be deduced from the communication string. Several kinds of routing tables are not sufficient to guarantee the secrecy of topology. On the other hand, if a routing table allows to specify the direction from which a message is coming from we can run a protocol solving the all–to–all communication problem such that no processing node can gain additional knowledge about the network. Finally, we investigate the problem, whether a knowledge base can be generated from local knowledge of the processing nodes without losing the state of secrecy. It will be shown that this is not possible for static networks and most kinds of dynamic networks.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540260523</identifier><identifier>ISBN: 3540260528</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540320739</identifier><identifier>EISBN: 3540320733</identifier><identifier>DOI: 10.1007/11429647_14</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; communication in unknown networks ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; network entropy ; security of the topology ; Software</subject><ispartof>Lecture notes in computer science, 2005, p.155-169</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11429647_14$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11429647_14$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4035,4036,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=16882965$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Pelc, Andrzej</contributor><contributor>Raynal, Michel</contributor><creatorcontrib>Hinkelmann, Markus</creatorcontrib><creatorcontrib>Jakoby, Andreas</creatorcontrib><title>Communications in Unknown Networks: Preserving the Secret of Topology</title><title>Lecture notes in computer science</title><description>Cryptography investigates security aspects of data distributed in a network. This kind of security does not protect the secrecy of the network topology against being discovered if some kind of communication has to be established. But there are several scenarios where even the network topology has to be a part of the secret. In this paper we study the question of communication within a secret network where all processing nodes of the network have only partial knowledge (e.g. given as routing tables) of the complete topology. We introduce a model for measuring the loss of security of the topology when far distance communication takes place. We will investigate lower bounds on the knowledge that can be deduced from the communication string. Several kinds of routing tables are not sufficient to guarantee the secrecy of topology. On the other hand, if a routing table allows to specify the direction from which a message is coming from we can run a protocol solving the all–to–all communication problem such that no processing node can gain additional knowledge about the network. Finally, we investigate the problem, whether a knowledge base can be generated from local knowledge of the processing nodes without losing the state of secrecy. It will be shown that this is not possible for static networks and most kinds of dynamic networks.</description><subject>Applied sciences</subject><subject>communication in unknown networks</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>network entropy</subject><subject>security of the topology</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540260523</isbn><isbn>3540260528</isbn><isbn>9783540320739</isbn><isbn>3540320733</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkDtPwzAUhc1Loiqd-ANeGBgC19dOHLOhqjykCpBoZ8txnRLa2pEdWvXfE1SEOMsZzmP4CLlkcMMA5C1jAlUhpGbiiIyULHkugCNIro7JgBWMZZwLdfKXYQE58lMyAA6YKSn4ORml9Am9-h0KHJDJOGw2X76xpmuCT7TxdO5XPuw8fXHdLsRVuqNv0SUXt41f0u7D0Xdno-toqOkstGEdlvsLclabdXKjXx-S-cNkNn7Kpq-Pz-P7adYiU12m6qo2KBYqR4ZQFWXOe0cmbKVUCeDAlVgpyQqZG7FAi44r5zjaWlZYAh-Sq8Nva5I16zoab5uk29hsTNxrVpRljyjve9eHXuojv3RRVyGskmagf1Dqfyj5N2O_XyY</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Hinkelmann, Markus</creator><creator>Jakoby, Andreas</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Communications in Unknown Networks: Preserving the Secret of Topology</title><author>Hinkelmann, Markus ; Jakoby, Andreas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-9fbfa24d952120b6853120214cb99800e0e82b971675a4d2c2e39ee32cf7b2803</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>communication in unknown networks</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>network entropy</topic><topic>security of the topology</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hinkelmann, Markus</creatorcontrib><creatorcontrib>Jakoby, Andreas</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hinkelmann, Markus</au><au>Jakoby, Andreas</au><au>Pelc, Andrzej</au><au>Raynal, Michel</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Communications in Unknown Networks: Preserving the Secret of Topology</atitle><btitle>Lecture notes in computer science</btitle><date>2005</date><risdate>2005</risdate><spage>155</spage><epage>169</epage><pages>155-169</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540260523</isbn><isbn>3540260528</isbn><eisbn>9783540320739</eisbn><eisbn>3540320733</eisbn><abstract>Cryptography investigates security aspects of data distributed in a network. This kind of security does not protect the secrecy of the network topology against being discovered if some kind of communication has to be established. But there are several scenarios where even the network topology has to be a part of the secret. In this paper we study the question of communication within a secret network where all processing nodes of the network have only partial knowledge (e.g. given as routing tables) of the complete topology. We introduce a model for measuring the loss of security of the topology when far distance communication takes place. We will investigate lower bounds on the knowledge that can be deduced from the communication string. Several kinds of routing tables are not sufficient to guarantee the secrecy of topology. On the other hand, if a routing table allows to specify the direction from which a message is coming from we can run a protocol solving the all–to–all communication problem such that no processing node can gain additional knowledge about the network. Finally, we investigate the problem, whether a knowledge base can be generated from local knowledge of the processing nodes without losing the state of secrecy. It will be shown that this is not possible for static networks and most kinds of dynamic networks.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11429647_14</doi><tpages>15</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Lecture notes in computer science, 2005, p.155-169
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_16882965
source Springer Books
subjects Applied sciences
communication in unknown networks
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Exact sciences and technology
network entropy
security of the topology
Software
title Communications in Unknown Networks: Preserving the Secret of Topology
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T10%3A14%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Communications%20in%20Unknown%20Networks:%20Preserving%20the%20Secret%20of%20Topology&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Hinkelmann,%20Markus&rft.date=2005&rft.spage=155&rft.epage=169&rft.pages=155-169&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540260523&rft.isbn_list=3540260528&rft_id=info:doi/10.1007/11429647_14&rft_dat=%3Cpascalfrancis_sprin%3E16882965%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540320739&rft.eisbn_list=3540320733&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true