Methods for secure decentralized routing in open networks:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Buch |
Sprache: | English |
Veröffentlicht: |
München
Network Architectures and Services, Department of Computer Science
2011
|
Schriftenreihe: | Network architectures and services
2011,08,1 |
Schlagworte: | |
Online-Zugang: | Volltext Inhaltsverzeichnis |
Beschreibung: | XII, 215 S. graph. Darst. |
ISBN: | 3937201262 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV039711047 | ||
003 | DE-604 | ||
005 | 20150430 | ||
007 | t | ||
008 | 111118s2011 d||| m||| 00||| eng d | ||
020 | |a 3937201262 |9 3-937201-26-2 | ||
035 | |a (OCoLC)767782349 | ||
035 | |a (DE-599)BVBBV039711047 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-91 |a DE-91G |a DE-473 | ||
084 | |a DAT 252d |2 stub | ||
084 | |a DAT 461d |2 stub | ||
100 | 1 | |a Evans, Nathan S. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Methods for secure decentralized routing in open networks |c Nathan S. Evans |
264 | 1 | |a München |b Network Architectures and Services, Department of Computer Science |c 2011 | |
300 | |a XII, 215 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Network architectures and services |v 2011,08,1 | |
502 | |a München, Techn. Univ., Diss., 2011 | ||
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Routing |0 (DE-588)4269073-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Computersicherheit |0 (DE-588)4274324-2 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Routing |0 (DE-588)4269073-0 |D s |
689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | 2 | |a Computersicherheit |0 (DE-588)4274324-2 |D s |
689 | 0 | |5 DE-604 | |
830 | 0 | |a Network architectures and services |v 2011,08,1 |w (DE-604)BV035950382 |9 2011,08,1 | |
856 | 4 | 1 | |u http://www.net.in.tum.de/fileadmin/TUM/NET/NET-2011-08-1.pdf |z kostenfrei |3 Volltext |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024559406&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
912 | |a ebook | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-024559406 |
Datensatz im Suchindex
_version_ | 1804148585964503040 |
---|---|
adam_text | IMAGE 1
TABLE OF CONTENTS
1. INTRODUCTION 1
1.1 NETWORK ENVIRONMENT 2
1.1.1 NETWORK ADDRESS TRANSLATION (NAT) 3
1.1.2 DOMAIN NAME SYSTEM (DNS) 4
1.1.3 PUBLIC KEY INFRASTRUCTURE 4
1.1.4 TRUST AGILITY 6
1.1.5 SUMMARY 6
1.2 PEER-TO-PEER (P2P) NETWORKS 6
1.2.1 CENTRALIZED P2P 7
1.2.2 PURE P2P 8
1.2.3 SUPER-PEER P2P 8
1.3 DESIGN GOALS 9
1.4 METHODOLOGY 12
1.5 SUMMARY AND OVERVIEW 13
2. ROUTING IN THE DARK: PITCH BLACK 15
2.1 INTRODUCTION 15
2.2 RELATED WORK 16
2.2.1 DISTRIBUTED HASH TABLES 16
2.2.2 SMALL-WORLD NETWORKS 17
2.3 FREENET S DARKNET ROUTING ALGORITHM 18
2.3.1 NETWORK CREATION 18
2.3.2 OPERATIONAL OVERVIEW 19
2.3.3 LOCATION SWAPPING 19
2.3.4 CONTENT STORAGE 21
2.3.5 EXAMPLE 21
2.4 SECURITY ANALYSIS 23
2.4.1 ACTIVE ATTACK 24
2.4.2 NATURAL CHURN 25
2.5 EXPERIMENTAL RESULTS 27
2.5.1 DISTRIBUTION OF NODE LOCATIONS 29
2.5.2 ROUTING PATH LENGTH 32
2.5.3 AVAILABILITY OF CONTENT 35
2.5.4 OTHER TOPOLOGIES 38
2.6 SIMULATION OF CHURN 41
2.7 DISCUSSION 43
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1015129951
DIGITALISIERT DURCH
IMAGE 2
VI TABLE OF CONTENTS
2.8 CONCLUSION 45
3. AUTONOMOUS NAT TRAVERSAL 47
3.1 INTRODUCTION 47
3.2 TECHNICAL APPROACH 48
3.2.1 NAT-TO-NAT COMMUNICATION 50
3.2.2 USING UDP PACKETS INSTEAD OF ICMP ECHO REQUESTS 50 3.3
IMPLEMENTATIONS 51
3.3.1 IMPLEMENTATION IN NAT-TESTER FRAMEWORK 51 3.3.2 IMPLEMENTATION IN
PWNAT TOOL 52
3.3.3 IMPLEMENTATION IN THE GNUNET FRAMEWORK 52
3.4 EXPERIMENTAL RESULTS 53
3.5 DISCUSSION 54
3.6 CONCLUSION 54
4. A PRACTICAL CONGESTION ATTACK ON TOR USING LONG PATHS . 55 4.1
INTRODUCTION 55
4.2 RELATED WORK 56
4.2.1 TOR 57
4.2.2 ATTACKS ON TOR AND OTHER MIXES 57
4.3 OUR ATTACK 60
4.3.1 JAVASCRIPT INJECTION 61
4.3.2 IMPACT OF CONGESTION ON ARRIVAL TIMES 63
4.3.3 STATISTICAL EVALUATION 65
4.3.4 CONGESTION ATTACK 66
4.3.5 OPTIMIZATIONS 67
4.4 EXPERIMENTAL RESULTS 68
4.5 PROPOSED SOLUTIONS 80
4.6 LOW-COST TRAFFIC ANALYSIS FAILURE AGAINST MODERN TOR . . .. 85 4.7
CONCLUSION 93
5. FISH-EYE BOUNDED DISTANCE VECTOR PROTOCOL 95
5.1 FISH-EYE AND ZONE ROUTING PROTOCOLS 95
5.2 IMPLEMENTATION 96
5.3 DISTANCE VECTOR SERVICE 98
5.4 MESSAGE EXAMPLE 98
5.5 NEIGHBORHOOD SIZE ESTIMATE 99
5.6 DISTANCE VECTOR FOR ONION ROUTING 101
5.7 FBDV CAVEATS: ONION ROUTING WITHOUT ANONYMITY 102 5.8 CONCLUSION 105
IMAGE 3
TABLE OF CONTENTS VII
6. LARGE-SCALE DISTRIBUTED EMULATION OF P 2P PROTOCOLS . .. 107 6.1
INTRODUCTION 107
6.2 DESIGN GOALS 108
6.3 RELATED WORK 109
6.3.1 SIMULATION 110
6.3.2 EMULATION 110
6.3.3 COMBINING SIMULATION AND EMULATION I LL
6.4 THE GNUNET P2P FRAMEWORK I LL
6.5 THE EMULATION LIBRARY 112
6.5.1 EXECUTING EXPERIMENTS 113
6.5.2 PEER LIFE CYCLE 113
6.5.3 PEER GROUP LIFE CYCLE 114
6.5.4 TOPOLOGY 115
6.6 LESSONS LEARNED 116
6.6.1 CRYPTOGRAPHY 117
6.6.2 EXECUTION TIME 118
6.6.3 LATENCY 118
6.6.4 SOCKETS 119
6.6.5 MEMORY 120
6.7 RESULTS 120
6.8 DHT PROFILER DETAILS 121
6.8.1 WEB TRIAL SCHEDULING 122
6.8.2 TRIAL EXECUTION DAEMON 123
6.8.3 PROFILING DRIVER 123
6.8.4 ADDITIONAL TRIAL PROCESSING 123
6.8.5 WEB RESULT PROCESSING/VIEWING/COMPARISON 125 6.8.6 DATABASE
BACK-END 128
6.8.7 DATABASE INTERACTION (DATA EXPORT) 129
6.9 CONCLUSION 131
7. R 5 N- RANDOMIZED RECURSIVE ROUTING FOR RESTRICTED ROUTE NETWORKS 133
7.1 INTRODUCTION 133
7.2 RELATED WORK 135
7.2.1 KADEMLIA 135
7.2.2 RESTRICTED-ROUTE TOPOLOGIES 136
7.2.3 T-DHT 137
7.2.4 FREENET 138
7.2.5 RANDOMIZED DESIGNS 138
7.3 DESIGN OF R 5 N 141
7.3.1 THE ROUTING TABLE 142
7.3.2 FISHEYE DISTANCE VECTOR UNDERLAY AUGMENTATION . . . 143 7.3.3
ROUTING 143
7.3.4 ESTIMATING NETWORK SIZE 144
IMAGE 4
VIII TABLE OF CONTENTS
7.3.5 PROCESSING REQUESTS AND REPLIES 144
7.3.6 REPLICATION 145
7.3.7 CONTENT VALIDATION 148
7.3.8 ADVERSARY MODEL 149
7.4 MATHEMATICAL EVALUATION 153
7.4.1 HOPS TO REACH A NEAREST PEER 153
7.4.2 TOTAL HOPS - ROUTING WITH SUFFICIENT REPLICATION . . . 166 7.4.3
COMPARISON AND DISCUSSION 170
7.5 MARKOV MIXING TIMES 170
7.6 EXPERIMENTAL RESULTS 171
7.6.1 IMPLEMENTATION DETAILS 172
7.6.2 EMULATION FRAMEWORK FOR TESTING AND PROFILING . . .. 173 7.6.3
R-KADEMLIA 174
7.6.4 NETWORK PERFORMANCE 175
7.6.5 REPLICATION 175
7.6.6 MALICIOUS PEERS 179
7.7 EXTENDED DATA 182
7.7.1 SMALL SCALE RESULTS 182
7.7.2 LARGE SCALE TESTS 190
7.8 CONCLUSION 199
8. CONCLUSION AND FUTURE WORK 201
8.1 FUTURE WORK 201
BIBLIOGRAPHY 203
|
any_adam_object | 1 |
author | Evans, Nathan S. |
author_facet | Evans, Nathan S. |
author_role | aut |
author_sort | Evans, Nathan S. |
author_variant | n s e ns nse |
building | Verbundindex |
bvnumber | BV039711047 |
classification_tum | DAT 252d DAT 461d |
collection | ebook |
ctrlnum | (OCoLC)767782349 (DE-599)BVBBV039711047 |
discipline | Informatik |
format | Thesis Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01871nam a2200445 cb4500</leader><controlfield tag="001">BV039711047</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150430 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">111118s2011 d||| m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3937201262</subfield><subfield code="9">3-937201-26-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)767782349</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV039711047</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-473</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 252d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 461d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Evans, Nathan S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Methods for secure decentralized routing in open networks</subfield><subfield code="c">Nathan S. Evans</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="b">Network Architectures and Services, Department of Computer Science</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 215 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Network architectures and services</subfield><subfield code="v">2011,08,1</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">München, Techn. Univ., Diss., 2011</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Routing</subfield><subfield code="0">(DE-588)4269073-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computersicherheit</subfield><subfield code="0">(DE-588)4274324-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Routing</subfield><subfield code="0">(DE-588)4269073-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Computersicherheit</subfield><subfield code="0">(DE-588)4274324-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Network architectures and services</subfield><subfield code="v">2011,08,1</subfield><subfield code="w">(DE-604)BV035950382</subfield><subfield code="9">2011,08,1</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://www.net.in.tum.de/fileadmin/TUM/NET/NET-2011-08-1.pdf</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024559406&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024559406</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV039711047 |
illustrated | Illustrated |
indexdate | 2024-07-10T00:09:29Z |
institution | BVB |
isbn | 3937201262 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024559406 |
oclc_num | 767782349 |
open_access_boolean | 1 |
owner | DE-12 DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-473 DE-BY-UBG |
owner_facet | DE-12 DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-473 DE-BY-UBG |
physical | XII, 215 S. graph. Darst. |
psigel | ebook |
publishDate | 2011 |
publishDateSearch | 2011 |
publishDateSort | 2011 |
publisher | Network Architectures and Services, Department of Computer Science |
record_format | marc |
series | Network architectures and services |
series2 | Network architectures and services |
spelling | Evans, Nathan S. Verfasser aut Methods for secure decentralized routing in open networks Nathan S. Evans München Network Architectures and Services, Department of Computer Science 2011 XII, 215 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Network architectures and services 2011,08,1 München, Techn. Univ., Diss., 2011 Algorithmus (DE-588)4001183-5 gnd rswk-swf Routing (DE-588)4269073-0 gnd rswk-swf Computersicherheit (DE-588)4274324-2 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Routing (DE-588)4269073-0 s Algorithmus (DE-588)4001183-5 s Computersicherheit (DE-588)4274324-2 s DE-604 Network architectures and services 2011,08,1 (DE-604)BV035950382 2011,08,1 http://www.net.in.tum.de/fileadmin/TUM/NET/NET-2011-08-1.pdf kostenfrei Volltext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024559406&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Evans, Nathan S. Methods for secure decentralized routing in open networks Network architectures and services Algorithmus (DE-588)4001183-5 gnd Routing (DE-588)4269073-0 gnd Computersicherheit (DE-588)4274324-2 gnd |
subject_GND | (DE-588)4001183-5 (DE-588)4269073-0 (DE-588)4274324-2 (DE-588)4113937-9 |
title | Methods for secure decentralized routing in open networks |
title_auth | Methods for secure decentralized routing in open networks |
title_exact_search | Methods for secure decentralized routing in open networks |
title_full | Methods for secure decentralized routing in open networks Nathan S. Evans |
title_fullStr | Methods for secure decentralized routing in open networks Nathan S. Evans |
title_full_unstemmed | Methods for secure decentralized routing in open networks Nathan S. Evans |
title_short | Methods for secure decentralized routing in open networks |
title_sort | methods for secure decentralized routing in open networks |
topic | Algorithmus (DE-588)4001183-5 gnd Routing (DE-588)4269073-0 gnd Computersicherheit (DE-588)4274324-2 gnd |
topic_facet | Algorithmus Routing Computersicherheit Hochschulschrift |
url | http://www.net.in.tum.de/fileadmin/TUM/NET/NET-2011-08-1.pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024559406&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV035950382 |
work_keys_str_mv | AT evansnathans methodsforsecuredecentralizedroutinginopennetworks |