DOCSLIB.ORG

Enhancing Anonymity of Anonymous P2P Content Sharing Systems Guanyu Tian

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Enhancing Anonymity of Anonymous P2P Content Sharing Systems Guanyu Tian Florida State University Libraries Electronic Theses, Treatises and Dissertations The Graduate School 2014 Enhancing Anonymity of Anonymous P2P Content Sharing Systems Guanyu Tian Follow this and additional works at the FSU Digital Library. For more information, please contact [email protected] FLORIDA STATE UNIVERSITY COLLEGE OF ARTS AND SCIENCES ENHANCING ANONYMITY OF ANONYMOUS P2P CONTENT SHARING SYSTEMS By GUANYU TIAN A Dissertation submitted to the Department of Computer Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy Degree Awarded: Spring Semester, 2014 Copyright c 2014 Guanyu Tian. All Rights Reserved. Guanyu Tian defended this dissertation on April 15, 2014. The members of the supervisory committee were: Zhenhai Duan Professor Directing Thesis Ming Ye University Representative Gary Tyson Committee Member Zhenghao Zhang Committee Member Zhi Wang Committee Member The Graduate School has verified and approved the above-named committee members, and certifies that the dissertation has been approved in accordance with university requirements. ii I dedicate this dissertation to my family. Without your support and encouragement, none of this work would have been possible. iii ACKNOWLEDGMENTS I would like to acknowledge several people who have helped and guided me throughout my doctoral program. First of all, I would like to thank Dr. Zhenhai Duan for being my academic advisor and mentor. I am grateful that Dr. Duan has always been there for guiding me through this intensive training process. His constant support and encouragement play an important role in my academic growth. Besides, I would also like to thank my dissertation committee members, Dr. Gary Tyson, Dr. Zhenghao Zhang, Dr. Zhi Wang, and Dr. Ming Ye, for their reviews and comments. Special thanks to Daniel Clawson for helping me meet the deadlines of manuscipt submission and dissertation defense. Last but not least, I would thank all my professors who helped and prepared me with excellent training in the department of Computer Science at Florida State University. iv TABLE OF CONTENTS ListofTables.......................................... vii ListofFigures ......................................... viii Abstract............................................. ... ix 1 Introduction 1 1.1 Background and Motivation . 1 1.2 Contribution ....................................... 3 1.3 StructureoftheDissertation . 5 2 An Overview of Anonymous Networks 6 2.1 Anonymous Communication System Tor.............................................. 7 2.2 Anonymous Content Sharing System Freenet,GNUnet,andOneSwarm. 9 2.2.1 Freenet ....................................... 9 2.2.2 GNUnet . 13 2.2.3 OneSwarm ..................................... 15 3 Traceback Attack on Freenet 18 3.1 Introduction...................................... 18 3.2 Traceback Attack on Freenet . 20 3.2.1 ConnectingtoaFreenetNode. 20 3.2.2 Querying a Neighbor . 22 3.2.3 Identifying All Nodes Seeing A Content Request Message . 24 3.2.4 Difficulties in Identifying Originating Machine . 25 3.2.5 Identifying Originating Machine . 28 3.3 Performance Evaluation . 32 3.3.1 ExperimentalStudies .............................. 32 3.3.2 SimulationStudies ................................. 38 3.4 Discussion........................................ 42 3.5 RelatedWork........................................ 44 4 DynID: Thwarting the Traceback Attack on Freenet 45 4.1 Introduction...................................... 45 4.2 Background . 47 4.3 DynID to Thwart Traceback Attack . 49 4.4 Performance Evaluation . 57 4.4.1 Simulation Set-up . 57 4.4.2 Results ....................................... 58 v 5 ROL: Reroute-On-Loop in Anonymous P2P Content Sharing Networks 61 5.1 Introduction...................................... 61 5.2 Background . 63 5.2.1 Freenet ....................................... 64 5.2.2 GNUnet . 65 5.2.3 OneSwarm ..................................... 67 5.3 Reroute On Loop . 67 5.4 Performance Evaluation . 74 5.4.1 Simulation Setup . 74 5.4.2 SimulationResults ................................. 77 5.5 RelatedWork........................................ 86 5.6 Conclusion ......................................... 87 6 Related Work 88 7 Summary 91 Bibliography .......................................... 93 BiographicalSketch ..................................... 97 vi LIST OF TABLES 3.1 Resultsofexperimentalstudies. 34 3.2 Classification of messages successfully traced back. 34 3.3 Properties of message paths. 35 3.4 Resultsofsimulationstudies. 40 3.5 Classification of messages successfully traced back (simulation). 40 3.6 Properties of message paths (simulation). 41 4.1 Thenumberofsuccessfulcontentlookuprequests . 58 4.2 Properties of message forwarding paths. 59 5.1 Properties of the networks used in simulations. 77 5.2 Average routing path lengths of Freenet and ROL. 78 5.3 Number of messages in loops. 83 5.4 Average routing path lengths on hybrid networks with parameters of S2. 83 5.5 Average routing path lengths on hybrid networks with parameters of S3. 84 5.6 Average routing path lengths on hybrid networks with parameters of S11. 84 vii LIST OF FIGURES 2.1 HowTorworks........................................ 7 2.2 Circuit creation on Tor . 8 2.3 Freenetroutingscheme .............................. 11 2.4 Indirectingandforwarding ............................ 16 3.1 Illustration of the traceback attack. 23 3.2 Case 1: nj forwarding request to nk−1............................ 24 3.3 Case 2: nk−1 forwarding request to nj, but backtracked from nj. 24 3.4 Case 3: No message forwarding between nj and nk−1................... 24 3.5 Length distribution of linear paths. 37 3.6 Length distribution of linear reverse paths. 38 3.7 Length distribution of linear paths (simulation). 42 3.8 Length distribution of linear reverse paths (simulation). 43 4.1 Basic structure of the traceback attack . 47 4.2 A forwarding path with loop. 51 4.3 Can node j forward a message to node k if node h is more preferred? . 55 5.1 Forwarding of a content request message. 70 5.2 Implication of HTL operation. 71 5.3 Average routing path length (small-world networks). 79 5.4 Average routing path length (random networks) . 80 5.5 Distribution of routing path lengths (small-world networks). 81 5.6 Distribution of routing path lengths (random networks) . 82 5.7 Comparison of forwarding path lengths between Freenet and ROL (small-world net- works)............................................. 85 5.8 Comparison of returning path lengths between Freenet and ROL’s shortcut (small- worldnetworks) ....................................... 86 viii ABSTRACT Anonymous networks play a critical role in supporting free speech and user privacy on the Internet. Over the years, many fundamental algorithms and schemes have been proposed to facilitate the development of anonymous networks, including mix networks, onion routing, per-hop (source) address re-writing and message forwarding, and various cryptographic algorithms. In addition, many practical anonymous networks have been developed and some are deployed on the Internet. On the other hand, despite the adoption of these well-established high-level security schemes and algorithms in such networks, the fine-grained design and development decisions of such networks have not been thoroughly examined. As a consequence, vulnerabilities in existing anonymous networks have been continuously identified and existing anonymous networks have been constantly attacked. In this dissertation we take a pragmatic approach to investigate how fine-grained design and development decisions may affect the anonymity strength of anonymous networks, and more im- portantly, how we can develop proper fine-grained decisions to improve the anonymity strength of anonymous networks. Throughout the course, we focus on Freenet, a popular peer-to-peer anonymous content sharing network. In the first part of the work, we thoroughly investigate the fine-grained decisions made in the Freenet project, including methods to prevent routing loop of content request messages, the handling of various messages in Freenet, and mechanisms for a Freenet node to populate and update its routing table. An effective traceback attack has been developed that can identify the originating machine of a content request message. That is, the anonymity of a content retriever can be broken in Freenet, even if only a single request message has been issued from the corresponding machine. The traceback attack exploited a few fine-grained design and development decisions made in Freenet, including the unique identifier (UID) based mechanism to prevent routing loops of content request messages. In the second part of our work, we investigate mechanisms to improve the anonymity of Freenet. In particular, we have developed a simple and effective scheme named dynID to thwart the traceback attack on Freenet. In dynID, the UID associated with a content request message is dynamically changed at the beginning portion of the message forwarding path. As a consequence, an attacker can only trace back a content request message to the node where the UID value is last changed; it ix cannot uniquely determine the originating machine of the message. Importantly, dynID only has negligible impacts on the performance of Freenet in locating content on the network. For example, our simulation studies based on the original Freenet source code show that, for all content requests, we can successfully locate the corresponding requested content. DynID prevents an attacker deterministically
Load more

Recommended publications
  • Anonsocialmix: Anonymous P2P File Sharing Over Social Networks
    AnonSocialMix: Anonymous P2P File Sharing Over Social Networks Student Name: Rajdeep Mukherjee IIIT-D-MTech-CS-GEN-MT15051 July, 2017 Indraprastha Institute of Information Technology New Delhi Thesis Committee Dr. Sambuddho Chakravarty, IIIT Delhi (Advisor) Dr. Tanmoy Chakraborty, IIIT Delhi (Internal Examiner) Dr. Vinay Joseph Ribeiro, IIT Delhi (External Examiner) Submitted in partial fulfillment of the requirements for the Degree of M.Tech. in Computer Science, in Information Security Category ©2017 IIIT-D MTech-CS-GEN-17-MT15051 All rights reserved Certificate This is to certify that the thesis titled “AnonSocialMix: Anonymous P2P File Sharing Over Social Networks" submitted by Rajdeep Mukherjee 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 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.Sambuddho Chakravarty Indraprastha Institute of Information Technology, New Delhi 2 Abstract Peer-to-peer (P2P) file sharing accounts for one of the major sources of the Internet traffic. As privacy and anonymity issues continue to grow due to constant censorship and network surveil- lance, more and more Internet users are getting attracted towards the facilities for anonymous communication. Extensive research has been conducted over the years towards the design and development of several anonymous P2P file sharing protocols and systems. Size of the Anonymity Set plays a crucial role in determining the degree of anonymity being provided by such networks.
    [Show full text]
  • Will Sci-Hub Kill the Open Access Citation Advantage and (At Least for Now) Save Toll Access Journals?
    Will Sci-Hub Kill the Open Access Citation Advantage and (at least for now) Save Toll Access Journals? David W. Lewis October 2016 © 2016 David W. Lewis. This work is licensed under a Creative Commons Attribution 4.0 International license. Introduction It is a generally accepted fact that open access journal articles enjoy a citation advantage.1 This citation advantage results from the fact that open access journal articles are available to everyone in the word with an Internet collection. Thus, anyone with an interest in the work can find it and use it easily with no out-of-pocket cost. This use leads to citations. Articles in toll access journals on the other hand, are locked behind paywalls and are only available to those associated with institutions who can afford the subscription costs, or who are willing and able to purchase individual articles for $30 or more. There has always been some slippage in the toll access journal system because of informal sharing of articles. Authors will usually send copies of their work to those who ask and sometime post them on their websites even when this is not allowable under publisher’s agreements. Stevan Harnad and his colleagues proposed making this type of author sharing a standard semi-automated feature for closed articles in institutional repositories.2 The hashtag #ICanHazPDF can be used to broadcast a request for an article that an individual does not have access to.3 Increasingly, toll access articles are required by funder mandates to be made publically available, though usually after an embargo period.
    [Show full text]
  • Piracy of Scientific Papers in Latin America: an Analysis of Sci-Hub Usage Data
    Developing Latin America Piracy of scientific papers in Latin America: An analysis of Sci-Hub usage data Juan D. Machin-Mastromatteo Alejandro Uribe-Tirado Maria E. Romero-Ortiz This article was originally published as: Machin-Mastromatteo, J.D., Uribe-Tirado, A., and Romero-Ortiz, M. E. (2016). Piracy of scientific papers in Latin America: An analysis of Sci-Hub usage data. Information Development, 32(5), 1806–1814. http://dx.doi.org/10.1177/0266666916671080 Abstract Sci-Hub hosts pirated copies of 51 million scientific papers from commercial publishers. This article presents the site’s characteristics, it criticizes that it might be perceived as a de-facto component of the Open Access movement, it replicates an analysis published in Science using its available usage data, but limiting it to Latin America, and presents implications caused by this site for information professionals, universities and libraries. Keywords: Sci-Hub, piracy, open access, scientific articles, academic databases, serials crisis Scientific articles are vital for students, professors and researchers in universities, research centers and other knowledge institutions worldwide. When academic publishing started, academies, institutions and professional associations gathered articles, assessed their quality, collected them in journals, printed and distributed its copies; with the added difficulty of not having digital technologies. Producing journals became unsustainable for some professional societies, so commercial scientific publishers started appearing and assumed printing, sales and distribution on their behalf, while academics retained the intellectual tasks. Elsevier, among the first publishers, emerged to cover operations costs and profit from sales, now it is part of an industry that grew from the process of scientific communication; a 10 billion US dollar business (Murphy, 2016).
    [Show full text]
  • Practical Anonymous Networking?
    gap – practical anonymous networking? Krista Bennett Christian Grothoff S3 lab and CERIAS, Department of Computer Sciences, Purdue University [email protected], [email protected] http://www.gnu.org/software/GNUnet/ Abstract. This paper describes how anonymity is achieved in gnunet, a framework for anonymous distributed and secure networking. The main focus of this work is gap, a simple protocol for anonymous transfer of data which can achieve better anonymity guarantees than many traditional indirection schemes and is additionally more efficient. gap is based on a new perspective on how to achieve anonymity. Based on this new perspective it is possible to relax the requirements stated in traditional indirection schemes, allowing individual nodes to balance anonymity with efficiency according to their specific needs. 1 Introduction In this paper, we present the anonymity aspect of gnunet, a framework for secure peer-to-peer networking. The gnunet framework provides peer discovery, link encryption and message-batching. At present, gnunet’s primary application is anonymous file-sharing. The anonymous file-sharing application uses a content encoding scheme that breaks files into 1k blocks as described in [1]. The 1k blocks are transmitted using gnunet’s anonymity protocol, gap. This paper describes gap and how it attempts to achieve privacy and scalability in an environment with malicious peers and actively participating adversaries. The gnunet core API offers node discovery, authentication and encryption services. All communication between nodes in the network is confidential; no host outside the network can observe the actual contents of the data that flows through the network. Even the type of the data cannot be observed, as all packets are padded to have identical size.
    [Show full text]
  • Social Network Based Anonymous Communication in Tor Peng Zhou, Xiapu Luo, Ang Chen, and Rocky K
    1 STor: Social Network based Anonymous Communication in Tor Peng Zhou, Xiapu Luo, Ang Chen, and Rocky K. C. Chang Department of Computing, The Hong Kong Polytechnic University, Hunghom, Hong Kong cspzhouroc,csxluo,csachen,csrchang @comp.polyu.edu.hk f g Abstract—Anonymity networks hide user identities with the help of relayed anonymity routers. However, the state-of-the-art anonymity networks do not provide an effective trust model. As a result, users cannot circumvent malicious or vulnerable routers, thus making them susceptible to malicious router based attacks (e.g., correlation attacks). In this paper, we propose a novel social network based trust model to help anonymity networks circumvent malicious routers and obtain secure anonymity. In particular, we design an input independent fuzzy model to determine trust relationships between friends based on qualitative and quantitative social attributes, both of which can be readily obtained from existing social networks. Moreover, we design an algorithm for propagating trust over an anonymity network. We integrate these two elements in STor, a novel social network based Tor. We have implemented STor by modifying the Tor’s source code and conducted experiments on PlanetLab to evaluate the effectiveness of STor. Both simulation and PlanetLab experiment results have demonstrated that STor can achieve secure anonymity by establishing trust-based circuits in a distributed way. Although the design of STor is based on Tor network, the social network based trust model can be adopted by other anonymity networks. Index Terms—Social Network, Anonymous Communication, Tor, Fuzzy Model F 1 INTRODUCTION alone can be easily bypassed by an attacker.
    [Show full text]
  • Resource-Sharing Computer Communications Networks
    PROCEEDISGS OF THE IEEE, VOL. 60, NO. 11, NOVEMBER 1972 1397 ington. D. C.: Spartan, 1970, pp. 569-579. [47] L. G. Roberts and B. Wessler, “The ARP.4 computer network de- [34] D. Klejtman,“Methods of investigatingconnectivity of large velopmentto achieve resource sharing, in Spring Joint Compztfer graphs, IEEE Trans.Circuit Theory (Corresp.),vol. CT-16, pp. Conf., AFIPS Conf. Proc., 1970, pp. 543-519. 232-233, May 1969. [48] --, “The ARPA computer network,” in Computer Communication [35] P. Krolak, IV. Felts,and G. Marble,“A man-machine approach Networks, F. Kuo and X. .‘\bramson, Eds.Iiew York: Prentice- towardsolving the traveling salesman problem,’! Commun.Ass. Hall, 1973, to be published. Comput. Mach., vol. 14, pp. 327-335, May 1971. [49] B. Rothfarb and M. Goldstein, ‘The one terminal Telpak problem,” [36] S. Lin,“Computer solutions of thetraveling salesman problem,” Oper. Res., vol. 19, pp. 156-169, Jan.-Feb. 1971. Bell Sysf. Tech. J., vol. 44, pp. 2245-2269, 1965. [SO] R. L. Sharma and M.T. El Bardai, “Suboptimal communications [37] T. Marilland L. G. Roberts, “Toward a cooperative netwotk of network synthesis,” in Proc. Int. Conf. Communications, vol. 7, pp. time-shared computers,” in Fall Joint Computer Conf.?AFIPS Conf. 19-11-19-16, 1970. Proc. Washington, D.C.: Spartan, 1966. ..[Sl] K. Steiglitz, P. Weiner, and D.J. Kleitman, “The design of minimum [38] B. Meister,H. R. Muller, and H. R.Rudin, “Sew optimization cost survivable networks,’! IEEE Trans. Circuit Theory, vol. CT-16, criteriafor message-switching networks,’ IEEE Trans.Commun. pp. 455-260, Nov.
    [Show full text]
  • Technology Stack for Decentralized Mobile Services
    Technology Stack for Decentralized Mobile Services Matouš Skála Technology Stack for Decentralized Mobile Services by Matouš Skála to obtain the degree of Master of Science at the Delft University of Technology, to be defended publicly on Monday August 31, 2020 at 3:00 PM. Student number: 4893964 Project duration: November 15, 2019 – August 31, 2020 Thesis committee: Dr.ir. J.A. Pouwelse, TU Delft, supervisor Dr. J.S. Rellermeyer, TU Delft Dr. N. Yorke-Smith, TU Delft An electronic version of this thesis is available at http://repository.tudelft.nl/. Preface When I was choosing my thesis topic, I originally came up with an idea of designing a decen- tralized social network. After realizing how ambitious that goal was, I later decided to focus on more fundamental issues first and create a library that would allow for building any de- centralized applications, running purely on an overlay network consisting of smartphones. Rather than reinventing the wheel, I took inspiration from an existing networking library de- veloped at TU Delft over the last decade and created its wire-compatible implementation in Kotlin. Interestingly, in the end, I have even implemented a trivial social network to demon- strate the usage of the library, returning back to the original idea. I would like to thank my supervisor Johan Pouwelse for an endless stream of fresh ideas and valuable feedback, and to PhD students of the Delft Blockchain Lab for numerous coffee meetings and for serving me as a walking documentation of the existing codebase. Matouš Skála Prague,
    [Show full text]
  • Censorship-Resistant Collaboration with a Hybrid DTN/P2P Network
    Censorship-resistant Collaboration with a Hybrid DTN/P2P Network Masterarbeit von Philipp Hagemeister aus Braunschweig vorgelegt am Lehrstuhl fur¨ Rechnernetze und Kommunikationssysteme Prof. Dr. Martin Mauve Heinrich-Heine-Universitat¨ Dusseldorf¨ Marz¨ 2012 Acknowledgments My thanks go to Marc Fontaine for asking stupid questions that turned out to be quite clever, and for pointing out that correctness is essential both in the real and the physical world. I also thank Paul Baade for demanding impossible features which turned out to be the last piece in the puzzle. Julius Rommler¨ has notified me of orthographical, typographical, and (inadvertently) semantical er- rors. And told me to use fewer big words. Thanks! I wish to thank Denis Lutke-Wiesmann¨ for proofreading the thesis, and the footnotes. Sven Hager found lots of overly short, overly long, and overly wrong statements. Thanks! Thanks to Prof. Martin Mauve for coming up with the idea, shielding us from bureaucracy, asking for explanation and rationale at every step, and finding all the errors nobody else found. iii Contents List of Figures viii 1 Motivation 1 1.1 Distribution of Speech . .2 1.2 Threat Model . .2 1.2.1 Nontechnical Attacks . .2 1.2.2 Internet Access . .3 1.2.3 Control over the User’s Computer . .4 1.2.4 Total Shutoff . .4 1.2.5 Physical Attacks . .5 1.2.6 IP Blocking . .5 1.2.7 DNS censorship . .6 1.2.8 Deep Packet Inspection . .6 1.2.9 Active Attacks . .8 1.2.10 Conclusions . .9 1.3 Decentralization . 10 1.4 Collaboration . 10 1.5 Structure of this Thesis .
    [Show full text]
  • Measuring Freenet in the Wild: Censorship-Resilience Under Observation
    Measuring Freenet in the Wild: Censorship-resilience under Observation Stefanie Roosy, Benjamin Schillerz, Stefan Hackerz, Thorsten Strufey yTechnische Universität Dresden, <firstname.lastname>@tu-dresden.de zTechnische Universität Darmstadt, <lastname>@cs.tu-darmstadt.de Abstract. Freenet, a fully decentralized publication system designed for censorship-resistant communication, exhibits long delays and low success rates for finding and retrieving content. In order to improve its perfor- mance, an in-depth understanding of the deployed system is required. Therefore, we performed an extensive measurement study accompanied by a code analysis to identify bottlenecks of the existing algorithms and obtained a realistic user model for the improvement and evaluation of new algorithms. Our results show that 1) the current topology control mechanisms are suboptimal for routing and 2) Freenet is used by several tens of thousands of users who exhibit uncharacteristically long online times in comparison to other P2P systems. 1 Introduction Systems that allow users to communicate anonymously, and to publish data without fear of retribution, have become ever more popular in the light of re- cent events1. Freenet [1–3] is a widely deployed completely decentralized system focusing on anonymity and censorship-resilience. In its basic version, the Open- net mode, it provides sender and receiver anonymity but establishes connections between the devices of untrusted users. In the Darknet mode, nodes only con- nect to nodes of trusted parties. Freenet aims to achieve fast message delivery over short routes by arranging nodes in routable small-world network. However, Freenet’s performance has been found to be insufficient, exhibiting long delays and frequent routing failures [4].
    [Show full text]
  • Sharing Music Files: Tactics of a Challenge to the Industry Brian Martin University of Wollongong, [email protected]
    University of Wollongong Research Online Faculty of Arts - Papers (Archive) Faculty of Law, Humanities and the Arts 2010 Sharing music files: tactics of a challenge to the industry Brian Martin University of Wollongong, [email protected] Christopher L. Moore Deakin University, [email protected] Colin Salter McMaster University, [email protected] Publication Details Martin, B., Moore, C. L. & Salter, C. 2010, 'Sharing music files: tactics of a challenge to the industry', First Monday, vol. 15, no. 12. Research Online is the open access institutional repository for the University of Wollongong. For further information contact the UOW Library: [email protected] First Monday, Volume 15, Number 12 - 6 December 2010 HOME ABOUT LOG IN REGISTER SEARCH CURRENT ARCHIVES SUBMISSIONS Home > Volume 15, Number 12 - 6 December 2010 > Martin The sharing of music files has been the focus of a massive struggle between representatives of major record companies and artists in the music industry, on one side, and peer–to–peer (p2p) file–sharing services and their users, on the other. This struggle can be analysed in terms of tactics used by the two sides, which can be classified into five categories: cover–up versus exposure, devaluation versus validation, interpretation versus alternative interpretation, official channels versus mobilisation, and intimidation versus resistance. It is valuable to understand these tactics because similar ones are likely to be used in ongoing struggles between users of p2p services and representatives of the content industries. Contents Introduction The backfire model Cover–up versus exposure Devaluation versus validation Interpretation struggles Official channels versus mobilisation Intimidation versus resistance Levels of strategy Conclusion Introduction Until the 1990s, the music industry played a leading role in the distribution of recorded music.
    [Show full text]
  • Unveiling the I2P Web Structure: a Connectivity Analysis
    Unveiling the I2P web structure: a connectivity analysis Roberto Magan-Carri´ on,´ Alberto Abellan-Galera,´ Gabriel Macia-Fern´ andez´ and Pedro Garc´ıa-Teodoro Network Engineering & Security Group Dpt. of Signal Theory, Telematics and Communications - CITIC University of Granada - Spain Email: [email protected], [email protected], [email protected], [email protected] Abstract—Web is a primary and essential service to share the literature have analyzed the content and services offered information among users and organizations at present all over through this kind of technologies [6], [7], [2], as well as the world. Despite the current significance of such a kind of other relevant aspects like site popularity [8], topology and traffic on the Internet, the so-called Surface Web traffic has been estimated in just about 5% of the total. The rest of the dimensions [9], or classifying network traffic and darknet volume of this type of traffic corresponds to the portion of applications [10], [11], [12], [13], [14]. Web known as Deep Web. These contents are not accessible Two of the most popular darknets at present are The Onion by search engines because they are authentication protected Router (TOR; https://www.torproject.org/) and The Invisible contents or pages that are only reachable through the well Internet Project (I2P;https://geti2p.net/en/). This paper is fo- known as darknets. To browse through darknets websites special authorization or specific software and configurations are needed. cused on exploring and investigating the contents and structure Despite TOR is the most used darknet nowadays, there are of the websites in I2P, the so-called eepsites.
    [Show full text]
  • An Introductory Historical Contextualization of Online Creation Communities for the Building of Digital Commons: the Emergence of a Free Culture Movement
    An Introductory Historical Contextualization of Online Creation Communities for the Building of Digital Commons: The Emergence of a Free Culture Movement Mayo Fuster Morell Autonomous University of Barcelona [email protected] Abstract. Online Creation Communities (OCCs) are a set of individ- uals that communicate, interact and collaborate; in several forms and degrees of participation which are eco-systemically integrated; mainly via a platform of participation on the Internet, on which they depend; and aiming at knowledge-making and sharing. The paper will first pro- vide an historical contextualization OCCs. Then, it will show how the development of OCCs is fuelled by and contributes to, the rise of a free culture movement defending and advocating the creation of digital com- mons, and provide an empirically grounded definition of free culture movement. The empirical analyses is based content analysis of 80 in- terviews to free culture practitioners, promoters and activists with an international background or rooted in Europe, USA and Latino-America and the content analysis of two seminar discussions. The data collection was developed from 2008 to 2010. 1 Introduction Online Creation Communities (OCCs) are a set of individuals that communicate, interact and collaborate; in several forms and degrees of participation which are eco-systemically integrated; mainly via a platform of participation on the In- ternet, on which they depend; and aiming at knowledge-making and sharing (Fuster Morell, 2010). OCCs based on certain governance conditions result on the building of a digital commons. Digital commons are defined as an informa- tion and knowledge resources that are collectively created and owned or shared between or among a community and that tend to be non-exclusivedible, that is, be (generally freely) available to third parties.
    [Show full text]