DOCSLIB.ORG

Future Internet (FI) and Innovative Internet Technologies and Mobile Communication (IITM)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Future Internet (FI) and Innovative Internet Technologies and Mobile Communication (IITM) Chair of Network Architectures and Services Department of Informatics Technical University of Munich Proceedings of the Seminars Future Internet (FI) and Innovative Internet Technologies and Mobile Communication (IITM) Summer Semester 2018 26. 2. 2017 – 19. 8. 2018 Munich, Germany Editors Georg Carle, Daniel Raumer, Stephan Gunther,¨ Benedikt Jaeger Publisher Chair of Network Architectures and Services Network Architectures and Services NET 2018-11-1 Lehrstuhl für Netzarchitekturen und Netzdienste Fakultät für Informatik Technische Universität München Proceedings zu den Seminaren Future Internet (FI) und Innovative Internet-Technologien und Mobilkommunikation (IITM) Sommersemester 2018 München, 26. 2. 2017 – 19. 8. 2018 Editoren: Georg Carle, Daniel Raumer, Stephan Günther, Benedikt Jaeger Network Architectures and Services NET 2018-11-1 Proceedings of the Seminars Future Internet (FI) and Innovative Internet Technologies and Mobile Communication (IITM) Summer Semester 2018 Editors: Georg Carle Lehrstuhl für Netzarchitekturen und Netzdienste (I8) Technische Universität München 85748 Garching b. München, Germany E-mail: [email protected] Internet: https://net.in.tum.de/~carle/ Daniel Raumer Lehrstuhl für Netzarchitekturen und Netzdienste (I8) E-mail: [email protected] Internet: https://net.in.tum.de/~raumer/ Stephan Günther Lehrstuhl für Netzarchitekturen und Netzdienste (I8) E-mail: [email protected] Internet: https://net.in.tum.de/~guenther/ Benedikt Jaeger Lehrstuhl für Netzarchitekturen und Netzdienste (I8) E-mail: [email protected] Internet: https://net.in.tum.de/~jaeger/ Cataloging-in-Publication Data Seminars FI & IITM SS 18 Proceedings zu den Seminaren „Future Internet“ (FI) und „Innovative Internet-Technologien und Mobilkom- munikation“ (IITM) München, Germany, 26. 2. 2017 – 19. 8. 2018 ISBN: 978-3-937201-63-4 ISSN: 1868-2634 (print) ISSN: 1868-2642 (electronic) DOI: 10.2313/NET-2018-11-1 Lehrstuhl für Netzarchitekturen und Netzdienste (I8) NET 2018-11-1 Series Editor: Georg Carle, Technische Universität München, Germany c 2018, Technische Universität München, Germany II Vorwort Vor Ihnen liegen die Proceedings der beiden Seminare „Future Internet“ (FI) und „Innovative Internet- Technologien und Mobilkommunikation“ (IITM), welche die finalen Ausarbeitungen unserer Studierenden enthalten. Die beiden Seminare wurden am Lehrstuhl für Netzarchitekturen und Netzdienste an der Fa- kultät für Informatik der Technischen Universität München im Sommersemester 2018 durchgeführt. Allen Teilnehmerinnen und Teilnehmern stand es wie in der Vergangenheit frei, die Ausarbeitung und den Vortrag in englischer oder in deutscher Sprache zu verfassen. Dementsprechend finden sich sowohl englische als auch deutsche Beiträge in diesen Proceedings. Einige der Vorträge wurden aufgezeichnet und sind auf unserem Medienportal unter https://media.net. in.tum.de abrufbar. Wir hoffen, dass Sie den Beiträgen dieser Seminare wertvolle Anregungen entnehmen können. Falls Sie weiteres Interesse an unseren Arbeiten haben, so finden Sie weitere Informationen auf unserer Homepage https://net.in.tum.de. München, September 2018 Georg Carle Daniel Raumer Stephan Günther Benedikt Jaeger III Preface We are pleased to present you the proceedings of our seminars on “Future Internet” (FI) and “Innovative Internet Technologies and Mobile Communication” (IITM) which took place in the Summer Semester 2018. In all seminar courses organized by our research group, the authors were free to write their paper and give their talk in English or German. Some of the talks were recorded and published on our media portal https://media.net.in.tum.de. We hope that you appreciate the contributions of these seminars. If you are interested in further information about our work, please visit our homepage https://net.in.tum.de. Munich, September 2018 IV V Seminarveranstalter Lehrstuhlinhaber Georg Carle, Technische Universität München, Germany Seminarleitung Daniel Raumer, Technische Universität München, Germany Stephan Günther, Technische Universität München, Germany Benedikt Jaeger, Technische Universität München, Germany Betreuer Paul Emmerich ([email protected]) Quirin Scheitle ([email protected]) Technische Universität München Technische Universität München Stefan Liebald ([email protected]) Dominik Scholz ([email protected]) Technische Universität München Technische Universität München Holger Kinkelin ([email protected]) Jan Seeger ([email protected]) Technische Universität München Technische Universität München Marcel von Maltitz ([email protected]) Fabien Geyer ([email protected]) Technische Universität München Technische Universität München Kajó Márton ([email protected]) Simon Bauer ([email protected]) Technische Universität München Technische Universität München Heiko Niedermayer ([email protected]) Technische Universität München Seminarhomepage https://net.in.tum.de/teaching/ss18/seminars/ VI Inhaltsverzeichnis Future Internet Key Performance Indicators of TCP Flows................................1 Patryk Brzoza (Betreuer: Simon Bauer) Use case study on machine learning for network anomaly detection..................9 Edin Citaku (Betreuer: Simon Bauer) Spieltheoretische Analyse von Blockchains................................ 17 Schahed Hadawal (Betreuer: Heiko Niedermayer) Performance of Message Authentication Codes for Secure Ethernet.................. 27 Philipp Hagenlocher (Betreuer: Dominik Scholz, Fabien Geyer) Fog Computing for Smart Environments................................. 35 Ulrich Huber (Betreuer: Jan Seeger) Self-Driven Computer Networks...................................... 43 Simon Klimaschka (Betreuer: Fabien Geyer) Longitudinal study of user-space packet processing frameworks in academia............. 51 Maik Luu Bach (Betreuer: Paul Emmerich) GDPR - Required Changes By Website Operators And Technical Ways To Check For Compliance 57 Maximilian Muth (Betreuer: Quirin Scheitle) Was ist Privatsphäre?........................................... 67 Benedikt Müller (Betreuer: Marcel von Maltitz) Analyse der Ende-zu-Ende-Verschlüsselung von Nextcloud....................... 73 Emmanuel Syrmoudis (Betreuer: Holger Kinkelin) Evaluation of Distributed Semantic Databases.............................. 81 Philipp Trucksäß (Betreuer: Jan Seeger) Innovative Internet-Technologien und Mobilkommunikation An overview over Capsule Networks................................... 89 Luca Alessandro Dombetzki (Betreuer: Marton Kajo) Attack-Defense-Trees and other Security Modeling Tools........................ 97 Benjamin Löhner (Betreuer: Heiko Niedermayer) Identity Management on the Blockchain................................. 105 Julian Roos (Betreuer: Heiko Niedermayer) Data Management in Distributed Systems................................ 113 Simon Schäffner (Betreuer: Stefan Liebald) Observing TCP Round Trip Times with FlowScope........................... 121 Christian Wahl (Betreuer: Simon Bauer) VII VIII Key Performance Indicators of TCP Flows Patryk Brzoza Advisor: M.Sc. Simon Bauer Seminar Future Internet SS2018 Chair of Network Architectures and Services Departments of Informatics, Technical University of Munich Email: [email protected] ABSTRACT reduce it to a necessary amount of information and to ex- As most of today’s Internet traffic is provided by TCP, this tract various KPIs from it. A range of different approaches also means that the overall performance is heavily depen- from various tools is evaluated in Section 6. Finally, Section dent on the quality of these TCP flows. To make it possible 7 shows which assumptions and conclusions about different to evaluate the state of connections or networks for further network states and events can be made by inspecting the potential problem assessment, it is necessary to introduce priorly collected information. metrics that act as key performance indicators. This paper introduces multiple of these performance metrics and clas- 2. RELATED WORK sifies them into latency, packet loss, throughput and other While this paper’s focus is set on defining and evaluating indicators. As a next step, various methods to conduct mea- KPIs of TCP flows, the performance of TCP has long been surements and data processing approaches to extract valu- subject of previous research. A thorough analysis of the able information are presented and discussed. Finally, this role of TCP/IP in high performance networks has been con- allows to draw conclusions about a flow’s or network’s qual- cluded by Hassan and Jain in [3]. Based on the fundamen- ity and state. tals of the protocol, it defines how to measure the efficiency and create simulations and suitable models for wired and Keywords wireless networks. TCP Flows, Performance Metrics, KPIs, Network Monitor- ing, Intrusion Detection Additionally, the passive extraction of valuable information like the round trip time has been thematized by Shakkottai 1. INTRODUCTION et al. in [4] and forms a base for parts of this paper. Due to its broad range of features and its numerous advan- Finally, there is a broad range of tools that rely on moni- tages, such as providing reliable and ordered communica- toring network performance to conclude events like intrusion tion, TCP has become one of the most important backbones attacks. Examples for this research topic are the tool FlowS- of today’s Internet. As most commonly used protocols (in- can by Plonka in [5] and FIRE by Dickerson in [6]. cluding HTTP, SMTP or FTP) are relying on it, even up to 95% of the total traffic volume is
Load more

Recommended publications
  • SHA-3 Conference, March 2012, Skein: More Than Just a Hash Function
    Skein More than just a hash function Third SHA-3 Candidate Conference 23 March 2012 Washington DC 1 Skein is Skein-512 • Confusion is common, partially our fault • Skein has two special-purpose siblings: – Skein-256 for extreme memory constraints – Skein-1024 for the ultra-high security margin • But for SHA-3, Skein is Skein-512 – One hash function for all output sizes 2 Skein Architecture • Mix function is 64-bit ARX • Permutation: relocation of eight 64-bit words • Threefish: tweakable block cipher – Mix + Permutation – Simple key schedule – 72 rounds, subkey injection every four rounds – Tweakable-cipher design key to speed, security • Skein chains Threefish with UBI chaining mode – Tweakable mode based on MMO – Provable properties – Every hashed block is unique • Variable size output means flexible to use! – One function for any size output 3 The Skein/Threefish Mix 4 Four Threefish Rounds 5 Skein and UBI chaining 6 Fastest in Software • 5.5 cycles/byte on 64-bit reference platform • 17.4 cycles/byte on 32-bit reference platform • 4.7 cycles/byte on Itanium • 15.2 cycles/byte on ARM Cortex A8 (ARMv7) – New numbers, best finalist on ARMv7 (iOS, Samsung, etc.) 7 Fast and Compact in Hardware • Fast – Skein-512 at 32 Gbit/s in 32 nm in 58 k gates – (57 Gbit/s if processing two messages in parallel) • To maximize hardware performance: – Use a fast adder, rely on simple control structure, and exploit Threefish's opportunities for pipelining – Do not trust your EDA tool to generate an efficient implementation • Compact design: – Small FPGA
    [Show full text]
  • Diapositiva 1
    TRANSFERENCIA O DISTRIBUCIÓN DE ARCHIVOS ENTRE IGUALES (peer-to-peer) Características, Protocolos, Software, Luis Villalta Márquez Configuración Peer-to-peer Una red peer-to-peer, red de pares, red entre iguales, red entre pares o red punto a punto (P2P, por sus siglas en inglés) es una red de computadoras en la que todos o algunos aspectos funcionan sin clientes ni servidores fijos, sino una serie de nodos que se comportan como iguales entre sí. Es decir, actúan simultáneamente como clientes y servidores respecto a los demás nodos de la red. Las redes P2P permiten el intercambio directo de información, en cualquier formato, entre los ordenadores interconectados. Peer-to-peer Normalmente este tipo de redes se implementan como redes superpuestas construidas en la capa de aplicación de redes públicas como Internet. El hecho de que sirvan para compartir e intercambiar información de forma directa entre dos o más usuarios ha propiciado que parte de los usuarios lo utilicen para intercambiar archivos cuyo contenido está sujeto a las leyes de copyright, lo que ha generado una gran polémica entre defensores y detractores de estos sistemas. Las redes peer-to-peer aprovechan, administran y optimizan el uso del ancho de banda de los demás usuarios de la red por medio de la conectividad entre los mismos, y obtienen así más rendimiento en las conexiones y transferencias que con algunos métodos centralizados convencionales, donde una cantidad relativamente pequeña de servidores provee el total del ancho de banda y recursos compartidos para un servicio o aplicación. Peer-to-peer Dichas redes son útiles para diversos propósitos.
    [Show full text]
  • Darxplorer a Toolbox for Cryptanalysis and Cipher Designers
    DARXplorer a Toolbox for Cryptanalysis and Cipher Designers Dennis Hoppe Bauhaus-University Weimar 22nd April 2009 Dennis Hoppe (BUW) DARXplorer 22nd April 2009 1 / 31 Agenda 1 Introduction to Hash Functions 2 The ThreeFish Block Cipher 3 Differential Cryptanalysis 4 DARXplorer { DC of ThreeFish 5 Results on ThreeFish 6 Generalization of DARXplorer Dennis Hoppe (BUW) DARXplorer 22nd April 2009 2 / 31 Agenda 1 Introduction to Hash Functions 2 The ThreeFish Block Cipher 3 Differential Cryptanalysis 4 DARXplorer { DC of ThreeFish 5 Results on ThreeFish 6 Generalization of DARXplorer Dennis Hoppe (BUW) DARXplorer 22nd April 2009 3 / 31 Introduction to Hash Functions Hash Functions A hash function H : f0; 1g∗ ! f0; 1gn is used to compute an n-bit fingerprint from an arbitrarily-sized input M 2 f0; 1g∗ Most of them are based on a compression function C : f0; 1gn × f0; 1gm ! f0; 1gn with fixed size input Computation: Hi := C(Hi−1;Mi) C C C H[0] H[1] . H[L-1] H[L] M[1] M[2] . M[L] Dennis Hoppe (BUW) DARXplorer 22nd April 2009 4 / 31 Introduction to Hash Functions { cont'd Compression Functions A crucial building block of iterated hash functions is the compression function C Designer often make use of block ciphers Which properties should be imposed on C to guarantee that the hash function satisfies certain properties? Theorem (Damg˚ard-Merkle) If the compression function C is collision-resistant, then the hash function H is collision-resistant as well. If the compression function C is preimage-resistant, then the hash function H is preimage-resistant as well.
    [Show full text]
  • 2011-2012 CJFE's Review of Free Expression in Canada
    2011-2012 CJFE’s Review of Free Expression in Canada LETTER FROM THE EDITORS OH, HOW THE MIGHTY FALL. ONCE A LEADER IN ACCESS TO INFORMATION, PEACEKEEPING, HUMAN RIGHTS AND MORE, CANADA’S GLOBAL STOCK HAS PLUMMETED IN RECENT YEARS. This Review begins, as always, with a Report Card that grades key issues, institutions and governmental departments in terms of how their actions have affected freedom of expres- sion and access to information between May 2011 and May 2012. This year we’ve assessed Canadian scientists’ freedom of expression, federal protection of digital rights and Internet JOIN CJFE access, federal access to information, the Supreme Court, media ownership and ourselves—the Canadian public. Being involved with CJFE is When we began talking about this Review, we knew we wanted to highlight a major issue with a series of articles. There were plenty of options to choose from, but we ultimately settled not restricted to journalists; on the one topic that is both urgent and has an impact on your daily life: the Internet. Think about it: When was the last time you went a whole day without accessing the membership is open to all Internet? No email, no Skype, no gaming, no online shopping, no Facebook, Twitter or Instagram, no news websites or blogs, no checking the weather with that app. Can you even who believe in the right to recall the last time you went totally Net-free? Our series on free expression and the Internet (beginning on p. 18) examines the complex free expression. relationship between the Internet, its users and free expression, access to information, legislation and court decisions.
    [Show full text]
  • IFIP AICT 306, Pp
    Chapter 13 A MODEL FOR FOXY PEER-TO-PEER NETWORK INVESTIGATIONS Ricci Ieong, Pierre Lai, Kam-Pui Chow, Frank Law, Michael Kwan and Kenneth Tse Abstract In recent years, peer-to-peer (P2P) applications have become the dom- inant form of Internet traffic. Foxy, a Chinese community focused file- sharing tool, is increasingly being used to disseminate private data and sensitive documents in Hong Kong. Unfortunately, its scattered design and a highly distributed network make it difficult to locate a file orig- inator. This paper proposes an investigative model for analyzing Foxy communications and identifying the first uploaders of files. The model is built on the results of several experiments, which reveal behavior patterns of the Foxy protocol that can be used to expose traces of file originators. Keywords: Peer-to-peer network forensics, Foxy network, Gnutella 2 protocol 1. Introduction Recent surveys report that P2P traffic is responsible for 41% to 90% of all Internet traffic [2, 4]. In 2007, two popular P2P file-sharing ap- plications, BitTorrent and eDonkey, contributed 50% to 70% and 5% to 50% of all P2P traffic, respectively [2]. The Foxy P2P file-sharing protocol is gaining popularity in traditional Chinese character markets such as Hong Kong and Taiwan – approximately 500,000 users are ac- tive on the Foxy network at any given time [14]. A Foxy client, which is available free-of-charge, provides a user-friendly traditional Chinese interface. It enables users to connect to the Foxy network without any special configuration and to download free music, movies and software with just a few keystrokes and mouse clicks.
    [Show full text]
  • Instructions for Using Your PC ǍʻĒˊ Ƽ͔ūś
    Instructions for using your PC ǍʻĒˊ ƽ͔ūś Be careful with computer viruses !!! Be careful of sending ᡅĽ/ͼ͛ᩥਜ਼ƶ҉ɦϹ࿕ZPǎ Ǖễƅ͟¦ᰈ Make sure to install anti-virus software in your PC personal profile and ᡅƽញƼɦḳâ 5☦ՈǍʻPǎᡅ !!! information !!! It is very dangerous !!! ᫬ΚTẝ«ŵ┭ՈT Stop violation of copyright concerning illegal acts of ơųጛňƿՈ☢ͩ ⚷<ǕO਍ᜐ&« transmitting music and ₑᡅՈϔǒ]ᡅ others through the Don’t forget to backup ඡȭ]dzÑՈ Internet !!! important data !!! Ȥᩴ̣é If another person looks in at your E-mail, it’s a big ὲâΞȘᝯɣ׏r problem !!! Don’t install software in dz]ǣrPǎᡅ ]ᡅîPéḳâ╓ ͛ƽញ4̶ᾬϹ࿕ ۅTake care of keeping your some other PCs without ੥ˊΙǺ password !!! permission !!! ₐ Stop sending the followings !!! ؄ŌՈϹوInformation against public order and Somebody targets on your PC for Pǎ]ᡅǕễạǑ͘͝ࢭÛ ΞȘƅ¦Ƿń morals illegal access !!! Ոƅ͟ǻᢊ᫁᫨ĐՈ ࿕Ϭ⓶̗ʵ£࿁îƷljĈ Information about discrimination, Shut out those attacks with firewall untruth and bad reputation against a !!! Ǎʻ ᰻ǡT person ᤘἌ᭔ ᆘჍഀ ጠᅼૐᾑ ᭼᭨᭞ᮞęɪᬡ෉ᬡǰɟ ᆘȐೈ࿴ ᾑ૥ ጠᅼ3ظ ᤘἌ᭔ ǰɟᯓۀ᭞ᮞ᭿ᮐᮧ᭪᭑᭎ᮖ᭤ᬞᬢ ഄᅤ Έʡȩîᬡ͒ͮᬢـ ᅼܘᆘȐೈ ǸᆜሹظᤘἌ᭔࿴ ཬᴔ ᭼᭨᭞ᮞᬞᬢŽᬍ᭑᭎ᮖ᭤̛ɏ᭨ᮀ᭳ᭅ ரἨ᳜ᄌ࿘Π ؼ˨ഀ ୈ᡼ὼ$ ഄጵ↬3L ʍ୰ᬞᯓ ᄨῼ33 Ȋථᬚᬌᬻᯓ ഄ˽ ઁǢᬝຨϙଙͮـᅰჴڹެ ሤᆵͨ˜Ɍ ጵႸᾀ żᆘ᭔ ᬝᬜ᫞Ϊ̎UઁɃᬢ ࡶ୰ᬝ᭲ᮧ᭪ᬢ ᄨؼᾭᄨ ᾑ૥ ٕ࿩ᅨ ΰ̛ᬞ᭫ᮌᯓ ᭻᭮᭚᭍᭮ᮂᭅ ሬČ ཬȴ3 ᾘɤɟ3 Ƌᬿᬍᬞᯓ ᫾ᬿᬒᬼۏąഄᅼ Ѹᆠᅨ ᮌᮧᮖᭅ ⃸ᛴܠ ఼ ᆬð3 ᤘἌ᭔࿴ ƂŬᯓ ᭨ᮀ᭳᭑᭒᭍ᭅƖ̳ᬞ ĩᬡ᭼᭨᭞ᮞᬞٴ ரἨ᳜ᄌ࿘ ᭼᭤ᮚᮧ᭴ᬡɼǂᬢ ڹެ ᵌೈჰ˨ ˜ϐ ᛄሤ↬3 ᆜೈᯌ ϤᏤ ᬊᬖ᫾ᬽᬊᬻ᫹ᯓ ᭏ᮞ᭤᭳ᮧᮖᬊᬝ᫷ᬚ ሬČʀ ͌ǜ ąഄᅼ ΰ̛ᬞ ޅ᫾᫿᫵ᬝᬒᬡ᭼᭨᭞ᮞᭅ ᤘἌ᭔Π ͬϐʼ ᆬð3 ʏͦᬞɃᬌᬾȩî ēᬖᬙ᫷ᬾᯓ ܘˑˑᏬୀΠ ᄨؼὼ ሹ ߍɋᬞ᫵ᬒᬾȩî ᮀᭌ᭏᭍᭑᭔ᮧᮖwƫᬚފᴰᆘ࿘ჸ $±ᅠʀ =Ė ܘ૥Čٍᅨ ᙌۨ5ࡨٍὼ ሹ ഄϤᏤ ᤘἌ᭔ ኩ˰Π3 ᬢ͒ͮᬊᬝ᫷ᯓ ᭢ᮎ᭮᭳᭍᭑᭳ᬊᬻ᫹ᯓـ ʧʧ¥¥ᬚᬚP2PP2P᭨᭨ᮀᮀ᭳᭳᭑᭑᭒᭒᭍᭍ᬢᬢ DODO NOTNOT useuse P2PP2P softwaresoftware ̦̦ɪɪᬚᬚᬀᬀᬱᬱᬎᬎᭆᭆᯓᯓ inin campuscampus networknetwork !!!! Z ʧ¥᭸᭮᭳ᮚᮧ᭚ᬞ᫽ᬄᬾ੒ͮᬢȴƏΜˉ᭢᭤᭱ Z All communications in our campus network are ᬈᬿᬙ᫷ᬱᬌ᫟ʧ¥ᬚP2P᭨ᮀ always monitored automatically.
    [Show full text]
  • On the Privacy Implications of Real Time Bidding
    On the Privacy Implications of Real Time Bidding A Dissertation Presented by Muhammad Ahmad Bashir to The Khoury College of Computer Sciences in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science Northeastern University Boston, Massachusetts August 2019 To my parents, Javed Hanif and Najia Javed for their unconditional support, love, and prayers. i Contents List of Figures v List of Tables viii Acknowledgmentsx Abstract of the Dissertation xi 1 Introduction1 1.1 Problem Statement..................................3 1.1.1 Information Sharing Through Cookie Matching...............3 1.1.2 Information Sharing Through Ad Exchanges During RTB Auctions....5 1.2 Contributions.....................................5 1.2.1 A Generic Methodology For Detecting Information Sharing Among A&A companies..................................6 1.2.2 Transparency & Compliance: An Analysis of the ads.txt Standard...7 1.2.3 Modeling User’s Digital Privacy Footprint..................9 1.3 Roadmap....................................... 10 2 Background and Definitions 11 2.1 Online Display Advertising.............................. 11 2.2 Targeted Advertising................................. 13 2.2.1 Online Tracking............................... 14 2.2.2 Retargeted Ads................................ 14 2.3 Real Time Bidding.................................. 14 2.3.1 Overview................................... 15 2.3.2 Cookie Matching............................... 16 2.3.3 Advertisement Served via RTB.......................
    [Show full text]
  • Mobile Peer Model a Mobile Peer-To-Peer Communication and Coordination Framework - with Focus on Scalability and Security
    Die approbierte Originalversion dieser Diplom-/ Masterarbeit ist in der Hauptbibliothek der Tech- nischen Universität Wien aufgestellt und zugänglich. http://www.ub.tuwien.ac.at The approved original version of this diploma or master thesis is available at the main library of the Vienna University of Technology. http://www.ub.tuwien.ac.at/eng Mobile Peer Model A mobile peer-to-peer communication and coordination framework - with focus on scalability and security DIPLOMARBEIT zur Erlangung des akademischen Grades Diplom-Ingenieur im Rahmen des Studiums Software Engineering & Internet Computing eingereicht von Jörg Schoba, BSc Matrikelnummer 01026309 an der Fakultät für Informatik der Technischen Universität Wien Betreuung: Ao.Univ.Prof. Dipl.-Ing. Dr.techn. Eva Kühn Mitwirkung: Projektass. Dipl.-Ing. Stefan Craß Wien, 10. Oktober 2017 Jörg Schoba Eva Kühn Technische Universität Wien A-1040 Wien Karlsplatz 13 Tel. +43-1-58801-0 www.tuwien.ac.at Mobile Peer Model A mobile peer-to-peer communication and coordination framework - with focus on scalability and security DIPLOMA THESIS submitted in partial fulfillment of the requirements for the degree of Diplom-Ingenieur in Software Engineering & Internet Computing by Jörg Schoba, BSc Registration Number 01026309 to the Faculty of Informatics at the TU Wien Advisor: Ao.Univ.Prof. Dipl.-Ing. Dr.techn. Eva Kühn Assistance: Projektass. Dipl.-Ing. Stefan Craß Vienna, 10th October, 2017 Jörg Schoba Eva Kühn Technische Universität Wien A-1040 Wien Karlsplatz 13 Tel. +43-1-58801-0 www.tuwien.ac.at Erklärung zur Verfassung der Arbeit Jörg Schoba, BSc Donaufelderstraße 8/1/12 1210 Wien Hiermit erkläre ich, dass ich diese Arbeit selbständig verfasst habe, dass ich die verwen- deten Quellen und Hilfsmittel vollständig angegeben habe und dass ich die Stellen der Arbeit – einschließlich Tabellen, Karten und Abbildungen –, die anderen Werken oder dem Internet im Wortlaut oder dem Sinn nach entnommen sind, auf jeden Fall unter Angabe der Quelle als Entlehnung kenntlich gemacht habe.
    [Show full text]
  • Copyright, an Incentive Or a Burden?
    Copyright, an Incentive or a Burden? Wolfgang Bein University of Nevada Las Vegas, USA, [email protected] Abstract A copyright provides protection for original artistic or literary work and is valid for the life of the owner plus 70 years. There is a growing tension between creative practices that require access to content that is often copyrighted, and increasingly restrictive intellectual property laws and policies governing access to copyrighted content. Very recently this has played out in the law suit between the media corporation Viacom and the Internet portal YouTube, which is owned by Google. This is against the background of a steadily emerging open source and creative commons culture. Milestones in the open source movement are the OpenOffice office suite, Netscape’s publication of the source code for its product as open software, Google’s library project, various free archives for scientific dissemination, such as Cornell University’s ArXiv. I. INTRODUCTION The gap between the cost of digital media and storage, and a copyrighted digital item (a CD or DVD) continually increases, as Internet is readily available, and the price of digitally duplicating anything capable of being transmitted via digital media dropped to near zero [1]. The use of a copyrighted material is less restrictive than other intellectual properties (patents, trademarks, service marks), even though the copyrighted material cannot be photocopied, scanned or copied in any way. But portions of it can be used for non-commercial purposes. The First Sale Doctrine (Copyright Act, 1976) does allow you to resell or give away the copy of the copyrighted item you bought.
    [Show full text]
  • Gnutella Protocol
    A BRIEF INTRODUCTION AND ANALYSIS OF THE GNUTELLA PROTOCOL By Gayatri Tribhuvan University of Freiburg Masters in Applied Computer Science [email protected] ABSTRACT Peer to peer technology has certainly improved mechanisms of downloading files at a very high rate. Statistics and research show that as more number of peer to peer protocols developed, the number of nodes in the entire network increased. In this paper, we observe the structure and operation of Gnutella , a peer to peer protocol. The paper also focuses on some issues of this protocol and what improvements were further made to improve its scalability. We also have a look at some of the security issues of this protocol. Some statistics in the paper also reflect important changes that the protocol inflicted onto the entire network. PDF Created with deskPDF PDF Writer - Trial :: http://www.docudesk.com 1. INTRODUCTION Gnutella is a p2p protocol. This paper has tried to address some of the issues that have been faced by users of Gnutella, including that of scalability (increasing the scale of operation, i.e. the volume of operation with progressively larger number of users) and security. The Gnutella protocol is an open, decentralized group membership and search protocol, mainly used for file searching and sharing. Group membership is open and search protocol addresses searching and sharing of files. The term Gnutella represents the entire group of computers which have Gnutella speaking applications loaded in them forming a virtual network. Each node can function as both client as well as server. Thus they can issue queries to other nodes as well accept and respond to queries from other nodes, after matching the queries with the contents loaded in their own hard disks.
    [Show full text]
  • A Re-Examine on Assorted Digital Image Encryption Algorithm's
    Biostatistics and Biometrics Open Access Journal ISSN: 2573-2633 Review Article Biostat Biometrics Open Acc J Volume 4 Issue 2 - January 2018 Copyright © All rights are reserved by Thippanna G DOI: 10.19080/BBOAJ.2018.04.555633 A Re-Examine on Assorted Digital Image Encryption Algorithm’s Techniques Thippanna G* Assistant Professor, CSSR & SRRM Degree and PG College, India Submission: October 05, 2017; Published: January 17, 2018 *Corresponding author: Thippanna G, Assistant Professor, CSSR & SRRM Degree and PG College, India, Tel: ; Email: Abstract Image Encryption is a wide area epic topic to research. Encryption basically deals with converting data or information from its original form to another unreadable and unrecognizable form that hides the information in it. The protection of information from unauthorized access is important in network/internet communication. The use of Encryption is provides the data security. The Encrypted Image is secure from any kind cryptanalysis. In the proposed dissertation explain the different encryption algorithms and their approaches to encrypt the images. In this paper introduced a case study on assorted digital image encryption techniques, are helpful to gives knowledge on entire digital image encryption techniques. This can offer authentication of users, and integrity, accuracy and safety of images that is roaming over communication. Moreover, associate image based knowledge needs additional effort throughout encoding and cryptography. Keywords : Encryption; Cryptanalysis; Cryptographic; Algorithm; Block ciphers; Stream ciphers; Asymmetric Encryption Abbreviations : AES: Advanced Encryption Standard; DSA: Digital Signature Algorithm; DSS: Digital Signature Standard; ECDSA: Elliptic Curve Digital Signature Algorithm; DSA: Digital Signature Algorithm Introduction Some cryptographic methods rely on the secrecy of the Encryption algorithms encryption algorithms; such algorithms are only of historical Encryption algorithm, or cipher, is a mathematical function interest and are not adequate for real-world needs.
    [Show full text]
  • The Implementation of ”Kuznyechik” Encryption Algorithm Using NVIDIA CUDA Technology
    The implementation of "Kuznyechik" encryption algorithm using NVIDIA CUDA technology A N Borisov1 and E V Myasnikov1 1Samara National Research University, Moskovskoe Shosse 34А, Samara, Russia, 443086 e-mail: [email protected] Abstract. In this paper, we discuss various options for implementing the "Kuznyechik" block encryption algorithm using the NVIDIA CUDA technology. We use lookup tables as a basis for the implementation. In experiments, we study the influence of the size of the block of threads and the location of lookup tables on the encryption speed. We show that the best results are obtained when the lookup tables are stored in the global memory. The peak encryption speed reaches 30.83 Gbps on the NVIDIA GeForce GTX 1070 graphics processor . 1. Introduction Cryptographic protection is an important part of a modern IT infrastructure. Nowadays, both the volume of information and computing power are continually increasing. Accordingly, there are growing demands on both the robustness and speed of cryptographic algorithms. The idea of using graphics processors to speed up encryption algorithms appeared almost simultaneously with the idea of using them for general-purpose computing[1]. As known, the maximum profit from the use of graphics processors can be achieved only with massive parallel tasks. It is not surprising that the most noticeable results in this field were obtained for block encryption in the ECB (electronic code book) and CTR (gamming) modes, since the blocks of plain text are processed independently in this case. At present, there is a lot of papers, which focuses on using graphics processors for encryption. Most of the papers are devoted to the AES encryption algorithm.
    [Show full text]