The Free Haven Project: Design and Deployment of an Anonymous Secure Data Haven

Total Page:16

File Type:pdf, Size:1020Kb

The Free Haven Project: Design and Deployment of an Anonymous Secure Data Haven The Free Haven Project: Design and Deployment of an Anonymous Secure Data Haven by Roger R. Dingledine Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degrees of Bachelor of Science in Computer Science and Engineering and Master of Engineering in Electrical Engineering and Computer Science at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY June 2000 © Roger R. Dingledine, MM. All rights reserved. The author hereby grants to MIT permission to reproduce and distribute publicly paper and electronic copies of this thesis document in whole or in part. Author ................................... Department of Electrical Engineering andUCompuer Science May 22, 2000 7) A Certified by ................................... Ron Rivest Webster Professor of Computer Science and Engineering Thesis Supervisor Z7 Accepted by ............................. .............. g. .-. .... Arthur C. Smith Chairman, Department Committee on Graduate Students MASSACHUSETTS INSTITUTE OF TECHNOLOGY JUL 2 7 2000 LIBRARIES -1 The Free Haven Project: Design and Deployment of an Anonymous Secure Data Haven by Roger R. Dingledine Submitted to the Department of Electrical Engineering and Computer Science on May 22, 2000, in partial fulfillment of the requirements for the degrees of Bachelor of Science in Computer Science and Engineering and Master of Engineering in Electrical Engineering and Computer Science Abstract The Free Haven Project aims to deploy a system for distributed data storage which is robust against attempts by powerful adversaries to find and destroy stored data. Free Haven uses a mixnet for com- munication, and it emphasizes distributed, reliable, and anonymous storage over efficient retrieval. We provide an outline of a formal definition of anonymity, to help characterize the protection that Free Haven provides and to help compare related services. We also provide some background from case law about anonymous speech and anonymous publication, and examine some of the ethical and moral implications of an anonymous publishing service. In addition, we describe a variety of attacks on the system and ways of protecting against these attacks. Some of the problems Free Haven addresses include providing sufficient accountability without sacrificing anonymity, building trust between servers based entirely on their observed behavior, and providing user interfaces that will make the system easy for end-users. Thesis Supervisor: Ron Rivest Title: Webster Professor of Computer Science and Engineering Contents 1 Introduction and Requirements 6 1.1 M otivation ............ ............... .. 6 1.2 Project Summary .......... ...................................... 7 1.3 Design Requirements .............................. 8 1.4 About this document . ............... ............... ..... 10 2 Defining Anonymity 11 2.1 Defining Privacy ...................................... 11 2.2 Agents and Operations ................................... 12 2.3 Linkability: Anonymity vs. Pseudonymity ........................ 14 2.4 Partial Anonymity vs. Full Anonymity .................... ...... 15 2.5 Characteristics of Communication Channels ....................... 16 2.6 What does it mean to 'break' an anonymous system? ............ ...... 17 2.7 Modeling the Adversary ............................ ...... 18 2.8 Toward a formal definition of anonymity ............. ............ 19 3 Related and Alternate Works 20 3.1 Anonymous Channels ....................... ............ 20 3.2 Publication Services ........................ ............ 25 3.3 Trust System s ........................................ 36 4 Applications, Legalities, and Ethics 38 4.1 Introduction and Assumptions ........ .......... .......... .. 38 4.2 Anonymous speech ....... .......... .......... .......... 39 4.3 Anonymous Publication .............. ............... ..... 43 4.4 Legal, yes - but Moral? .................................. 46 4.5 Conclusions ......... ............... ............... .. 55 4 5 System Design and Overview 57 5.1 System Summary .......... ...................................... 57 5.2 Supported Operations ................................... 60 5.3 Expiration .. ..... ..... ...... ..... .... ..... ..... ..... 63 5.4 Accountability and Redundancy .. ..... ..... .... ..... ..... ... 65 5.5 Composition of a Share ... ...... ..... ..... .... ..... ..... 68 5.6 Trading .. ..... ..... ...... ..... ..... .... ..... ..... 69 5.7 R eceipts . .... ..... .... .... .... ..... .... .... .... .... 72 5.8 Trust Networks ... ..... ...... ..... .... ..... ..... ..... 72 5.9 Directory Services . ..... ...... ..... ..... .... ..... ..... 78 5.10 U ser Interfaces .. ...... ...... ...... ...... ...... ...... 79 6 Communication Module and Protocols 82 6.1 M odule D esign .... ..... ..... ..... ..... ..... ..... ..... 82 6.2 Module Implementation .... ...... ..... .... ..... ..... ..... 84 7 Adversaries and Attacks 89 7.1 Attacks on the Communications Channel . ...... ...... ...... ..... 89 7.2 Attacks on the Infrastructure and Documents ...... ...... ...... .... 97 7.3 Attacks on the Trust System . ..... ..... ..... ...... ..... 101 8 Future Works 103 8.1 Communications Channels .. ...... ..... ..... .... ..... ..... 103 8.2 Publication Systems ..... ...... ..... ..... .... ..... ..... 108 8.3 Trust........... .... ........................................ 109 9 Conclusions 111 A Acknowledgements 113 B Anonymous Communications Channels 114 B .1 Proxy Services .. ..... ...... ..... ..... .... ..... ..... .. 114 B.2 Chaumian Mix-nets . ...... ...... ...... ...... ...... ..... 116 B.3 Remailers: SMTP Mix-nets ... ...... ...... ...... ...... ..... 117 B.4 Recent Mix-Net Designs .... ...... ...... ...... ...... ...... 120 B.5 Other Anonymous Channels ... ...... ..... .... ..... ..... .... 124 Bibliography 127 5 Chapter 1 Introduction and Requirements 1.1 Motivation The internet is moving in the direction of increasing freedom of information. National boundary lines are growing increasingly blurred. At the same time as a strong sense of global community is growing, technical advances have provided greatly increased bandwidth and an enormous amount of computing power and well-connected storage. However, the increases in speed and efficiency have not brought comparable increases in privacy and anonymity on the internet - indeed, governments and especially corporations are beginning to realize that they can leverage the internet to provide detailed information about the interests and behaviors of existing or potential customers. Court cases, such as the Church of Scientology's lawsuit against Johan Helsingius [42] or the more recent OpenDVD debate [55] (and subsequent arrest of DeCSS author Jon Lech Johansen), demonstrate that the internet currently lacks an adequate infrastructure for truly anonymous publication or distribution of documents or other data. Indeed, there are a number of other deeper motivations for the deployment of an anonymous publishing service such as Free Haven. Not only do we hope to assist those like Helsingius and Johansen, but we have the wider goals of pushing the world a few more steps in the direction of free and open information and communication. In Germany, Internet Service Providers such as AOL are liable for the content that passes across their systems [82]. Recent British legislation threatens to make citizens responsible for the content of encrypted documents that they're holding, even if they don't possess the ability to read these documents [74]. Such restrictions on the free flow of information, however, are already being attacked: for example, American hackers are attempting to break holes in China's "Great Firewall" to allow Chinese citizens access to Western media [11]. In addition to such revolutionary actions, there are a wide range of activist projects which employ the internet for publicity but focus on helping real people in the real world. Such projects include 6 The Free Haven Project Roger Dingledine Pirate Radio [29], a loose confederation of radio operators joined in the belief that ordinary citizens can regulate the airwaves more efficiently and more responsibly than a government organization; as well as mutual aid societies such as Food Not Bombs! [45], an organization which "serves free food in public places to dramatise the plight of the homeless, the callousness of the system and our capacity to solve social problems through our own actions without government or capitalism." By providing tools to enable safer and more reliable communication for organizations fighting for increased rights of individuals rather than nations or corporations, as well as strengthening the capabilities of political dissidents and other individuals to speak out anonymously about their situations, the members of the Free Haven Project hope to help pave the way to a modern society where freedom of speech and freedom of information are integral parts of everyday life. 1.2 Project Summary The Free Haven Project intends to deploy a system which provides a good infrastructure for anony- mous publication. Specifically, this means that the publisher of a given document should not be known; that clients requesting the document should not have to identify themselves to anyone; and that the current location of the document should not be known. Additionally, it would be preferable to limit the number of opportunities where an outsider can show that a given document passed through a given computer. A more thorough examination
Recommended publications
  • Tor: the Second-Generation Onion Router (2014 DRAFT V1)
    Tor: The Second-Generation Onion Router (2014 DRAFT v1) Roger Dingledine Nick Mathewson Steven Murdoch The Free Haven Project The Free Haven Project Computer Laboratory [email protected] [email protected] University of Cambridge [email protected] Paul Syverson Naval Research Lab [email protected] Abstract Perfect forward secrecy: In the original Onion Routing We present Tor, a circuit-based low-latency anonymous com- design, a single hostile node could record traffic and later munication service. This Onion Routing system addresses compromise successive nodes in the circuit and force them limitations in the earlier design by adding perfect forward se- to decrypt it. Rather than using a single multiply encrypted crecy, congestion control, directory servers, integrity check- data structure (an onion) to lay each circuit, Tor now uses an ing, configurable exit policies, anticensorship features, guard incremental or telescoping path-building design, where the nodes, application- and user-selectable stream isolation, and a initiator negotiates session keys with each successive hop in practical design for location-hidden services via rendezvous the circuit. Once these keys are deleted, subsequently com- points. Tor is deployed on the real-world Internet, requires promised nodes cannot decrypt old traffic. As a side benefit, no special privileges or kernel modifications, requires little onion replay detection is no longer necessary, and the process synchronization or coordination between nodes, and provides of building circuits is more reliable, since the initiator knows a reasonable tradeoff between anonymity, usability, and ef- when a hop fails and can then try extending to a new node.
    [Show full text]
  • Peer to Peer Resources
    Peer To Peer Resources By Marcus P. Zillman, M.S., A.M.H.A. Executive Director – Virtual Private Library [email protected] This January 2009 column Peer To Peer Resources is a comprehensive list of peer to peer resources, sources and sites available over the Internet and the World Wide Web including peer to peer, file sharing, and grid and matrix search engines. The below list is taken from the peer to peer research section of my Subject Tracer™ Information Blog titled Deep Web Research and is constantly updated with Subject Tracer™ bots at the following URL: http://www.DeepWebResearch.info/ These resources and sources will help you to discover the many pathways available to you through the Internet for obtaining and locating peer to peer sources in todays rapidly changing data procurement society. This is a MUST information keeper for those seeking the latest and greatest peer to peer resources! Peer To Peer Resources: ALPINE Network - SourceForge: Project http://sourceforge.net/projects/alpine/ An Efficient Scheme for Query Processing on Peer-to-Peer Networks http://aeolusres.homestead.com/files/index.html angrycoffee.com http://www.AngryCoffee.com/ Azureus - Vuze Java Bittorrent Client http://azureus.sourceforge.net/ 1 January 2009 Zillman Column – Peer To Peer Resources http://www.zillmancolumns.com/ [email protected] © 2009 Marcus P. Zillman, M.S., A.M.H.A. BadBlue http://badblue.com/ Between Rhizomes and Trees: P2P Information Systems by Bryn Loban http://firstmonday.org/htbin/cgiwrap/bin/ojs/index.php/fm/article/view/1182
    [Show full text]
  • Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus
    Analysing the MUTE Anonymous File-Sharing System Using the Pi-calculus Tom Chothia CWI, Kruislaan 413, 1098 SJ, Amsterdam, The Netherlands. Abstract. This paper gives details of a formal analysis of the MUTE system for anonymous file-sharing. We build pi-calculus models of a node that is innocent of sharing files, a node that is guilty of file-sharing and of the network environment. We then test to see if an attacker can dis- tinguish between a connection to a guilty node and a connection to an innocent node. A weak bi-simulation between every guilty network and an innocent network would be required to show possible innocence. We find that such a bi-simulation cannot exist. The point at which the bi- simulation fails leads directly to a previously undiscovered attack on MUTE. We describe a fix for the MUTE system that involves using au- thentication keys as the nodes’ pseudo identities and give details of its addition to the MUTE system. 1 Introduction MUTE is one of the most popular anonymous peer-to-peer file-sharing systems1. Peers, or nodes, using MUTE will connect to a small number of other, known nodes; only the direct neighbours of a node know its IP address. Communication with remote nodes is provided by sending messages hop-to-hop across this overlay network. Routing messages in this way allows MUTE to trade efficient routing for anonymity. There is no way to find the IP address of a remote node, and direct neighbours can achieve a level of anonymity by claiming that they are just forwarding requests and files for other nodes.
    [Show full text]
  • Air Force Institute of Technology
    to A TAXONOMY FOR AND ANALYSIS OF ANONYMOUS COMMUNICATIONS NETWORKS DISSERTATION Douglas Kelly, GG-14 AFIT/DCS/ENG/09-08 AIR FORCE INSTITUTE OF TECHNOLOGY Wright-Patterson Air Force Base, Ohio APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED The views expressed in this dissertation are those of the author and do not reflect the official policy or position of the United States Air Force, Department of Defense, or the U.S. Government. A TAXONOMY FOR AND ANALYSIS OF ANONYMOUS COMMUNICATIONS NETWORKS DISSERTATION Presented to the Faculty Graduate School of Engineering and Management Air Force Institute of Technology Air University Air Education and Training Command In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy Douglas J. Kelly, BS, MS, MBA March 2009 APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED AFIT/DCS/ENG/09-08 A TAXONOMY FOR AND ANALYSIS OF ANONYMOUS COMMUNICATIONS NETWORKS DISSERTATION Douglas J. Kelly, BS, MS, MBA Approved: __________//SIGNED//________________ _16 Mar 09_ Dr. Richard A. Raines (Chairman) Date __________//SIGNED//________________ _16 Mar 09_ Dr. Barry E. Mullins (Member) Date __________//SIGNED//________________ _16 Mar 09_ Dr. Rusty O. Baldwin (Member) Date __________//SIGNED//________________ _16 Mar 09_ Dr. Michael R. Grimaila (Member) Date Accepted: __________//SIGNED//________________ _18 Mar 09_ Dr. M. U. Thomas Date Dean, Graduate School of Engineering and Management - iii - AFIT/DCS/ENG/09-08 Abstract Any entity operating in cyberspace is susceptible to debilitating attacks. With cyber attacks intended to gather intelligence and disrupt communications rapidly replacing the threat of conventional and nuclear attacks, a new age of warfare is at hand.
    [Show full text]
  • The Onion Crate - Tor Hidden Service Index Protected Onions Add New
    onion.to does not host this content; we are simply a conduit connecting Internet users to content hosted inside the Tor network.. onion.to does not provide any anonymity. You are strongly advised to download the Tor Browser Bundle and access this content over Tor. For more information see our website for more details and send us your feedback. hide Tor2web header Online onions The Onion Crate - Tor Hidden Service Index Protected onions Add new nethack3dzllmbmo.onion A public nethack server. j4ko5c2kacr3pu6x.onion/wordpress Paste or blog anonymously, no registration required. redditor3a2spgd6.onion/r/all Redditor. Sponsored links 5168 online onions. (Ctrl-f is your friend) A AUTOMATED PAYPAL AND CREDIT CARD MARKET 2222bbbeonn2zyyb.onion A Beginner Friendly Comprehensive Guide to Installing and Using A Safer yuxv6qujajqvmypv.onion A Coca Growlog rdkhliwzee2hetev.onion ==> https://freenet7cul5qsz6.onion.to/freenet:USK@yP9U5NBQd~h5X55i4vjB0JFOX P97TAtJTOSgquP11Ag,6cN87XSAkuYzFSq-jyN- 3bmJlMPjje5uAt~gQz7SOsU,AQACAAE/cocagrowlog/3/ A Constitution for the Few: Looking Back to the Beginning ::: Internati 5hmkgujuz24lnq2z.onion ==> https://freenet7cul5qsz6.onion.to/freenet:USK@kpFWyV- 5d9ZmWZPEIatjWHEsrftyq5m0fe5IybK3fg4,6IhxxQwot1yeowkHTNbGZiNz7HpsqVKOjY 1aZQrH8TQ,AQACAAE/acftw/0/ A Declaration of the Independence of Cyberspace ufbvplpvnr3tzakk.onion ==> https://freenet7cul5qsz6.onion.to/freenet:CHK@9NuTb9oavt6KdyrF7~lG1J3CS g8KVez0hggrfmPA0Cw,WJ~w18hKJlkdsgM~Q2LW5wDX8LgKo3U8iqnSnCAzGG0,AAIC-- 8/Declaration-Final%5b1%5d.html A Dumps Market
    [Show full text]
  • Tor: the Second-Generation Onion Router
    Tor: The Second-Generation Onion Router Roger Dingledine Nick Mathewson Paul Syverson The Free Haven Project The Free Haven Project Naval Research Lab [email protected] [email protected] [email protected] Abstract vulnerable to a single hostile node recording traffic and later compromising successive nodes in the circuit and forcing We present Tor, a circuit-based low-latency anonymous them to decrypt it. Rather than using a single multiply en- communication service. This second-generation Onion crypted data structure (an onion) to lay each circuit, Tor Routing system addresses limitations in the original design. now uses an incremental or telescoping path-building de- Tor adds perfect forward secrecy, congestion control, direc- sign, where the initiator negotiates session keys with each tory servers, integrity checking, configurable exit policies, successive hop in the circuit. Once these keys are deleted, and a practical design for rendezvous points. Tor works subsequently compromised nodes cannot decrypt old traf- on the real-world Internet, requires no special privileges or fic. As a side benefit, onion replay detection is no longer kernel modifications, requires little synchronization or co- necessary, and the process of building circuits is more reli- ordination between nodes, and provides a reasonable trade- able, since the initiator knows when a hop fails and can then off between anonymity, usability, and efficiency. We briefly try extending to a new node. describe our experiences with an international network of Separation of “protocol cleaning” from anonymity: more than a dozen hosts. We close with a list of open prob- Onion Routing originally required a separate “applica- lems in anonymous communication.
    [Show full text]
  • Onions Links – Darkweb – Part 2
    Onions Links – DarkWeb – Part 2 Communications and Social 1. 2i7aalqdpiuw36nu.onion Sipulikanava – Image board Online 2. 2nq3v6fnrwp72nao.onion sometimes known as the ‘generous bandit’, ‘angel of the poor’, or the ‘narco-saint’. Offline 3. 2pdkdy3eo552mpiz.onion ZeroBin Online 4. 344c6kbnjnljjzlz.onion VFEmail Online 5. 3ur4xm2japn56c5f.onion CgAn Web IRC Online 6. 4ecwfvbvxojjequ4.onion ecwoequ OnionMail Server Online 7. 53n2lkhj2lfz23kr.onion Sipulikanava – Image board Online 8. 5b5yrc7j27i3jc3k.onion Onion Mail Online 9. 5c62aaokkuc4r72c.onion Plotting, Watching, Accomplishing Offline 10. 5dgg7y5viysvvrxf.onion winston OnionMail Server Online 11. 5q736ltgak2qfxtl.onion Sipulikanava – Image board Online 12. 5sn2hxofsu6b55lo.onion Roundcube Webmail Online 13. 6hgchounjuuwxewa.onion mes3hacklab OnionMail Server Online 14. 6mpj33zob2zmfqzn.onion paste.lolz – decentralized pastebin Offline 15. 6xydbbfysubflwhw.onion Socket.IO chat Online 16. 7hst7dcpypl5tjcp.onion xyrasoru OnionMail Server Online 17. 7lvd7fa5yfbdqaii.onion we.riseup.net Online 18. 7w65g63fgumvpuvd.onion hiddenmail OnionMail Server Online 19. a2jutl5hpza43yog.onion CgAn IRC Offline 20. adrenlfztn4zuk7k.onion Adrenaline-Shop Offline 21. anonymoussb4444v.onion kJabber.de :: Tor Online 22. answerstedhctbek.onion Hidden Answers Online 23. archmail5fanreo5.onion onion webmail :: Welcome to onion webmail Online 24. bdlbvzqddbcti37i.onion Sipulikanava – Image board Online 25. bitmailendavkbec.onion Bitmessage Mail Gateway Online 26. blkbook3fxhcsn3u.onion BlackBook Online 27. brhiusfmarqefhke.onion Wave in a Box Offline 28. bskoid4l5redrw5m.onion Smuxi – IRC Client Online 29. chat7zlxojqcf3nv.onion RetroShare Chatserver hosted by Pirate Party Austria Online 30. chattorci7bcgygp.onion This is ChatTor, the only 100% anonymous chat website on tor that uses web sockets. Online 31. confessx3gx46lwg.onion anonymous confessions Online 32. cryjabkbdljzohnp.onion jabber.cryptoparty.is Online 33. cwoiopiifrlzcuos.onion riseup.net Online 34. darknesswn664fcx.onion Darkness XMPP Offline 35.
    [Show full text]
  • Location Diversity in Anonymity Networks
    Location Diversity in Anonymity Networks Nick Feamster Roger Dingledine MIT Computer Science and AI Laboratory The Free Haven Project [email protected] [email protected] ABSTRACT dropper on both ends of the connection can quickly link sender to Anonymity networks have long relied on diversity of node loca- recipient through packet counting or timing attacks [16, 23, 35]. tion for protection against attacks—typically an adversary who can Anonymity designs use three strategies to mitigate these attacks. observe a larger fraction of the network can launch a more effec- tive attack. We investigate the diversity of two deployed anonymity • Batching and pooling: The network collects a group of in- networks, Mixmaster and Tor, with respect to an adversary who put messages and reorders them before they exit, to hinder controls a single Internet administrative domain. the adversary from learning which message in the batch orig- Specifically, we implement a variant of a recently proposed tech- inated from a given sender [12, 34]. nique that passively estimates the set of administrative domains • Padding: Senders provide decoy traffic as well as normal (also known as autonomous systems, or ASes) between two ar- traffic to complicate the adversary’s attempts to correlate sender bitrary end-hosts without having access to either end of the path. and receiver [8, 14, 23]. Using this technique, we analyze the AS-level paths that are likely • Dispersal: Reducing the chance that the adversary sees both to be used in these anonymity networks. We find several cases in endpoints for a given communication may entirely block some each network where multiple nodes are in the same administrative attacks on low-latency networks, and slow intersection at- domain.
    [Show full text]
  • Measuring I2P Censorship at a Global Scale
    Measuring I2P Censorship at a Global Scale Nguyen Phong Hoang Sadie Doreen Michalis Polychronakis Stony Brook University The Invisible Internet Project Stony Brook University Abstract required flexibility for conducting fine-grained measurements on demand. We demonstrate these benefits by conducting an The prevalence of Internet censorship has prompted the in-depth investigation of the extent to which the I2P (invis- creation of several measurement platforms for monitoring ible Internet project) anonymity network is blocked across filtering activities. An important challenge faced by these different countries. platforms revolves around the trade-off between depth of mea- Due to the prevalence of Internet censorship and online surement and breadth of coverage. In this paper, we present surveillance in recent years [7, 34, 62], many pro-privacy and an opportunistic censorship measurement infrastructure built censorship circumvention tools, such as proxy servers, virtual on top of a network of distributed VPN servers run by vol- private networks (VPN), and anonymity networks have been unteers, which we used to measure the extent to which the developed. Among these tools, Tor [23] (based on onion rout- I2P anonymity network is blocked around the world. This ing [39,71]) and I2P [85] (based on garlic routing [24,25,33]) infrastructure provides us with not only numerous and ge- are widely used by privacy-conscious and censored users, as ographically diverse vantage points, but also the ability to they provide a higher level of privacy and anonymity [42]. conduct in-depth measurements across all levels of the net- In response, censors often hinder access to these services work stack.
    [Show full text]
  • A Taxonomy for and Analysis of Anonymous Communications Networks
    Air Force Institute of Technology AFIT Scholar Theses and Dissertations Student Graduate Works 3-18-2009 A Taxonomy for and Analysis of Anonymous Communications Networks Douglas J. Kelly Follow this and additional works at: https://scholar.afit.edu/etd Part of the Digital Communications and Networking Commons, and the Information Security Commons Recommended Citation Kelly, Douglas J., "A Taxonomy for and Analysis of Anonymous Communications Networks" (2009). Theses and Dissertations. 2539. https://scholar.afit.edu/etd/2539 This Dissertation is brought to you for free and open access by the Student Graduate Works at AFIT Scholar. It has been accepted for inclusion in Theses and Dissertations by an authorized administrator of AFIT Scholar. For more information, please contact [email protected]. to A TAXONOMY FOR AND ANALYSIS OF ANONYMOUS COMMUNICATIONS NETWORKS DISSERTATION Douglas Kelly, GG-14 AFIT/DCS/ENG/09-08 AIR FORCE INSTITUTE OF TECHNOLOGY Wright-Patterson Air Force Base, Ohio APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED The views expressed in this dissertation are those of the author and do not reflect the official policy or position of the United States Air Force, Department of Defense, or the U.S. Government. A TAXONOMY FOR AND ANALYSIS OF ANONYMOUS COMMUNICATIONS NETWORKS DISSERTATION Presented to the Faculty Graduate School of Engineering and Management Air Force Institute of Technology Air University Air Education and Training Command In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy Douglas J. Kelly, BS, MS, MBA March 2009 APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED AFIT/DCS/ENG/09-08 A TAXONOMY FOR AND ANALYSIS OF ANONYMOUS COMMUNICATIONS NETWORKS DISSERTATION Douglas J.
    [Show full text]
  • International Journal of Computer Science & Information Security
    IJCSIS Vol. 12 No. 4, April 2014 ISSN 1947-5500 International Journal of Computer Science & Information Security © IJCSIS PUBLICATION 2014 JCSI I S ISSN (online): 1947-5500 Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results. CALL FOR PAPERS International Journal of Computer Science and Information Security (IJCSIS) January-December 2014 Issues The topics suggested by this issue can be discussed in term of concepts, surveys, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas. See authors guide for manuscript preparation and submission guidelines. Indexed by Google Scholar, DBLP, CiteSeerX, Directory for Open Access Journal (DOAJ), Bielefeld Academic Search Engine (BASE), SCIRUS, Scopus Database, Cornell University Library, ScientificCommons, ProQuest, EBSCO and more. Deadline: see web site Notification: see web site Revision: see web site Publication: see web site Context-aware systems Agent-based systems Networking technologies Mobility and multimedia systems Security in network, systems, and applications Systems performance Evolutionary computation Networking and telecommunications Industrial systems Software development and deployment Evolutionary computation Knowledge virtualization Autonomic and autonomous
    [Show full text]
  • Challenges in Deploying Low-Latency Anonymity (DRAFT)
    Challenges in deploying low-latency anonymity (DRAFT) Roger Dingledine1, Nick Mathewson1, and Paul Syverson2 1 The Free Haven Project <{arma,nickm}@freehaven.net> 2 Naval Research Laboratory <[email protected]> Abstract. There are many unexpected or unexpectedly difficult obstacles to deploying anonymous communications. Drawing on our experiences deploying Tor (the second-generation onion routing network), we describe social challenges and technical issues that must be faced in building, deploying, and sustaining a scalable, distributed, low-latency anonymity network. 1 Introduction Anonymous communication is full of surprises. This paper discusses some unexpected challenges arising from our experiences deploying Tor, a low-latency general-purpose anonymous communi- cation system. We will discuss some of the difficulties we have experienced and how we have met them (or how we plan to meet them, if we know). We also discuss some less troublesome open problems that we must nevertheless eventually address. Tor is an overlay network for anonymizing TCP streams over the Internet [13]. It addresses limitations in earlier Onion Routing designs [17, 27, 35, 36] by adding perfect forward secrecy, con- gestion control, directory servers, data integrity, configurable exit policies, and location-hidden services using rendezvous points. Tor works on the real-world Internet, requires no special priv- ileges or kernel modifications, requires little synchronization or coordination between nodes, and provides a reasonable trade-off between anonymity, usability, and efficiency. We deployed the public Tor network in October 2003; since then it has grown to over a hun- dred volunteer-operated nodes and as much as 80 megabits of average traffic per second.
    [Show full text]