Private and Censorship-Resistant Communication Over Public Networks

Total Page:16

File Type:pdf, Size:1020Kb

Private and Censorship-Resistant Communication Over Public Networks Private and Censorship-Resistant Communication over Public Networks Michael John Rogers Thesis submitted for the degree of Doctor of Philosophy of UCL Department of Computer Science University College London University of London 2010 1 I, Michael John Rogers, confirm that the work presented in this thesis is my own. Where information has been derived from other sources, I confirm that this has been indicated in the thesis. 2 Abstract Society’s increasing reliance on digital communication networks is creating unprecedented opportunities for whole- sale surveillance and censorship. This thesis investigates the use of public networks such as the Internet to build robust, private communication systems that can resist monitoring and attacks by powerful adversaries such as national governments. We sketch the design of a censorship-resistant communication system based on peer-to-peer Internet overlays in which the participants only communicate directly with people they know and trust. This ‘friend-to-friend’ approach protects the participants’ privacy, but it also presents two significant challenges. The first is that, as with any peer-to-peer overlay, the users of the system must collectively provide the resources necessary for its operation; some users might prefer to use the system without contributing resources equal to those they consume, and if many users do so, the system may not be able to survive. To address this challenge we present a new game theoretic model of the problem of encouraging cooperation between selfish actors under conditions of scarcity, and develop a strategy for the game that provides rational incentives for cooperation under a wide range of conditions. The second challenge is that the structure of a friend-to-friend overlay may reveal the users’ social relationships to an adversary monitoring the underlying network. To conceal their sensitive relationships from the adversary, the users must be able to communicate indirectly across the overlay in a way that resists monitoring and attacks by other participants. We address this second challenge by developing two new routing protocols that robustly deliver messages across networks with unknown topologies, without revealing the identities of the communication endpoints to intermediate nodes or vice versa. The protocols make use of a novel unforgeable acknowledgement mechanism that proves that a message has been delivered without identifying the source or destination of the message or the path by which it was delivered. One of the routing protocols is shown to be robust to attacks by malicious participants, while the other provides rational incentives for selfish participants to cooperate in forwarding messages. 3 Contents 1 Introduction 7 1.1 Background . 7 1.2 Goals . 9 1.3 Assumptions . 9 1.4 Requirements . 11 1.5 Thesis Statement . 11 1.6 Contributions . 12 1.7 Previously Published Work . 12 2 Related Work 13 2.1 Background . 13 2.2 Peer-to-Peer Networks . 15 2.3 Availability . 21 2.4 Anonymity . 27 2.5 Cooperation . 42 3 Analysis and Proposed Design 48 3.1 Evaluation of Existing Work . 48 3.2 Outline of the Proposed Design . 49 3.3 Rationale . 51 3.4 Design Strategy . 55 4 Cooperation in Distributed Networks 56 4.1 Game Theoretic Models of Cooperation . 56 4.2 Simulations . 60 4.3 Discussion . 62 4.4 Extensions to the Model . 64 4.5 Conclusion . 66 5 Unforgeable Acknowledgements 67 5.1 The Unforgeable Acknowledgement Mechanism . 67 5.2 Security . 69 5.3 Applicability . 70 4 5.4 Engineering Considerations . 71 5.5 Experimental Evaluation . 72 5.6 Related Work . 74 5.7 Discussion . 75 5.8 Conclusion . 77 6 Routing Protocols for Untrusted Networks 78 6.1 Assumptions and Terminology . 78 6.2 The Darknet Protocol . 79 6.3 Simulations . 85 6.4 Robustness . 91 6.5 Cooperation . 93 6.6 The Exu Protocol . 94 6.7 Conclusion . 101 7 Conclusions and Future Work 102 7.1 Summary of Results . 102 7.2 Discussion . 103 7.3 Future Work . 104 A The Simulation Framework 130 5 Acknowledgements Spending eight years on a puzzle is a selfish use of time, and of the many people I would like to thank for their support, advice, encouragement and inspiration during the time it has taken to write this thesis, there are some who first deserve an apology. Laura, Alan and Dan, I’m sorry for too often letting work get in the way. My thanks go first to my parents, who always encouraged me to be curious and to enjoy learning, although they may wish by now that they had emphasised the benefits of employment instead. I would also like to thank my colleagues at UCL and elsewhere – especially Denise, Piers, Manish, Torsten, Mo, Daniele, Toad and Matteo – for everything they taught me. To the friends in the CBR who pulled me through some difficult times and difficult haircuts – HB, Itch, Russell, Phil, Jimbo, Jamie, Mike – thank you. Lorena, I wouldn’t have understood the full horror of what it is to be a PhD student without our conversations. To the crew of the good ship LimeWire, now holed below the waterline, I offer my thanks for making me into a better coder and a worse drinker. I would also like to thank my supervisors, Steve Hailes, Cecilia Mascolo, Licia Capra, and above all Saleem Bhatti, without whose patience, generosity, insight, wise advice and good humour this long random walk would not have reached its destination. καλλιστη 6 Chapter 1 Introduction “Now, I been in jail when all my mail showed That a man can’t give his address out to bad company” – Bob Dylan, Absolutely Sweet Marie 1.1 Background Scientific research always exists within a social context. The goals of the present work – privacy and censorship- resistance – are social as well as technical concepts, and before defining them in technical terms we must first consider something of their social meaning. Censorship Censorship, narrowly defined, is the official examination and suppression of material that is to be published. However, in the context of Internet censorship, this definition immediately raises a number of questions. Can an automatic Internet filter be said to perform an official examination? Is denying access to published material from a particular location – such as a school, a library, or even an entire country – equivalent to prohibiting its publication? Can material that circulates between friends be said to have been published? Jansen [1] argues for a broader conception of censorship as “socially structured silence”, recognising that power relations may influence discourse in many ways. These include official and unofficial punishment and intimidation; social norms that deny certain individuals a public voice; institutional practices that limit the spread of information; and the power of markets and media owners to decide what is published. Whether such influence is active, as in the case of a government banning a newspaper, or passive, as in the case of a newspaper declining to cover a controversial story, the effect of censorship is to reinforce the relations of power that produce it. If censorship is an effect of power relations then we might suppose that it can be resisted by placing communication beyond the reach of power. Habermas [2] imagines an ideal speech situation where “no force except that of the better argument is exercised” and “all motives except that of the cooperative search for truth are excluded.” In this ideal situation, speakers seek universal consensus in “an atmosphere free of coercion or dependencies (inequalities) that would incline individuals toward acquiescence or silence” [3]. Habermas admits that this ideal is never achieved in practice, but it might be argued that even as an ideal, the notion of universal consensus implicitly deprecates dissent. We might also ask how consensus can be distinguished from mere compliance – Strauss [4] describes how the threat of persecution has led many authors to “write between the lines”, creating an appearance of agreement by concealing subversive messages within apparently conformist texts. Lyotard [5] rejects the goal of universal consensus in favour of a contestational model of discourse as a set of in- commensurable language games, where “every utterance should be thought of as a ‘move’ in a game.” For Lyotard, disagreement and dissent are enlivening rather than threatening; nevertheless, power can still intrude into language games in the form of terror: “eliminating, or threatening to eliminate, a player from the language game one shares 7 with him.” Thus, whether discourse is seen as the search for consensus or as a competitive and constantly evolving game, the influence of power relations cannot be ignored. Recent analyses of Internet censorship reveal a wide range of practices being used to control online discourse, from the simple filtering of Internet traffic to complex socio-technical systems of monitoring, self-regulation, intimidation and propaganda that blur the line between repressive and productive forms of power [6, 7, 8, 9, 10]. Clearly, contemporary censorship is not merely a matter of preventing access to information: it is a matter of shaping discourse in accordance with the demands of power. Surveillance and Privacy According to Murakami Wood [11], “Where we find purposeful, routine, systematic and focused attention paid to per- sonal details, for the sake of control, entitlement, management, influence or protection, we are looking at surveillance.” If censorship is socially structured silence, then surveillance is socially structured visibility. Foucault [12] uses the Panopticon, Bentham’s proposal for a circular prison in which the inmates are constantly and unobtrusively observed from a central watchtower [13], to illustrate the relationship between power and visibility. According to Foucault, those who are under surveillance internalise the power of the observer; control becomes self- control. “He who is subjected to a field of visibility, and who knows it, assumes responsibility for the constraints of power; he makes them play spontaneously upon himself; he inscribes in himself the power relation in which he simultaneously plays both roles; he becomes the principle of his own subjection.” In recent years, surveillance has moved beyond the walls of the institutions described by Foucault and has become ubiquitous.
Recommended publications
  • Cryptography
    Pattern Recognition and Applications Lab CRYPTOGRAPHY Giorgio Giacinto [email protected] University of Cagliari, Italy Spring Semester 2019-2020 Department of Electrical and Electronic Engineering Cryptography and Security • Used to hide the content of a message • Goals – Confidentiality – Authenticity – Integrity • The text is modified by an encryption function – An interceptor should not be able to understand all or part of the message content http://pralab.diee.unica.it 2 Encryption/Decryption Process Key Key (Optional) (Optional) Original Plaintext Encryption Ciphertext Decryption Plaintext http://pralab.diee.unica.it 3 Keys and Locks http://pralab.diee.unica.it 4 Keys L F A Y B D E T C A R C S E E T Y H G S O U S U D H R D F C E I D B T E M E P Q X N R C I D S F T U A E T C A U R M F N P E C J N A C R D B E M K C I O P F B E W U X I Y M C R E P F N O G I D C N T M http://pralab.diee.unica.it 5 Keys L F A Y B D E T C A R C S E E T Y H G S O U S U D H R D F C E I D B T E M E P Q X N R C I D S F T U A E T C A U R M F N P E C J N A C R D B E M K C I O P F B E W U X I Y M C R E P F N O G I D C N T M http://pralab.diee.unica.it 6 Steganography - = http://pralab.diee.unica.it https://towardsdatascience.com/steganography-hiding-an-image-inside-another-77ca66b2acb1 7 Definitions • Cryptography algorithm C = E(K,M) A function E with two inputs – a message M – a key K that outputs – the encrypted message C The algorithm is based on a shared secret between the sender and the receiver K The Encryption Key http://pralab.diee.unica.it 8 Symmetric
    [Show full text]
  • 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]
  • Reporters Without Borders TV5 Monde Prize 2015 Nominees
    Reporters Without Borders ­ TV5 Monde Prize 2015 Nominees Journalist Category Mahmoud Abou Zeid, aka Shawkan (Egypt) “I am a photojournalist, not a criminal,” Shawkan wrote from Tora prison in February. “My ​ ​ ​ indefinite detention is psychologically unbearable. Not even animals would survive in these conditions." ​ Shawkan is an Egyptian freelance photojournalist who has been in pre­trial detention for more than 760 days. He was arrested on 14 August 2013 while providing the US photojournalism agency Demotix and the US digital media company Corbis with coverage of ​ ​ ​ ​ the violence used to disperse demonstrations by deposed President Mohamed Morsi’s supporters in Rabiaa Al­Awadiya Square. Three journalists were killed that day in connection with their work Aged 28, Shawkan covered developments in Egypt closely from Mubarak’s fall to Morsi’s overthrow and on several occasions obtained striking shots of the popular unrest. His detention became illegal in August of this year because, under Egyptian law, pre­trial detention may surpass two years only in exceptional cases. Few people in Egypt have ever been held pending trial as long as him. A date has finally been set for the start of his trial, 12 December 2015, when he will be prosecuted before a Cairo criminal court along with more than 700 other defendants including members of the Muslim Brotherhood, which was declared a terrorist organization in December 2013. Many charges have been brought against him without any evidence, according to his lawyer, Karim Abdelrady. The most serious include joining a banned organization [the Muslim Brotherhood], murder, attacking the security forces and possession of weapons.
    [Show full text]
  • N2N: a Layer Two Peer-To-Peer VPN
    N2N: A Layer Two Peer-to-Peer VPN Luca Deri1, Richard Andrews2 ntop.org, Pisa, Italy1 Symstream Technologies, Melbourne, Australia2 {deri, andrews}@ntop.org Abstract. The Internet was originally designed as a flat data network delivering a multitude of protocols and services between equal peers. Currently, after an explosive growth fostered by enormous and heterogeneous economic interests, it has become a constrained network severely enforcing client-server communication where addressing plans, packet routing, security policies and users’ reachability are almost entirely managed and limited by access providers. From the user’s perspective, the Internet is not an open transport system, but rather a telephony-like communication medium for content consumption. This paper describes the design and implementation of a new type of peer-to- peer virtual private network that can allow users to overcome some of these limitations. N2N users can create and manage their own secure and geographically distributed overlay network without the need for central administration, typical of most virtual private network systems. Keywords: Virtual private network, peer-to-peer, network overlay. 1. Motivation and Scope of Work Irony pervades many pages of history, and computing history is no exception. Once personal computing had won the market battle against mainframe-based computing, the commercial evolution of the Internet in the nineties stepped the computing world back to a substantially rigid client-server scheme. While it is true that the today’s Internet serves as a good transport system for supplying a plethora of data interchange services, virtually all of them are delivered by a client-server model, whether they are centralised or distributed, pay-per-use or virtually free [1].
    [Show full text]
  • OPEN SOURCE Software Enter the World Of
    OPEN SOURCE Software http://www.bacula.org http://eraser.heidi.ie Eraser is a secure data Bacula is a set removal tool for Win- of computer programs that permit manag- dows. It completely removes sensitive data ing backup, recovery, and verification of from your hard drive by overwriting it several computer data across a network of com- times with carefully selected patterns. Eraser puters of different kinds. Based on Source is currently supported under Windows XP Forge downloads, Bacula is the most popu- lar Open Source backup program. (with Service Pack 3), Windows Server 2003 (with Service Pack 2), Windows Vista, Win- dows Server 2008, Windows 7 and Windows Server 2008 R2. http://www.emule-project.net e M u l e is a filesharing client which is based on http://shareaza.sourceforge.net/ the eDonkey2000 network but offers more features than the standard client. Shareaza is a very powerful multi-network eMule is one of the biggest and most peer-to-peer ( P2P ) file-sharing client sup- reliable peer-to-peer file sharing clients porting Gnutella² ( G2 ), Gnutella ( G1 ), around the world. eDonkey2000 ( eMule ), DC++, HTTP, FTP and BitTorrent protocols for Windows (or Wine). It allows you to download any file-type For more OSS, visit sourceforge found on several popular P2P networks. Shareaza is FREE & contains NO Spyware or third-party products. http://www.scintilla.org Scintilla is a free source code editing compo- nent which includes useful features such as syntax styling, error indicators, folding, code completion and call tips. The project includes SciTE (SCIntilla based Text Editor).
    [Show full text]
  • The Edonkey File-Sharing Network
    The eDonkey File-Sharing Network Oliver Heckmann, Axel Bock, Andreas Mauthe, Ralf Steinmetz Multimedia Kommunikation (KOM) Technische Universitat¨ Darmstadt Merckstr. 25, 64293 Darmstadt (heckmann, bock, mauthe, steinmetz)@kom.tu-darmstadt.de Abstract: The eDonkey 2000 file-sharing network is one of the most successful peer- to-peer file-sharing applications, especially in Germany. The network itself is a hybrid peer-to-peer network with client applications running on the end-system that are con- nected to a distributed network of dedicated servers. In this paper we describe the eDonkey protocol and measurement results on network/transport layer and application layer that were made with the client software and with an open-source eDonkey server we extended for these measurements. 1 Motivation and Introduction Most of the traffic in the network of access and backbone Internet service providers (ISPs) is generated by peer-to-peer (P2P) file-sharing applications [San03]. These applications are typically bandwidth greedy and generate more long-lived TCP flows than the WWW traffic that was dominating the Internet traffic before the P2P applications. To understand the influence of these applications and the characteristics of the traffic they produce and their impact on network design, capacity expansion, traffic engineering and shaping, it is important to empirically analyse the dominant file-sharing applications. The eDonkey file-sharing protocol is one of these file-sharing protocols. It is imple- mented by the original eDonkey2000 client [eDonkey] and additionally by some open- source clients like mldonkey [mlDonkey] and eMule [eMule]. According to [San03] it is with 52% of the generated file-sharing traffic the most successful P2P file-sharing net- work in Germany, even more successful than the FastTrack protocol used by the P2P client KaZaa [KaZaa] that comes to 44% of the traffic.
    [Show full text]
  • The Limits of Commercialized Censorship in China
    The Limits of Commercialized Censorship in China Blake Miller∗ September 27, 2018 Abstract Despite massive investment in China's censorship program, internet platforms in China are rife with criticisms of the government and content that seeks to organize opposition to the ruling Communist Party. Past works have attributed this \open- ness" to deliberate government strategy or lack of capacity. Most, however, do not consider the role of private social media companies, to whom the state delegates information controls. I suggest that the apparent incompleteness of censorship is largely a result of principal-agent problems that arise due to misaligned incentives of government principals and private media company agents. Using a custom dataset of annotated leaked documents from a social media company, Sina Weibo, I find that 16% of directives from the government are disobeyed by Sina Weibo and that disobedience is driven by Sina's concerns about censoring more strictly than com- petitor Tencent. I also find that the fragmentation inherent in the Chinese political system exacerbates this principal agent problem. I demonstrate this by retrieving actual censored content from large databases of hundreds of millions of Sina Weibo posts and measuring the performance of Sina Weibo's censorship employees across a range of events. This paper contributes to our understanding of media control in China by uncovering how market competition can lead media companies to push back against state directives and increase space for counterhegemonic discourse. ∗Postdoctoral Fellow, Program in Quantitative Social Science, Dartmouth College, Silsby Hall, Hanover, NH 03755 (E-mail: [email protected]). 1 Introduction Why do scathing criticisms, allegations of government corruption, and content about collective action make it past the censors in China? Past works have theorized that regime strategies or state-society conflicts are the reason for incomplete censorship.
    [Show full text]
  • Emerging Cyber Threats to the United States Hearing
    EMERGING CYBER THREATS TO THE UNITED STATES HEARING BEFORE THE SUBCOMMITTEE ON CYBERSECURITY, INFRASTRUCTURE PROTECTION, AND SECURITY TECHNOLOGIES OF THE COMMITTEE ON HOMELAND SECURITY HOUSE OF REPRESENTATIVES ONE HUNDRED FOURTEENTH CONGRESS SECOND SESSION FEBRUARY 25, 2016 Serial No. 114–55 Printed for the use of the Committee on Homeland Security Available via the World Wide Web: http://www.gpo.gov/fdsys/ U.S. GOVERNMENT PUBLISHING OFFICE 21–527 PDF WASHINGTON : 2016 For sale by the Superintendent of Documents, U.S. Government Publishing Office Internet: bookstore.gpo.gov Phone: toll free (866) 512–1800; DC area (202) 512–1800 Fax: (202) 512–2104 Mail: Stop IDCC, Washington, DC 20402–0001 COMMITTEE ON HOMELAND SECURITY MICHAEL T. MCCAUL, Texas, Chairman LAMAR SMITH, Texas BENNIE G. THOMPSON, Mississippi PETER T. KING, New York LORETTA SANCHEZ, California MIKE ROGERS, Alabama SHEILA JACKSON LEE, Texas CANDICE S. MILLER, Michigan, Vice Chair JAMES R. LANGEVIN, Rhode Island JEFF DUNCAN, South Carolina BRIAN HIGGINS, New York TOM MARINO, Pennsylvania CEDRIC L. RICHMOND, Louisiana LOU BARLETTA, Pennsylvania WILLIAM R. KEATING, Massachusetts SCOTT PERRY, Pennsylvania DONALD M. PAYNE, JR., New Jersey CURT CLAWSON, Florida FILEMON VELA, Texas JOHN KATKO, New York BONNIE WATSON COLEMAN, New Jersey WILL HURD, Texas KATHLEEN M. RICE, New York EARL L. ‘‘BUDDY’’ CARTER, Georgia NORMA J. TORRES, California MARK WALKER, North Carolina BARRY LOUDERMILK, Georgia MARTHA MCSALLY, Arizona JOHN RATCLIFFE, Texas DANIEL M. DONOVAN, JR., New York BRENDAN P. SHIELDS, Staff Director JOAN V. O’HARA, General Counsel MICHAEL S. TWINCHEK, Chief Clerk I. LANIER AVANT, Minority Staff Director SUBCOMMITTEE ON CYBERSECURITY, INFRASTRUCTURE PROTECTION, AND SECURITY TECHNOLOGIES JOHN RATCLIFFE, Texas, Chairman PETER T.
    [Show full text]
  • Osiris Secure Social Backup
    James Bown Osiris Secure Social Backup Computer Science Tripos, Part II Project St John’s College May 17, 2011 The cover page image is the hieroglyphic representation of the Ancient Egyptian god of the underworld, Osiris. His legend tells of how he was torn into pieces and later resurrected by bringing them together once again. The font used to generate this image was used with the kind permission of Mark-Jan Nederhof (http://www.cs.st-andrews.ac.uk/~mjn/). Proforma Name: James Bown College: St John’s College Project Title: Osiris – Secure Social Backup Examination: Computer Science Tripos, Part II Project Date: May 17, 2011 Word Count: 11,841 Project Originator: Malte Schwarzkopf Supervisor: Malte Schwarzkopf Original Aims of the Project To produce a distributed system enabling mutually beneficial peer-to-peer backup between groups of friends. Each user provides storage space on their personal machine for other users to back up their data. In exchange, they have the right to back up their own files onto their friends’ machines. I focus on the challenges of space efficient distribution and fault tolerant retrieval of data. The use of convergent encryption and a strict security policy maintains confidentiality of data. Work Completed All success criteria specified in the proposal have been not only fulfilled, but exceeded. I have implemented a concurrent and distributed peer-to-peer backup system that is able to send, retrieve and remove files from the network, recover from node failure or loss, and provide high security supporting convergent encryption. Finally, I have completed a number of additional extensions.
    [Show full text]
  • 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]
  • Federer, Mike Bryan Seek Milestone Wins on Friday
    MERCEDES CUP: DAY 5 MEDIA NOTES Friday, June 10, 2016 TC Weissenhof, Stuttgart, Germany | June 6-12, 2016 Draw: S-28, D-16 | Prize Money: €606,525 | Surface: Grass ATP Info Tournament Info ATP PR & Marketing www.ATPWorldTour.com www.mercedescup.de Martin Dagahs: [email protected] @ATPWorldTour @MercedesCup Press Room: +49 711 32095705 facebook.com/ATPWorldTour facebook.com/MercedesCup FEDERER, MIKE BRYAN SEEK MILESTONE WINS ON FRIDAY QUARTER-FINAL PREVIEW: No. 1 seed Roger Federer could pass Hall-of-Famer Ivan Lendl on Friday and move into second place in the Open Era with 1,072 victories. Federer faces Florian Mayer in the Mercedes Cup quarter-finals, and with a win would trail only Jimmy Connors among the winningest players since the spring of 1968. Federer has a 6-0 FedEx ATP Head 2 Head record against Mayer, including straight-set wins on German grass at the Gerry Weber Open in 2005, 2012 and 2015. Federer is not the only man with a milestone on the line in Stuttgart. Mike Bryan seeks his 1,000th doubles win when he and twin brother Bob face Oliver Marach and Fabrice Martin in a semi-final match on Court 1. Only Federer, Lendl, Connors and Daniel Nestor have earned at least 1,000 victories in singles or doubles. Bob Bryan has 985 doubles wins individually. As a team, the Bryans are 984-300. Also in action are a pair of players who won their first ATP World Tour title in Stuttgart: 2002 champion Mikhail Youzhny and 2008 champion Juan Martin del Potro.
    [Show full text]
  • Machine-To-Machine Communication in Rural Conditions: Realizing Kasadakanet
    Machine-to-machine communication in rural conditions: Realizing KasadakaNet Fahad Ali VU Amsterdam [email protected] Supervised by Victor de Boer ABSTRACT the explored concepts is using Semantic Web technologies Contextual constraints play an important role in ICT for De- to facilitate knowledge sharing in rural areas (Gu´eret et al., velopment (ICT4D) projects. These ICT4D projects include 2011). those whose goal is to enable information and knowledge sharing in rural areas while keeping constraints such as lack One of the resulting products that came out of this research of electricity and technological infrastructure or (technical) is the Kasadaka2, a low-resource Raspberry Pi-based device illiteracy of end-users in mind. The Kasadaka project offers that provides an infrastructure on which voice-based appli- a solution for locals in rural areas in Sub-Saharan Africa to cations can be built and deployed locally. These applica- share knowledge. Due to a lack of technological infrastruc- tions for the Kasadaka are usually custom-built for specific ture, networks and internet connections are often not avail- needs and use cases. New applications can also be created able. Therefore, many ICT implementations in those areas fairly easily, making the platform ideal for rapid prototyping are not able to share data among each other. This paper (Baart, 2016). Essentially, these Kasadaka's are deployed on explores the possibilities of a machine to machine communi- a one-per-village basis, giving each village access to its own cation method to enable information sharing between geo- little piece of technology that facilitates local information graphically distributed devices.
    [Show full text]