Trabajo De Fin De Grado Herramienta Para La Detección De Contenido Oculto En Redes P2P

Total Page:16

File Type:pdf, Size:1020Kb

Trabajo De Fin De Grado Herramienta Para La Detección De Contenido Oculto En Redes P2P UNIVERSIDAD CARLOS III DE MADRID ESCUELA POLITÉCNICA SUPERIOR GRADO EN INGENIERÍA INFORMÁTICA Trabajo de Fin de Grado Herramienta para la detección de contenido oculto en redes P2P Autor: Adrián Alonso González Tutor: Jorge Blasco Alís Septiembre de 2012 Agradecimientos Justo ahora no puedo evitar acordarme de todo el esfuerzo y trabajo dedicado a lo largo de los cuatro años que ha durado mi formación universitaria. Ha sido un camino difícil y lleno de obstáculos pero gracias a ciertas personas he podido seguir adelante y este es el momento de agradecérselo. En primer lugar quiero agradecerle a mi familia todo el apoyo que me han dado, ya que siempre han estado ahí para preguntarme cómo me iba todo, para ayudarme en esos momentos difíciles y para animarme a seguir adelante. Gracias a mis abuelos, a mis tíos, a mis primos y sobre todo a mi madre, sin ellos no sería lo que soy. Tampoco puedo olvidarme de mis amigos, los cuales me han aportado muchísimo en multitud de facetas de mi vida y a día de hoy lo siguen haciendo. Sin ellos habría tirado la toalla en muchas ocasiones pero siempre conseguían sacarme una sonrisa y animarme para que siguiera adelante. Todos y cada uno de ellos son importantísimos para mí pero hay una persona sin la cual, mi vida no sería igual. A esa persona le quiero dar las gracias por muchos motivos, gracias por preocuparte de como avanzaba con el proyecto, gracias por aguantar mis etapas de agobio y mis frustraciones, gracias por animarme en los malos momentos, pero sobre todo, gracias por ser como eres. También me gustaría agradecerle a mis compañeros de universidad los buenos momentos pasados, las cosas que aprendí de a ellos y a que hayan hecho más llevaderos estos cuatro años. No podría olvidarme además de dar las gracias a todos los profesores que he tenido a lo largo de la carrera, gracias a todos y cada uno de ellos he podido aprender muchas cosas y en definitiva formarme en lo que siempre había querido. Por último dar las gracias a mi tutor, Jorge por todo el apoyo que me ha brindado. Gracias a su guía hemos conseguido que este proyecto haya sido un éxito y que todo el esfuerzo invertido haya valido la pena, sin ti nada de esto habría sido posible. Gracias a todos y lo siento si me he dejado alguien. Termina una etapa de mi vida que siempre recordaré con mucho cariño pero empieza otra que seguro será igual o más enriquecedora. Mi futuro comienza hoy. III IV Índice Índice de Ilustraciones ................................................................................................. IX Índice de tablas ........................................................................................................... XI Índice de casos de uso ............................................................................................... XIII Índice de requisitos....................................................................................................XIV Índice de pruebas .......................................................................................................XV Abstract ...................................................................................................................... 16 Capitulo 1: Introducción ............................................................................................. 21 1.1 Motivación del proyecto ............................................................................................ 21 1.2 Objetivos del proyecto ............................................................................................... 25 1.3 Estructura del documento.......................................................................................... 26 Capitulo 2: Análisis ..................................................................................................... 28 2.1 Estado de la Cuestión ................................................................................................. 28 2.1.1 Redes P2P ....................................................................................................................... 28 2.1.1.1 Clasificación de redes P2P .......................................................................................... 31 2.1.1.2 Ejemplos de redes P2P ............................................................................................... 33 2.1.2 Esteganografía ................................................................................................................ 37 2.1.2.1 Técnicas .................................................................................................................... 37 2.1.2.2 Generación del esteganograma ................................................................................. 39 2.1.3 Estegoanálisis ................................................................................................................. 40 2.1.3.1 Análisis visual ............................................................................................................ 41 2.1.3.2 Análisis estructural .................................................................................................... 42 2.1.3.3 Análisis estadístico ..................................................................................................... 44 2.1.4 Estudio de las acciones .................................................................................................... 45 2.2 Alternativas de diseño ............................................................................................... 46 2.2.1 Aspectos de interfaz ........................................................................................................ 46 2.2.1.1 Aplicación con interfaz de usuario gráfica .................................................................. 46 2.2.1.2 Aplicación con interfaz de línea de comandos ............................................................ 47 2.2.2 Decisión de la alternativa de diseño ................................................................................ 48 2.3 Casos de uso .............................................................................................................. 48 2.4 Requisitos .................................................................................................................. 52 2.4.1 Requisitos funcionales..................................................................................................... 53 2.4.2 Requisitos no funcionales ................................................................................................ 58 2.4.2.1 Requisitos de interfaz ................................................................................................ 58 2.4.2.2 Requisitos de comprobación ...................................................................................... 59 2.4.2.3 Requisitos de aceptación de pruebas ......................................................................... 59 2.4.2.4 Requisitos de mantenimiento .................................................................................... 60 2.4.3 Matriz de trazabilidad requisitos-casos de uso ................................................................. 60 2.5 Marco regulador ........................................................................................................ 60 2.6 Restricciones .............................................................................................................. 61 2.7 Plan de pruebas ......................................................................................................... 61 2.7.1 Formato del catálogo de pruebas .................................................................................... 61 V 2.7.2 Catálogo de pruebas de aceptación ................................................................................. 61 2.7.3 Matriz de trazabilidad pruebas-requisitos........................................................................ 64 Capitulo 3: Diseño ...................................................................................................... 66 3.1 Arquitectura de la aplicación ..................................................................................... 66 3.2 Patrón ........................................................................................................................ 67 3.3 Componentes ............................................................................................................. 68 3.3.1 Búsqueda ........................................................................................................................ 69 3.3.2 Descarga ......................................................................................................................... 73 3.3.3 Informes ......................................................................................................................... 77 3.3.4 Detectores ...................................................................................................................... 78 3.3.5 Acciones ......................................................................................................................... 83 3.3.6 Útiles .............................................................................................................................. 89 3.3.7 Principal .......................................................................................................................... 93 3.4 Diagramas de secuencia ............................................................................................. 96 3.4.1 Operación de búsqueda .................................................................................................
Recommended publications
  • OPEN SOURCE Software Enter the World Of
    OPEN SOURCE Software http://www.bacula.org http://eraser.heidi.ie Eraser is a secure data Bacula is a set removal tool for Win- of computer programs that permit manag- dows. It completely removes sensitive data ing backup, recovery, and verification of from your hard drive by overwriting it several computer data across a network of com- times with carefully selected patterns. Eraser puters of different kinds. Based on Source is currently supported under Windows XP Forge downloads, Bacula is the most popu- lar Open Source backup program. (with Service Pack 3), Windows Server 2003 (with Service Pack 2), Windows Vista, Win- dows Server 2008, Windows 7 and Windows Server 2008 R2. http://www.emule-project.net e M u l e is a filesharing client which is based on http://shareaza.sourceforge.net/ the eDonkey2000 network but offers more features than the standard client. Shareaza is a very powerful multi-network eMule is one of the biggest and most peer-to-peer ( P2P ) file-sharing client sup- reliable peer-to-peer file sharing clients porting Gnutella² ( G2 ), Gnutella ( G1 ), around the world. eDonkey2000 ( eMule ), DC++, HTTP, FTP and BitTorrent protocols for Windows (or Wine). It allows you to download any file-type For more OSS, visit sourceforge found on several popular P2P networks. Shareaza is FREE & contains NO Spyware or third-party products. http://www.scintilla.org Scintilla is a free source code editing compo- nent which includes useful features such as syntax styling, error indicators, folding, code completion and call tips. The project includes SciTE (SCIntilla based Text Editor).
    [Show full text]
  • The Edonkey File-Sharing Network
    The eDonkey File-Sharing Network Oliver Heckmann, Axel Bock, Andreas Mauthe, Ralf Steinmetz Multimedia Kommunikation (KOM) Technische Universitat¨ Darmstadt Merckstr. 25, 64293 Darmstadt (heckmann, bock, mauthe, steinmetz)@kom.tu-darmstadt.de Abstract: The eDonkey 2000 file-sharing network is one of the most successful peer- to-peer file-sharing applications, especially in Germany. The network itself is a hybrid peer-to-peer network with client applications running on the end-system that are con- nected to a distributed network of dedicated servers. In this paper we describe the eDonkey protocol and measurement results on network/transport layer and application layer that were made with the client software and with an open-source eDonkey server we extended for these measurements. 1 Motivation and Introduction Most of the traffic in the network of access and backbone Internet service providers (ISPs) is generated by peer-to-peer (P2P) file-sharing applications [San03]. These applications are typically bandwidth greedy and generate more long-lived TCP flows than the WWW traffic that was dominating the Internet traffic before the P2P applications. To understand the influence of these applications and the characteristics of the traffic they produce and their impact on network design, capacity expansion, traffic engineering and shaping, it is important to empirically analyse the dominant file-sharing applications. The eDonkey file-sharing protocol is one of these file-sharing protocols. It is imple- mented by the original eDonkey2000 client [eDonkey] and additionally by some open- source clients like mldonkey [mlDonkey] and eMule [eMule]. According to [San03] it is with 52% of the generated file-sharing traffic the most successful P2P file-sharing net- work in Germany, even more successful than the FastTrack protocol used by the P2P client KaZaa [KaZaa] that comes to 44% of the traffic.
    [Show full text]
  • Darmstadt University of Technology the Edonkey 2000
    Darmstadt University of Technology The eDonkey 2000 Protocol Oliver Heckmann, Axel Bock KOM Technical Report 08/2002 Version 0.8 December 2002 Last major update 22.05.03 Last minor update 27.06.03 E-Mail: {heckmann, bock}@kom.tu-darmstadt.de Multimedia Communications (KOM) Department of Electrical Engineering & Information Technology & Department of Computer Science Merckstraße 25 • D-64283 Darmstadt • Germany Phone: +49 6151 166150 Fax: +49 6151 166152 Email: [email protected] URL: http://www.kom.e-technik.tu-darmstadt.de/ 1. Introduction The Edonkey2000 Protocol is one of the most successful file sharing protocols and used by the original Edonkey2000 client and the open source clients mldonkey and EMule. The Edonkey2000 Protocol can be classified as decentral file sharing protocol with distributed servers. Contrary to the original Gnutella Protocol it is not completely decentral as it uses servers; contrary to the original Napster protocol it does not use a single server (farm) which is a single point of failure, instead it uses servers that are run by power users and offers mechanisms for inter-server communication. Unlinke Peer-to-Peer (P2P) proto- cols like KaZaa, Morpheus, or Gnutella the eDonkey network has a client/server based structure. The servers are slightly similar to the KaZaa supernodes, but they do not share any files, only manage the information distribution and work as several central dictionaries which hold the information about the shared files and their respective client locations. In the Edonkey network the clients are the nodes sharing data. Their files are indexed by the servers. If they want to have a piece of data (a file), they have to connect using TCP to a server or send a short search request via UDP to one or more servers to get the necessary information about other clients sharing that file.
    [Show full text]
  • Vysoke´Ucˇenítechnicke´V Brneˇ
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Digital library of Brno University of Technology VYSOKE´ UCˇ ENI´ TECHNICKE´ V BRNEˇ BRNO UNIVERSITY OF TECHNOLOGY FAKULTA INFORMACˇ NI´CH TECHNOLOGII´ U´ STAV POCˇ ´ITACˇ OVY´ CH SYSTE´ MU˚ FACULTY OF INFORMATION TECHNOLOGY DEPARTMENT OF COMPUTER SYSTEMS DETEKCE DYNAMICKY´ CH SI´TˇOVY´ CH APLIKACI´ DIPLOMOVA´ PRA´ CE MASTER’S THESIS AUTOR PRA´ CE Bc. PAVEL BURIA´ N AUTHOR BRNO 2013 VYSOKE´ UCˇ ENI´ TECHNICKE´ V BRNEˇ BRNO UNIVERSITY OF TECHNOLOGY FAKULTA INFORMACˇ NI´CH TECHNOLOGII´ U´ STAV POCˇ ´ITACˇ OVY´ CH SYSTE´ MU˚ FACULTY OF INFORMATION TECHNOLOGY DEPARTMENT OF COMPUTER SYSTEMS DETEKCE DYNAMICKY´ CH SI´TˇOVY´ CH APLIKACI´ DETECTION OF DYNAMIC NETWORK APPLICATIONS DIPLOMOVA´ PRA´ CE MASTER’S THESIS AUTOR PRA´ CE Bc. PAVEL BURIA´ N AUTHOR VEDOUCI´ PRA´ CE Ing. JAN KASˇ TIL SUPERVISOR BRNO 2013 Abstrakt Tato práce se zabývá detekcí dynamických síťových aplikací. Popisuje některé stávající protokoly a zpùsoby jejich identifikace z IP tokù a obsahu paketù. Pøedstavuje návrh de- tekčního systému, založeného na automatické tvorbě regulárních výrazů a popisuje jeho implementaci. Prezentuje vytvoøené regulární výrazy pro BitTorrent a eDonkey protokol. Jejich kvalitu srovnává s řešením L7-filteru. Abstract This thesis deals with detection of dynamic network applications. It describes some of the existing protocols and methods of their identification from IP flow and packet contents. It constitues a design of a detection system based on the automatic creation of regular expressions and describes its implementation. It presents the created regular expressions for BitTorrent and eDonkey protocol. It compares their quality with the solution of L7-filter.
    [Show full text]
  • The People Who Invented the Internet Source: Wikipedia's History of the Internet
    The People Who Invented the Internet Source: Wikipedia's History of the Internet PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Sat, 22 Sep 2012 02:49:54 UTC Contents Articles History of the Internet 1 Barry Appelman 26 Paul Baran 28 Vint Cerf 33 Danny Cohen (engineer) 41 David D. Clark 44 Steve Crocker 45 Donald Davies 47 Douglas Engelbart 49 Charles M. Herzfeld 56 Internet Engineering Task Force 58 Bob Kahn 61 Peter T. Kirstein 65 Leonard Kleinrock 66 John Klensin 70 J. C. R. Licklider 71 Jon Postel 77 Louis Pouzin 80 Lawrence Roberts (scientist) 81 John Romkey 84 Ivan Sutherland 85 Robert Taylor (computer scientist) 89 Ray Tomlinson 92 Oleg Vishnepolsky 94 Phil Zimmermann 96 References Article Sources and Contributors 99 Image Sources, Licenses and Contributors 102 Article Licenses License 103 History of the Internet 1 History of the Internet The history of the Internet began with the development of electronic computers in the 1950s. This began with point-to-point communication between mainframe computers and terminals, expanded to point-to-point connections between computers and then early research into packet switching. Packet switched networks such as ARPANET, Mark I at NPL in the UK, CYCLADES, Merit Network, Tymnet, and Telenet, were developed in the late 1960s and early 1970s using a variety of protocols. The ARPANET in particular led to the development of protocols for internetworking, where multiple separate networks could be joined together into a network of networks. In 1982 the Internet Protocol Suite (TCP/IP) was standardized and the concept of a world-wide network of fully interconnected TCP/IP networks called the Internet was introduced.
    [Show full text]
  • Gnutella Etc
    Uni Innsbruck Informatik - 1 Peer-to-Peer Systems Unstructured P2P File Sharing Systems Michael Welzl [email protected] DPS NSG Team http://dps.uibk.ac.at/nsg Institute of Computer Science University of Innsbruck, Austria Uni Innsbruck Informatik - 2 Unstructured vs. Structured P2P systems • Terms refer to information management: where are objects placed, how are they found? – Distributed “randomly“ across the network, with several replicas – Content source stays where it is – Structured P2P systems: rules bind content to (typically hash) keys, which are used as addresses (“document routing model“) • Systems like Napster, Gnutella etc. are unstructured • Three common models: – Centralized (also: “central server model“); e.g. Napster, BitTorrent –Pure; e.g. Gnutella 0.4, Freenet “flooded request model“ –Hybrid; e.g. Gnutella 0.6, Kazaa, JXTA Uni Innsbruck Informatik - 3 Development of P2P Applications 100% Freenet Direct Connect++ Shoutcast Carracho 90% Blubster Neo-M odus 80% FastTrack WinM X FastTrack Shoutcast 70% Audiogalaxy eDonkey2000 Hotline 60% Gnutella BitTorrent 50% 40% 30% datavolumes in per week % 20% edonkey BitTorrent Gnutella 10% 0% 18.02.2002 18.05.2002 18.08.2002 18.11.2002 18.02.2003 18.05.2003 18.08.2003 18.11.2003 18.02.2004 18.05.2004 18.08.2004 Data source: http://netflow.internet2.edu/weekly/ Traffic portions of the different P2P applications and protocols from the traffic measured per week in the Abilene backbone from 18.02.2002 until 18.010.2004 Uni Innsbruck Informatik - 4 Development of P2P applications
    [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]
  • 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]
  • Hash Collision Attack Vectors on the Ed2k P2P Network
    Hash Collision Attack Vectors on the eD2k P2P Network Uzi Tuvian Lital Porat Interdisciplinary Center Herzliya E-mail: {tuvian.uzi,porat.lital}[at]idc.ac.il Abstract generate colliding executables – two different executables which share the same hash value. In this paper we discuss the implications of MD4 In this paper we present attack vectors which use collision attacks on the integrity of the eD2k P2P such colliding executables into an elaborate attacks on network. Using such attacks it is possible to generate users of the eD2k network which uses the MD4 hash two different files which share the same MD4 hash algorithm in its generation of unique file identifiers. value and therefore the same signature in the eD2k By voiding the 'uniqueness' of the identifiers, the network. Leveraging this vulnerability enables a attacks enable selective distribution – distributing a covert attack in which a selected subset of the hosts specially generated harmless file as a decoy to garner receive malicious versions of a file while the rest of the popularity among hosts in the network, and then network receives a harmless one. leveraging this popularity to send malicious We cover the trust relations that can be voided as a executables to a specific sub-group. Unlike consequence of this attack and describe a utility conventional distribution of files over P2P networks, developed by the authors that can be used for a rapid the attacks described give the attacker relatively high deployment of this technique. Additionally, we present control of the targets of the attack, and even lets the novel attack vectors that arise from this vulnerability, attacker terminate the distribution of the malicious and suggest modifications to the protocol that can executable at any given stage.
    [Show full text]
  • Abkürzungs-Liste ABKLEX
    Abkürzungs-Liste ABKLEX (Informatik, Telekommunikation) W. Alex 1. Juli 2021 Karlsruhe Copyright W. Alex, Karlsruhe, 1994 – 2018. Die Liste darf unentgeltlich benutzt und weitergegeben werden. The list may be used or copied free of any charge. Original Point of Distribution: http://www.abklex.de/abklex/ An authorized Czechian version is published on: http://www.sochorek.cz/archiv/slovniky/abklex.htm Author’s Email address: [email protected] 2 Kapitel 1 Abkürzungen Gehen wir von 30 Zeichen aus, aus denen Abkürzungen gebildet werden, und nehmen wir eine größte Länge von 5 Zeichen an, so lassen sich 25.137.930 verschiedene Abkür- zungen bilden (Kombinationen mit Wiederholung und Berücksichtigung der Reihenfol- ge). Es folgt eine Auswahl von rund 16000 Abkürzungen aus den Bereichen Informatik und Telekommunikation. Die Abkürzungen werden hier durchgehend groß geschrieben, Akzente, Bindestriche und dergleichen wurden weggelassen. Einige Abkürzungen sind geschützte Namen; diese sind nicht gekennzeichnet. Die Liste beschreibt nur den Ge- brauch, sie legt nicht eine Definition fest. 100GE 100 GBit/s Ethernet 16CIF 16 times Common Intermediate Format (Picture Format) 16QAM 16-state Quadrature Amplitude Modulation 1GFC 1 Gigabaud Fiber Channel (2, 4, 8, 10, 20GFC) 1GL 1st Generation Language (Maschinencode) 1TBS One True Brace Style (C) 1TR6 (ISDN-Protokoll D-Kanal, national) 247 24/7: 24 hours per day, 7 days per week 2D 2-dimensional 2FA Zwei-Faktor-Authentifizierung 2GL 2nd Generation Language (Assembler) 2L8 Too Late (Slang) 2MS Strukturierte
    [Show full text]
  • An Architecture Concept for Mobile P2P File Sharing Services
    An Architecture Concept for Mobile P2P File Sharing Services Frank-Uwe Andersen§, Hermann de Meer†,IvanDedinski†, Cornelia Kappler§, Andreas Mader¨ ‡, Jens O. Oberender†, and Kurt Tutschku‡ † University of Passau, Chair of Computer Networks and Computer Communications [dedinski|demeer|oberender]@fmi.uni-passau.de ‡ University of Wurzburg,¨ Department of Distributed Systems [maeder|tutschku]@informatik.uni-wuerzburg.de § SIEMENS AG, ICM N PG NT SP RC PN [frank-uwe.andersen|cornelia.kappler]@siemens.com Abstract: File-sharing in mobile networks has differing demands to a P2P archi- tecture. Resource access and mediation techniques must follow constraints given in 2.5G/3G networks. Enhancing the eDonkey protocol, we reconcile decentralized op- eration with traffic control. 1 Requirements for Mobile P2P File Sharing Services P2P systems in mobile environments face multiple challanges: highly varying online- state (presence), hierarchical network structure, and limited device capabilities. Network operators desire traffic control while preserving the experience of wired P2P. In order to share resources, P2P applications need to support two fundamental coordi- nation and control functions: a) resource mediation mechanisms, i. e., functions to locate resources or entities, and b) resources control mechanisms, i. e., functions to permit, prior- itize, and schedule the access to resources. Pure P2P architecturesare implementing both mechanisms in a fully decentralized manner. Hybrid P2P systems utilize central entites, e. g. the eDonkey index servers collect and distribute file location information for all peers. User-provided content and decentralized resource storage made P2P applications success- ful. However, resource mediation is more effective centralized, while decentralized re- source control could be outweighted from bandwidth costs.
    [Show full text]
  • Forensics in Peer-To-Peer Sharing and Associated Litigation Challenges
    Forensics in Peer-to-Peer Sharing and Associated Litigation Challenges Presented by Mo Hamoudi, Seattle, WA ([email protected]) Terry Lahman, Snoqualmie, WA ([email protected]) 1 Statement of Probable Cause “Between April 08, 2016, and April 09, 2016, while acting in an undercover capacity, I used a law enforcement version of eMule, a commonly used P2P file sharing program for the eD2k file sharing network, to monitor for P2P users possessing and distributing image and video files depicting child pornography. I used the law enforcement version of eMule to download several files depicting child pornography from a P2P user at IP address <redacted> (the SUBJECT IP ADDRESS).” The statement of probable cause implies the detective was sitting at a computer utilizing a special version of software to identify and download suspected child pornography. It also implies that the specialize software is running autonomously on the detective’s computer. The law enforcement version of eMule runs automatically without user invention. And the law enforcement computer is only one component of a large scale network of computers. Digging into the technical data of the law enforcement version of eMule required a deep investigation similar to peeling an onion, one layer at a time. The entire process required a number of discovery requests to peel back each layer. Each new discovery item was analyzed to dig deeper into the next layer. PRACTICE POINT: The practitioner needs to use the Federal Rules of Criminal Procedure 16 or its state counterpart to obtain information beyond the affidavit. United States v. Soto-Zuniga, 837 F.3d 992 (9th Cir.
    [Show full text]