DOCSLIB.ORG

Nullix 131 (LYX 2.1.5)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Nullix 131 (LYX 2.1.5) Nullix 131 (LYX 2.1.5) Pierre L. Douillet 17 septembre 2019 (a short tale of modern ages - 2) Résumé Tant que l’on n’a jamais su que Alzheimer s’écrivait avec un "h", il n’y a aucun problème à ne pas s’en souvenir. Mais il n’y a rien de plus agaçant que de savoir que l’on a rencontré la réponse à un problème technique dans un bouquin de 999 pages (et c’était sur une page de gauche, mais peut-être aussi sur une page de droite)... Tandis qu’un document informatisé est facile à interroger, et en même temps plus difficile à égarer qu’une suite de notes papier. Les distributions visées sont SuSE − 6:1, SuSE − 6:2, SuSE − 6:3, SuSE − 6:4, SuSE − 7:0, SuSE − 7:2, SuSE − 7:3, SuSE − 8:0, SuSE − 8:1, SuSE − 9:3, SuSE − 10:2, SuSE − 11:0, SuSE − 11:3, SuSE − 11:4; SuSE − 13:1 et SuSE − 42:1. D’autres distributions existent. Par exemple RedHat, dont au moins une livraison formate spontanément tous les disques durs d’une machine, etc. Dans ce qui suit, les items numérotés décrivent les questions ayant trouvé une réponse (même désagréable) tandis que les items avec des boulets décrivent les questions restées en suspens. Par ailleurs, la taille de ce document augmentant au fil du temps, nous l’avons fractionné en quatre parties : (1) installation proprement dite, (2) configuration d’un système installé, (3) partie "appli- cative" des problèmes rencontrés, (4) collation des batchs utilisés pour la configuration du barnum. Incl. 1 Floating algorithm, with a 30_mm_cat, a boxed equation and a 15%_cat p ρ = ax2 + bx + c Fig. 1: Floating empty figure Tab. 1: Floating empty table 1 Index /etc/hosts, 63 S /etc/init.d/lpd, 49 sed, 60 /etc/profile, 45 subtitles, 117 suroot, 57 A SuSEfirewall2, 23 amarok, 120 azureus, 109 U uid, 27 C upsc, 30 cueape, 122 upsd, 27 cups, 47 upsmon, 27 E V encodage des vidéos, 116 vlc, 122 F X filepif, 32, 33 xine, 122 G Z gaupol, 118 zenmap, 15 gmplayer, 119 gnome-subtitles, 117 H HOST, 45, 61 HOSTNAME, 61 I icône, 32 K kaffeine, 122 L logger, 18 M magic, 33 mimelink, 33 mimepif, 32 mkpasswd, 86 mplayer, 119 N nmap, 15 NUT, 27 O Onduleurs, 27 P persistent-rules, 61 pictogramme, 32 R Redirect, 93 root konsole, 57 route.conf, 63 2 TABLE DES MATIÈRES TABLE DES MATIÈRES Table des matières Index 2 Table des matières 3 Liste des Figures 10 Liste des Tableaux 10 Liste des Inclusions 11 1 Sécurité 13 1.1 Le path de root et de su root................................. 13 1.2 Login manager......................................... 13 1.2.1 Mode terminal..................................... 13 1.2.2 Mode graphique.................................... 14 1.3 Services ouverts par runlevel ou inetd............................ 15 1.4 Enregistrement de messages dans les fichiers /var/log/*.log................ 17 1.4.1 Généralités....................................... 17 1.4.2 La méthode syslog................................... 18 1.4.3 Gestion directe par les applications.......................... 19 1.5 Rotation des fichiers /var/log/*.log (SuSE − 42:1)..................... 20 1.6 Rotation des fichiers /var/log/*.log (oldies)......................... 21 1.7 Traitement des *.log...................................... 22 1.8 SuSEfirewall2......................................... 23 1.8.1 Nouvelles remarques.................................. 23 1.8.2 Anciennes remarques.................................. 23 1.9 Exploitation de firewall.log.................................. 24 1.10 Modules pam.......................................... 24 1.11 Exemple de logs pam...................................... 24 1.12 Nouveaux utilisateurs..................................... 27 2 Onduleurs 27 2.1 Hardware............................................ 27 2.2 Management NUT....................................... 27 2.2.1 Fichiers de configuration (1).............................. 27 2.2.2 Tester la communication (ser)............................. 28 2.2.3 Tester la communication (usb)............................ 28 2.2.4 Identifier un Onduleurs usb.............................. 28 2.2.5 documentation..................................... 29 2.2.6 fichiers de configuration (2).............................. 29 2.2.7 Lancement du serveur................................. 30 2.3 Résultats............................................ 30 2.4 Management Sun........................................ 31 3 Icônes, etc. 32 3.1 Introduction........................................... 32 3.1.1 Pictogrammes, filepifs, mimepifs........................... 32 3.1.2 Salades catalanes.................................... 32 3.1.3 Localisation des pictogrammes et filepifs....................... 33 3.1.4 Répertoires (SuSE − 11:3 et après)......................... 33 3.1.5 Pour mémoire: répertoires SuSE − 10:2 ....................... 33 3.2 Gestion des mimetypes..................................... 34 3.2.1 Les mimetypes (SuSE − 11:3 et après)........................ 34 3.2.2 Pour mémoire: les mimetypes sous SuSE − 10:2 .................. 35 3.3 Gestion des filepifs (icônes).................................. 35 3.3.1 Une expérimentation................................. 38 3.3.2 Pour mémoire : fichiers *.directory.......................... 38 3.4 Arborescences.......................................... 39 3.5 Lanceurs............................................. 39 3 TABLE DES MATIÈRES TABLE DES MATIÈRES 3.5.1 Pourquoi icewm plutôt que plasma ?......................... 39 3.5.2 Lanceur icewm..................................... 39 3.5.3 Lanceur plasma (KdE_4)............................... 40 3.5.4 Pour mémoire: lanceur kicker (KdE_2=KdE_3).................. 40 3.5.5 Pour mémoire : lanceur kpanel (KdE_1)...................... 41 3.5.6 Templates........................................ 41 3.6 Synchronisation......................................... 41 4 Réglages du Bureau 41 4.1 HelpCenter........................................... 41 4.2 Claviers et polices....................................... 41 4.2.1 Collecter les informations............................... 42 4.2.2 LANG et LC_xx.................................... 42 4.2.3 Association des multi-touches aux caractères.................... 43 4.2.4 Pour mémoire (SuSE − 8:1)............................. 44 4.2.5 Pour mémoire : claviers SaX............................. 44 4.2.6 Problème de polices (SuSE − 7:2).......................... 44 4.3 Profilage............................................ 45 4.3.1 Où placer les modifications ?............................. 45 4.3.2 /etc/profile.local.................................... 45 4.3.3 Pour mémoire: une ancienne erreur.......................... 46 4.4 Réglages auto (batch mk_install)............................... 46 4.5 Imprimer............................................ 46 4.5.1 Démon cups (depuis SuSE − 8:1).......................... 47 4.5.2 Imprimante HP Officejet Pro 8600 N911a (mcolor)................. 47 4.5.3 Imprimante Samsung ML-2855ND (mountain)................... 47 4.5.4 Pour mémoire: imprimante HP845C (depuis SuSE − 7:3)............. 48 4.5.5 Pour mémoire: imprimante Samsung ML-7050N (mexico)............. 48 4.5.6 Pour mémoire : le démon lpd (jusqu’à la SuSE − 7:3)............... 49 4.5.7 Pour mémoire : imprimante HP5M (printcap, SuSE − 7:2)............ 50 4.5.8 Pour mémoire : imprimante HP840C......................... 50 4.5.9 Copies multiples.................................... 51 4.6 systemsettings......................................... 52 4.6.1 Réglages ergonomiques minimaux........................... 52 4.6.2 Localisation du menu de systemsettings....................... 52 4.7 Pour mémoire: kcontrol.................................... 53 4.7.1 Localisation du menu de kcontrol........................... 53 4.7.2 Réglages de FileBrowsing (dans KdeControlCenter)................ 54 4.7.3 Réglages de LookNFeel (dans KdeControlCenter).................. 54 4.7.4 Réglages de Personalization (dans KdeControlCenter)............... 55 4.7.5 Réglages de System (dans KdeControlCenter).................... 55 4.7.6 Gestion des langues.................................. 55 4.7.7 Problèmes non résolus................................. 55 4.8 Le file manager......................................... 56 4.8.1 dolphin......................................... 56 4.8.2 konqueror........................................ 56 4.8.3 konqsidebartng..................................... 56 4.8.4 Pour mémoire : l’ancien file manager : kfm..................... 56 4.9 Terminal konsole........................................ 57 4.9.1 Consoles locales..................................... 57 4.9.2 Consoles root...................................... 57 4.9.3 Consoles à distance................................... 58 4.9.4 Pour mémoire : terminal kvt............................. 58 4.10 Montage de fichiers : mount.................................. 58 4.11 Purger les inutilités....................................... 59 5 Scripts 60 5.1 Commandes shell........................................ 60 5.2 Filtrage sed........................................... 60 4 TABLE DES MATIÈRES TABLE DES MATIÈRES 6 Réseaux: quelques préalables 60 6.1 Nommer la machine...................................... 61 6.2 Récupérer les morceaux.................................... 61 6.2.1 Gestion ifup/ifdown.................................. 61 6.2.2 Gestion NetworkManager............................... 61 6.3 Anciennes remarques...................................... 62 6.3.1 Récupérer les morceaux................................ 62 6.3.2 Valider les modifications................................ 62 6.4 Compilation et installation d’un driver..........................
Load more

Recommended publications
  • 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]
  • 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]
  • Technical Report Java Multi User Learning Environment (Jmule)
    JMule team 3/8/2004 Technical Report Java Multi User Learning Environment (jMule) Ioannis Baltopoulos Robin Kilpatrick Hannes Ricklefs Neil Saunders [email protected] [email protected] [email protected] [email protected] University of Kent, University of Kent, University of Kent, University of Kent, Computing Laboratory, Computing Laboratory, Computing Laboratory, Computing Laboratory, Canterbury, CT2 7NF Canterbury, CT2 7NF Canterbury, CT2 7NF Canterbury, CT2 7NF ABSTRACT This report provides an overview of the final year project undertaken as part of a BSc (Hons) degree in Computer Science at the University of Kent during the academic year 2003-4. The project involved creating a software application that enables multiple physically isolated individuals to collaborate, learn, and give presentations through virtual meetings. The solution produced was entitled jMule, the Java Multi User Learning Environment. This paper outlines the processes, design rationale, implementation and testing that were conducted during this project and offers an exploration of possible future enhancements. It concludes by offering critical evaluation on the overall success of the project. Keywords Distance Collaboration, Distant Learning, Virtual Presence, Collaboration in Education 1. INTRODUCTION ................................................1 6.2 User Evaluations ..........................................6 1.1 Background .................................................1 6.3 Performance Measures ...................................6 1.2 Aims ..........................................................2
    [Show full text]
  • Tiago Miguel Laureano Alves N O I T a U L a V E Y T I L a U Q
    Universidade do Minho Escola de Engenharia Tiago Miguel Laureano Alves n o i t a u l a v E y t i l a u Q t Benchmark-based Software Product c u d Quality Evaluation o r P e r a w t f o S d e s a b - k r a m h c n e B s e v l A o n a e r u a L l e u g i M o g a i T 1 1 0 2 | o h n i M U Novembro de 2011 Universidade do Minho Escola de Engenharia Tiago Miguel Laureano Alves Benchmark-based Software Product Quality Evaluation Tese de Doutoramento Doutoramento em Informática Trabalho efectuado sob a orientação do Professor Doutor José Nuno Oliveira e do Doutor Joost Visser Novembro de 2011 É AUTORIZADA A REPRODUÇÃO PARCIAL DESTA TESE APENAS PARA EFEITOS DE INVESTIGAÇÃO, MEDIANTE DECLARAÇÃO ESCRITA DO INTERESSADO, QUE A TAL SE COMPROMETE; Universidade do Minho, ___/___/______ Assinatura: ________________________________________________ Acknowledgments These past four years of PhD were a truly fantastic experience, both professionally and personally. Not only I was granted the opportunity of doing research in exclusivity but also I received support by supervisors, organizations, colleagues, friends and family. It was due to their support that I have made it, and this means the world to me. Hence, I would like to thank all those who supported me and it is to them I dedicate this work. First, I want to start thanking my supervisors: Joost Visser and Jose´ Nuno Oliveira.
    [Show full text]
  • Downloading from Those Other Peers Which Are Nearest (In Network Keywords: Hops)
    Computer Networks 56 (2012) 642–660 Contents lists available at SciVerse ScienceDirect Computer Networks journal homepage: www.elsevier.com/locate/comnet Adaptive Search Radius – Using hop count to reduce P2P traffic q ⇑ Ricardo Lopes Pereira a, , Teresa Vazão a, Rodrigo Rodrigues b a INESC-ID/Instituto Superior Técnico, Technical University of Lisbon, Av. Professor Cavaco Silva, 2744-016 Porto Salvo, Portugal b Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern and Saarbrücken, Germany article info abstract Article history: Peer-to-Peer (P2P) file sharing accounts for a very significant part of the Internet’s traffic, Received 14 May 2010 affecting the performance of other applications and translating into significant peering Received in revised form 8 April 2011 costs for ISPs. It has been noticed that, just like WWW traffic, P2P file sharing traffic shows Accepted 24 October 2011 locality properties, which are not exploited by current P2P file sharing protocols. Available online 31 October 2011 We propose a peer selection algorithm, Adaptive Search Radius (ASR), where peers exploit locality by only downloading from those other peers which are nearest (in network Keywords: hops). ASR ensures swarm robustness by dynamically adapting the distance according to Peer-to-Peer file part availability. ASR aims at reducing the Internet’s P2P file sharing traffic, while File sharing Traffic reduction decreasing the download times perceived by users, providing them with an incentive to Performance improvement adopt this algorithm. We believe ASR to be the first locality-aware P2P file sharing system Locality aware that does not require assistance from ISPs or third parties nor modification to the server infrastructure.
    [Show full text]
  • Adaptive Search Radius - Using Hop Count to Reduce P2P Traffic✩
    Adaptive Search Radius - Using hop count to reduce P2P traffic✩ Ricardo Lopes Pereira∗,a, Teresa Vazao˜ a, Rodrigo Rodriguesb aINESC-ID / Instituto Superior T´ecnico, Technical University of Lisbon Av. Professor Cavaco Silva, 2744-016 Porto Salvo, Portugal bMax Planck Institute for Software Systems (MPI-SWS) Kaiserslautern and Saarbr¨ucken, Germany Abstract Peer-to-peer (P2P) file sharing accounts for a very significant part of the Internet’s traffic, affecting the performance of other applications and translating into significant peering costs for ISPs. It has been noticed that, just like WWW traffic, P2P file sharing traffic shows locality properties, which are not exploited by current P2P file sharing protocols. We propose a peer selection algorithm, Adaptive Search Radius (ASR), where peers exploit locality by only down- loading from those other peers which are nearest (in network hops). ASR ensures swarm robustness by dynamically adapting the distance according to file part availability. ASR aims at reducing the Internet’s P2P file sharing traffic, while decreasing the download times perceived by users, providing them with an incentive to adopt this algorithm. We believe ASR to be the first locality-aware P2P file sharing system that does not require assistance from ISPs or third parties nor modification to the server infrastructure. We support our proposal with extensive simulation studies, using the eDonkey/eMule protocol on SSFNet. These show a 19 to 29% decrease in download time and a 27 to 70% reduction in the traffic carried by tier-1 ISPs. ASR is also compared (favourably) with Biased Neighbour Selection (BNS), and traffic shaping.
    [Show full text]
  • 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.
    [Show full text]
  • Improving Performance and Availability in Peer-To-Peer Content
    PERFORMANCE AND AVAILABILITY INPEER-TO-PEERCONTENTDISTRIBUTIONSYSTEMS: ACASEFORAMULTILATERALINCENTIVEAPPROACH Vom Fachbereich Elektrotechnik und Informationstechnik der Technischen Universität Darmstadt zur Erlangung des akademischen Grades eines Doktor-Ingenieurs (Dr.-Ing.) genehmigte Dissertation von dipl.-inform. sebastian kaune Geboren am 14. November 1979 in Darmstadt, Hessen Vorsitz: Prof. Dr.-Ing. Thomas Hartkopf Referent: Prof. Dr.-Ing. Ralf Steinmetz Korreferent: Prof. Dr.-Ing. Jörg Eberspächer Korreferent: Dr. Andreas Mauthe Tag der Einreichung: 25. November 2010 Tag der Disputation: 10. Februar 2011 Hochschulkennziffer D17 Darmstadt 2011 Dieses Dokument wird bereitgestellt von This document is provided by tuprints, E-Publishing-Service der Technischen Universität Darmstadt. http://tuprints.ulb.tu-darmstadt.de [email protected] Bitte zitieren Sie dieses Dokument als: Please cite this document as: URN: urn:nbn:de:tuda-tuprints-24924 URL: http://tuprints.ulb.tu-darmstadt.de/2492 Die Veröffentlichung steht unter folgender Creative Commons Lizenz: Namensnennung – Keine kommerzielle Nutzung – Keine Bearbeitung 3.0 Deutschland This publication is licensed under the following Creative Commons License: Attribution – Noncommercial – No Derivs 3.0 http://creativecommons.org/licenses/by-nc-nd/3.0/de/ http://creativecommons.org/licenses/by-nc-nd/3.0/ ABSTRACT The peer-to-peer paradigm offers the potential to address many of the challenges related to large-scale content distribution over the Internet (e.g., scalability, costs, etc.). However, currently, many approaches fail to offer the quality of service supported by over- provisioned client-server distribution systems such as RapidShare and YouTube. The reason for this is that peer-to-peer systems must operate under the constraints placed on them by contributing users.
    [Show full text]
  • Icofcs 2011.Indd
    DOI: http://dx.doi.org/10.5769/C2011004 Identificação de Artefatos Periciais do eMule Rodrigo Lange1, and Célia Ghedini Ralha2 (1) Departamento de Polícia Federal, Setor Técnico-Científico do Paraná, Curitiba, PR, Brasil, [email protected] (2) Universidade de Brasília, Departamento de Ciências da Computação, Brasília, DF, Brasil, [email protected] Resumo — Houve um grande aumento da demanda pela arquiteturas. Atualmente, o sítio oficial do eServer 1 não está realização de exames periciais para a identificação de atividades ativo. criminosas realizadas através do compartilhamento de arquivos por redes peer-to-peer (P2P), principalmente de material A primeira versão do eMule (0.02) foi disponibilizada envolvendo a exploração sexual de crianças e adolescentes. O em julho de 2002, mas ainda não era operacional. A partir eMule é um dos programas P2P mais utilizados no Brasil e da versão 0.05a, lançada em agosto de 2002, este aplicativo representa uma significativa parcela dos casos identificados passou a apresentar as funcionalidades necessárias para a de disponibilização e divulgação de material envolvendo troca de arquivos através de redes P2P. pornografia infantojuvenil. Neste trabalho, são detalhados alguns vestígios deixados pelo aplicativo P2P eMule, os Atualmente, o eMule é um software livre, distribuído quais permitem a comprovação da materialidade delituosa. sob a GNU General Public License, e seu código-fonte é Com os resultados apresentados neste trabalho é possível o disponibilizado no sítio oficial do aplicativo 2. desenvolvimento de ferramentas para automatizar a tarefa de captura de dados do eMule, o que pode facilitar o procedimento O código-fonte do eMule, escrito em Microsoft Visual pericial de comprovação de crimes cometidos através de C++, foi utilizado para o desenvolvimento de diversos outros compartilhamento de arquivos via rede P2P.
    [Show full text]
  • Directshare a Fast and Secure Peer to Peer File Sharing Protocol
    DirectShare A Fast and Secure Peer to Peer File Sharing Protocol Student Name: Arpan Jati IIIT-D-MTech-CS-IS-11-002 July 1, 2013 Indraprastha Institute of Information Technology New Delhi Thesis Committee Somitra Sanadhya (Chair) Sanjit Kaul RK Agrawal Submitted in partial fulfillment of the requirements for the Degree of M.Tech. in Computer Science, with specialization in Information Security c 2013 Arpan Jati All rights reserved Keywords: P2P networks, protocol design, application development, networking, Secure systems design and implementation, human computer interaction, and real-world implementation and study Certificate This is to certify that the thesis titled "A Fast and Secure Peer to Peer File Sharing Protocol" submitted by Arpan Jati for the partial fulfillment of the requirements for the degree of Master of Technology in Computer Science & Engineering is a record of the bonafide work carried out by her him under my guidance and supervision in the Security and Privacy group at Indraprastha Institute of Information Technology, Delhi. This work has not been submitted anywhere else for the reward of any other degree. Dr. Somitra Kr. Sanadhya Indraprastha Institute of Information Technology, New Delhi Abstract Many Peer to Peer (P2P) protocols and applications have become popular in the recent years and P2P accounts for a very large portion of the internet traffic. But, most protocols are designed with speed and efficiency in mind, and not security. In this thesis a new protocol DirectShare is proposed; it is primarily designed for a large user base but with security in mind. DirectShare allows to share files in a very efficient manner, at the same time there are provisions to allow for strictly restricted file sharing between a group of users, there are also techniques which guarantees the identity of users.
    [Show full text]
  • Parimulo: Kad
    Università degli studi di Padova Facoltà di Ingegneria Corso di Laurea Magistrale in Ingegneria Informatica PariMulo: Kad Supervisor: Chiar.mo Prof. Enoch Peserico Stecchini Negri De Salvi Student: Francesco Mattia Academic Year 2010-2011 To myself, Because I deserve it. Summary With the advent of broadband connections and computing power available in every kind of digital equipment there is a need to share resources, such as information, among people. To fulfill this need in these years we have seen an amazing growth of distributed systems: cloud computing services, web applications, peer-to-peer systems, etc. In this context is born PariPari, a project which aims to build a modern peer-to-peer network of computers that runs various services, among which there is an eMule-compatible client, called PariMulo. As it is well known even to less computer-savvy people, there have been some problems with the centralized server-based structure of the original eDonkey network, and it has helped the development of a new network, Kad, based upon the Kademlia protocol. This work focuses on the implementation of Kad in PariMulo, starting by first describing the protocol and how the network works, and then providing an in-depth vision of the implementation considering security and perfor- mance issues. Finally we make some observations about future possibilities of development. This thesis was written both for people curious about the inner workings of a modern distributed peer-to-peer network and for developers of software compatible with such networks. I Contents 1 Introduction 1 1.1 The PariPari Project . .1 1.2 PariMulo Plug-in for PariPari .
    [Show full text]
  • Icofcs 2011.Indd
    2011 ICoFCSPROCEEDING OF THE SIXTH INTERNATIONAL 2011 CONFERENCE ON FORENSIC COMPUTER SCIENCE PROCEEDING OF THE SIXTH INTERNATIONAL CONFERENCE ON FORENSIC COMPUTER SCIENCE Print ISBN 978-85-65069-07-6 By ASSOCIAÇÃO BRASILEIRA DE ESPECIALISTAS EM ALTA TECNOLOGIA - ABEAT ICoFCSPROCEEDING OF THE SIXTH INTERNATIONAL 2011 CONFERENCE ON FORENSIC COMPUTER SCIENCE 1st Edition Brasília, DF Abeat 2011 Proceeding of the Sixth International Conference on Forensic Computer Science – ICoFCS 2011 ABEAT (ed.) – Brasília, Brazil, 2011, 210 pp. – Print ISBN 978-85-65069-07-6 - Online ISBN 978-85-65069-05-2 © Copyright 2011 by Associação Brasileira De Especialistas Em Alta Tecnologia (ABEAT) Address: CLN 309, Bloco D, Sala 103 CEP: 70.755-540 – Brasília/DF - Brazil Phone: +55 (61) 3202-3006 Email: [email protected] – www.abeat.org.br Print ISBN 978-85-65069-07-6 - Online ISBN 978-85-65069-05-2 COMMITTEE GENERAL CHAIR Dr. PAULO QUINTILIANO DA SILVA, Brazilian Federal Police, and University of Brasília, Brazil SESSION CHAIRS Dr. ALEXANDRE RICARDO SOARES ROMARIZ, University of Brasilia, Brazil Dr. ANTÔNIO NUNO DE CASTRO SANTA ROSA, University of Brasilia, Brazil Dr. FRANCISCO DE OLIVEIRA ASSIS NASCIMENTO, University of Brasilia, Brazil Dr. PEDRO DE AZEVEDO BERGER, University of Brasilia, Brazil REVIEWERS Dr. Adriano Mauro Cansian, São Paulo State University, Brazil Dr. Alexandre Ricardo Soares Romariz, University of Brasilia, Brazil Dr. Anderson Clayton Alves Nascimento, University of Brasilia, Brazil Dr. Antonio Montes, Renato Archer Research Center, Brazil Dr. Antonio Nuno de Castro Santa Rosa, University of Brasilia, Brazil Dr. Ayyaswamy Kathirvel, Anna University, India Dr. Avinash Pokhriyal, Uttar Pradesh Technical University, Lucknow, India Dr.
    [Show full text]