DOCSLIB.ORG

The Dusk Network and Blockchain Architecture Scalable Consensus and Low-Latency Data Transmissions for Privacy-Driven Cryptosystems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Dusk Network and Blockchain Architecture Scalable Consensus and Low-Latency Data Transmissions for Privacy-Driven Cryptosystems The Dusk Network And Blockchain Architecture Scalable consensus and low-latency data transmissions for privacy-driven cryptosystems Emanuele Francioni Fulvio Venturelli Dusk Foundation Dusk Foundation Amsterdam, The Netherlands Amsterdam, The Netherlands [email protected] [email protected] ABSTRACT (4) Implement efficient payment mechanism for high QoS appli- In order to satisfy a broad set of data transfer scenario, the Dusk cations such as secure and anonymous voice calls network adds an additional layer of security to the IP protocol An important difference with CryptoNote, is that Dusk does suite (used mostly in a peer-to-peer fashion). Through the adop- not make use of proof-of-work mining and therefore drops com- tion of a mix of established strategies and novel techniques, the pletely CryptoNight and deviates substantially from the hashing Dusk network has been conceived specifically to protect the pri- algorithms therein adopted. In particular, Dusk uses what we call vacy of the communicating peers from any form of eavesdropping Segregated Byzantine Agreement (SBA?) protocol which enhances while satisfying a variety of challenging use cases varying from classic BA? by implementing specific measures to protect peer fast communication (e.g. voice calls) to large data transfer (e.g. privacy. SBA? has been developed specifically to power the Dusk file transmission). Dusk circumvents the notorious unreliability of Blockchain and help meeting the aforementioned requirements. crowd-sourced infrastructures by embedding economic incentives These efforts do not solely relate to the application layer but extend into the core mechanism of the network itself. Such incentives to the networking layer as well. This is why the Dusk protocol are designed to encourage peers to partake in the network in a makes use of: permission-less, anonymous and private fashion. • Stealth addresses: to protect transaction recipient anonymity • RingCT signature KEYWORDS : to protect transaction sender’s identity • Anonymous Network Layer: to protect the IP address of Dusk, blockchain, cryptocurrency, privacy, consensus, segregated the network peers; to provide secure data transfer mecha- byzantine agreement nism; to implement off-line data retrieval strategy; to power the anonymous gossip network for transaction propagation 1 INTRODUCTION and verification The Dusk network makes use of a decentralized and privacy-oriented • Non-Interactive Verifiable Secret Sharing Scheme: to digital currency that evolves the CryptoNote protocol[12] through conceal all but highest priority time-locked transactions from the groundbreaking discoveries in the field of Byzantine consensus the participants to the Block Generation sortition and pseudo-random functions of world renown cryptographers • Cryptographically Committed Provisioners: to protect such as Silvio Micali, Michael Rabin, Alexander Yampolskiy and the information about stake; to implement a division of re- Evgeniy Dodis. Dusk radically departs from any other blockchain sponsibilities between Block Generators and the electable by employing an adaptive consensus mechanism, called Segregated Block Voters and Verifiers; to boost network efficiency by Byzantine Agreement (or SBA?), which does not require the com- acting as state channel guarantors; to incentivise participa- putational intensity of proof-of-work and is a fairer alternative to tion to the network; to protect the balance information of proof-of-stake. Built on such consensus algorithm, Dusk is poised transacting nodes; to prepare SBA? for future expansion to be the first to simultaneously achieve previously conflicting with non-balance and non-payment related weights such as goals of guaranteeing transaction untraceability and unlinkability, storage contributed to the network (as in proof-of-storage), safeguarding user privacy, reaching transactional "finality" after a availability expressed in elapsed time since joining the net- bound number of rounds within a single block election and achiev- work (as in proof-of-idle), etc. ing virtually unbounded user scalability without any significant performance degradation. 2 PRELIMINARIES The Dusk network requires a heightened security setup designed 2.1 Diffie-Hellman Hardness Assumption specifically to: In any group, a discrete logarithm loдb a is a number x 2 Z such (1) Obfuscate IP addresses of the communicating peers that bx = a. (2) Prevent linkability and traceability of accounts Most of the cryptographic building blocks related to this work (3) Guarantee network performance are linked to the Diffie-Hellman assumption which uses the hard- ness of discrete logarithms in cyclic groups [13]. Considering a This paper is published under the MIT International license. Authors reserve their rights to disseminate the work on their personal and corporate Web sites with the multiplicative cyclic group G of order p and generator [2] д, we appropriate attribution. can formulate the following assumption: given дa and дb for uni- WEB3 Symposium, April 2018, Amsterdam, The Netherlands 2 Z ab © 2018 Stichting Dusk Foundation, published under MIT License. formly and independently chosen a ,b p then д performs like a random element in G of order p. 1 WEB3 Symposium, April 2018, Amsterdam, The Netherlands E. Francioni and F. Venturelli q : a prime number; q = 2255 − 19 ; This is the number of points in the curve. d : an element of Fq ; d = −121665/121666; Value used in the curve equation below E : an elliptic curve equation; −x2 + y2 = 1 + dx2y2; The Twisted Edwards curve/equation we are using G : a base point; G = ¹x; −4/5º; The**generator** point. This is a base - starting point used for all Elliptic modulo operations. Figure 1: A generic elliptic curve l : a prime order of the base point; l = 2252 + 27742317777372353535851937790883648493 ; The order of the base point G. This defines the maximum size of As a consequence of such assumed randomness, the Decisional scalars and the maximum number of points that can be used. Diffie-Hellman (DDH) Problem relates to distinguishing the follow- ∗ Hs : a cryptographic hash function f0; 1g ! Fq ; ing two probability distributions: Hp : a deterministic hash function E¹Fq º ! E¹Fq º; • (дa;дb ;дab ) a;b 2 Z All private and public keys in Dusk will be using 64 hex charac- 8 // ¹дa;дb ;дab º are defined as a Diffie-Hellman Tuple ters. • (дa;дb ;дc ) a;b;c 2 Z 8 2.2.3 Accounts and Addresses 2.2 Hiding Recipients: Stealth Addresses The following procedure will be used to create an address. Inspired by the CryptoNote white-paper[12], stealth address tech- (1) We pick a random /textitprivate spend key, by generating nology is at the basis of Dusk recipient hiding technique. Already 256 random bits, and reducing mod l. We call this b. widely tested in other privacy-oriented digital currencies, it is the (2) b is hashed with hashing algorithm H(Keccak_256). We inter- proven choice for concealing the true recipient address of a trans- pret the result of the hashing as an integer, reduce it mod l action while keeping uniqueness within the context of the ledger as before. We call this key a. (meaning no other address can be linked to a stealth address). Addi- (3) We generate our public spend and view keys B = bG and tionally, a derivation of an unbound number of receiving addresses A = aG is also possible without any of them allowing traceability back to (4) We hash (network prefix (0xEF) + B + A) with H. the recipient’s main address. As an anonymous key agreement pro- (5) Append the first 4 bytes of this operation to (prefix + B + A), tocol, Dusk uses the Elliptic Curve Diffie-Hellman (ECDH) due to obtaining a 69 bytes value (1 + 32 + 32 + 4) the desired property of allowing two parties to generate a shared (6) Convert this to cnBase58. secret by solely knowing each other’s public key, and the generator We will explain how stealth addresses work by first going trough point of the Elliptic Curve used in the Twisted Edward equation. a brief explanation about key exchanges on an ECC scenario, in the Following is a detailed explanation of how Dusk implements Stealth next section. Address technology. 2.2.4 The Elliptic Curve Diffie-Hellman 2.2.1 Elliptic-Curve Cryptography The Elliptic Curve Diffie-Hellman (ECDH) is an anonymous key The system makes use of Elliptic-Curve Cryptography (ECC), hence agreement protocol, a variant of the Diffie-Hellman protocol adapted approaching public-key cryptography through the algebraic struc- to work with Elliptic-Curve Cryptography. ture of elliptic curves and thus allowing for the creation of smaller Thanks to ECDH, two parties can generate a shared secret over and more efficient cryptographic keys. ECC gives the same security an unsecured connection only by knowing each other’s public levels of, for example, RSA, but using a much smaller security key. keys, and the generator point of the Elliptic Curve used in the ECC The structure of an elliptic curve is a plane curve satisfying the equation. equation y2 = x3 + ax + b, which returns us the graph in Figure 1. To demonstrate this, we will use Alice (with private key a and In ECC, a Galois Field is created by taking the modulo of all public key A=aG) and Bob (with private key b and public key B=bG). points using a large prime number, creating a finite number of (Where G is the generator point) values for the used equation. The following axioms are furthermore As previously stated, points on a curve can be added together, taken into account: and Alice could calculate a point C = A + B, but this could also be (1) A point can’t be multiplied or divided by another point. potentially done by anyone eavesdropping the conversation, since (2) Any point on the curve can be added or subtracted to another A and B are publicly available. point (or itself). Now, let’s remember that A and B are points on the elliptical (3) Adding a point to itself allows for scalar multiplication.
Load more

Recommended publications
  • Conditional Pseudonymity in Vehicular Ad Hoc Networks
    Diplom Thesis Faculty of Engineering and Computer Science Ulm University Conditional Pseudonymity in Vehicular Ad Hoc Networks Florian Marcus Schaub presented on November 13, 2008 Supervisors Prof. Dr.-Ing. Michael Weber Dr. Frank Kargl Advisor Zhendong Ma Faculty of Engineering and Computer Science, Ulm University James-Franck-Ring, 89081 Ulm, Germany This thesis has been prepared in the summer semester 2008 as a requirement for the completion of the Diplom course Medieninformatik at Ulm University. Cover photo: Night blur by Mando Gomez http://www.mandolux.com Printed on November 9, 2008. Some rights reserved. This work is licensed under the Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 Germany License. To view a copy of this license, visit http://creativecommons.org/ licenses/by-nc-nd/3.0/de/ or send a letter to Creative Commons, 171 Second Street, Suite 300, San Francisco, California, 94105, USA. Computer Science is no more about computers than astronomy is about telescopes. Edsger W. Dijkstra Contents 1 Introduction 1 2 Problem Analysis 5 2.1 Characteristics of Vehicular Ad Hoc Networks . 5 2.2 Security and Privacy in Vehicular Ad Hoc Networks . 9 2.3 Conditional Pseudonymity . 14 2.4 Summary . 18 3 Requirements for Privacy in VANETs 19 3.1 Assumptions . 20 3.2 General VANET Requirements . 21 3.3 Pseudonym Requirements . 23 3.4 Authentication Requirements . 28 3.5 Summary . 30 4 Privacy in other Domains 33 4.1 Health Care . 34 4.2 E-Government . 39 4.3 E-Commerce . 43 4.4 Internet . 51 4.5 Ad Hoc Networks . 59 4.6 Summary .
    [Show full text]
  • Analysis of the I2P Network
    Analysis of the I2P Network Degree programme: BSc in Computer Science | Specialisation: IT-Security Thesis advisor: Prof. Dr. Emmanuel Benoist Expert: Daniel Voisard (BAKOM) Providing anonymous online communication is challenging and an 1 important task. Similar to the well-known and -researched TOR project, I2P (Invisible Internet Project) aims to provide this inside its own network. But how secure and protected can a user feel when using I2P? The main objectives of this thesis were to create I2P Observer, a Java program which gathers and publishes information about the I2P network, and to evaluate possible attacks on the software. The I2P Network view pages with accurate data and monthly ones I2P aims to provide anonymous communication bet- where the average for each day is computed. I2P ween participating systems inside an overlay network, Observer is also easily configurable to collect more separated from other Internet traffic. It is written in and more accurate data. Java with versions for Windows, Linux and Mac, pro- viding HTTP- and HTTPS-Proxies for browsing and Theoretical Attacks on I2P APIs to adapt applications to communicate over I2P. The main motivation for this thesis was an evaluation Multiple layers of strong cryptography are used to pro- of I2P’s security, which was researched with 4 dif- tect the content of packets and a mechanism called ferent approaches: Garlic Routing, where multiple messages for the same − Impersonation of a service: Can a user be redirec- destination can be encapsulated, to hide meta data. ted to a malicious server without noticing it? Jens Henning Müller Its NetDB, a database distributed across participating A Clickjacking attack which allows this under cer- [email protected] peers – so called floodfil routers – contains all infor- tain circumstances was found.
    [Show full text]
  • Walking Onions: Scaling Distribution of Information Safely in Anonymity Networks
    Walking Onions: Scaling Distribution of Information Safely in Anonymity Networks by Chelsea Holland Komlo A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Masters of Mathematics in Computer Science Waterloo, Ontario, Canada, 2020 c Chelsea Holland Komlo 2020 Author’s Declaration This thesis consists of material all of which I authored or co-authored: see Statement of Con- tributions included in the thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Statement of Contributions Walking Onions first originated as a Tor proposal authored by Nick Mathewson [Mat20c], who is a co-author of this work. In this original proposal, Nick proposed the concept of ENDIVEs and SNIPs, as well as the concept of one protocol variant presented in this work which we call Telescoping Walking Onions. Additionally this proposal introduced the concept of bootstrapping using a circuit through a directory cache. Our collaboration on the published version of Walking Onions has since been accepted to the USENIX Security Symposium [KMG20]. In his capacity as co-author of our joint work, Nick created the framework for our bandwidth and CPU performance analysis, and used this framework to assess the performance of Telescop- ing Walking Onions relative to Idealized Tor. Nick also wrote the python script for our real numbers analysis, which we use to compare the performance of Walking Onions in actualized estimates against a simplified Tor-like network.
    [Show full text]
  • Integrating Privacy Enhancing Techniques Into Blockchains Using
    Integrating Privacy Enhancing Techniques into Blockchains Using Sidechains Reza M. Parizi, Sajad Homayoun, Abbas Yazdinejad, Ali Dehghantanha, Kim-Kwang Raymond Choo Department of Software Engineering and Game Development, Kennesaw State University, GA, USA [email protected] Department of Computer Engineering and Information Technology, Shiraz University of Technology,Shiraz, Iran [email protected] Faculty of Computer Engineering, University of Isfahan, Iran [email protected] School of Computer Science, University of Guelph, Ontario, Canada [email protected] Department of Information Systems and Cyber Security, The University of Texas at San Antonio, TX, USA [email protected] Abstract—Blockchains are turning into decentralized stored on a ledger, never to be erased, but that by nature it exists computing platforms and are getting worldwide recognition for on a blockchain which is irreversibly shared with the entire their unique advantages. There is an emerging trend beyond network. Although the pseudonym nature of blockchains is payments that blockchains could enable a new breed of deemed to protect the users’ identity [4], reputation and privacy decentralized applications, and serve as the foundation for is a very challenging issue because it is still possible to trace Internet’s security infrastructure. The immutable nature of the blockchain makes it a winner on security and transparency; it is back transactions to a specific identity through blockchain nearly inconceivable for ledgers to be altered in a way not instantly analytics techniques. As blockchain technology generally clear to every single user involved. However, most blockchains fall requires the storage and exchange of data on a large scale, it short in privacy aspects, particularly in data protection.
    [Show full text]
  • Monitoring the I2P Network Juan Pablo Timpanaro, Chrisment Isabelle, Festor Olivier
    Monitoring the I2P network Juan Pablo Timpanaro, Chrisment Isabelle, Festor Olivier To cite this version: Juan Pablo Timpanaro, Chrisment Isabelle, Festor Olivier. Monitoring the I2P network. [Research Report] RR-7844, INRIA. 2011. hal-00653136 HAL Id: hal-00653136 https://hal.inria.fr/hal-00653136 Submitted on 18 Dec 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Monitoring the I2P network Juan Pablo Timpanaro, Isabelle Chrisment, Olivier Festor N° 7844 — version 1 initial version October 2011 — revised version Décembre 2011 Domaine 2 apport de recherche ISSN 0249-6399 ISRN INRIA/RR--7844--FR+ENG Monitoring the I2P network Juan Pablo Timpanaro, Isabelle Chrisment, Olivier Festor Domaine : Algorithmique, programmation, logiciels et architectures Equipe-Projet´ madynes Rapport de recherche n° 7844 | version 1 | initial version October 2011 | revised version D´ecembre 2011 | 15 pages Abstract: We present the first monitoring study aiming to characterize the usage of the I2P network, a low-latency anonymous network based on garlic routing. We design a distributed monitoring architecture for the I2P network and show through a one week long experiment the ability of the system identify a significant number of all running applications, among web servers and file- sharing clients.
    [Show full text]
  • The Onion Router and the Darkweb
    The Onion Router and the Darkweb Corianna Jacoby Mentor: Ming Chow December 15, 2016 1 Abstract The Onion Project is a service that provides anonymized access to the Internet and the onion darknet primarily through obfuscation. It has created a network to route requests through which allows it to obfuscate users when accessing surface websites as well as allowing users to create sites on its darknet which cannot be traced back to the host machine. The darknet is used for a myriad of reasons, some mundane, some criminal, and some protection-based. This paper seeks to provide introductory knowledge about the workings of Tor as well as some of its vulnerabilities. 2 Introduction Tor provides two services, private and anonymous connections to the Internet and hidden services. Hidden services are websites that are anonymous, like its users. This means that the servers that run the website are hidden and the owner can remain anonymous. These sites can only be found using Tor and end in ‘.onion’ instead of ‘.com’ or an equivalent. These sites, because they can only be accessed through Tor, are considered to be a darknet, which is commonly defined as a suite of hidden internet services that require a specific protocol for access. Other protocols provide access to other darknets. Darknets make up the dark web, which is in turn a small portion of the deep web. The deep web refers to all web content that cannot be accessed through a standard search browser. This is a broad classification as, for instance, online government or university databases and content protected by pay-wall are also considered part of the dark web.1 It is estimated that the full content of the deep web vastly outweighs that of the surface web, or the web accessible through search engines.
    [Show full text]
  • How Alice and Bob Meet If They Don't Like Onions
    How Alice and Bob meet if they don’t like onions Survey of Network Anonymisation Techniques Erik Sy 34th Chaos Communication Congress, Leipzig Agenda 1. Introduction to Anonymity Networks Anonymity Strategies Towards Anonymity Adversaries 2. Anonymous Communication Networks I2P Freenet GNUnet JonDonym 3. Research Work 4. Conclusion 2 Anonymity Anonymity is the state of being not identifiable within a set of subjects, the an- onymity set. Andreas Pfitzmann 3 Sender Anonymity The sender may be anonymous only within a set of potential senders. 4 Recipient Anonymity The recipient may be anonymous only within a set of potential recipients. 5 Sender Recipient Anonymity 6 Unlinkability Unlinkability of two or more items of interest from an attacker’s perspective means that within the system, the attacker cannot sufficiently distinguish whe- ther these subjects are related or not. Pfitzmann, Hansen 7 Relationship Anonymity Alice can be linked to Bob. 8 Relationship Anonymity Traffic analysis • pattern in size of packets • pattern in timing of packets • content of messages • ... Alice cannot be linked to Bob. 9 Who do you trust? Strategies Towards Anonymity • Cover traffic • Broadcasting messages • Trusted third party (VPN, Proxy) • Shuffling and delaying of messages (mix, anonymous remailer) • Anonymity systems that distribute trust – Secure multi-party computation (DC-Nets) – Cascades of mixes – Onion routing – Garlic routing – ... 11 One-hop Mix 12 Onion Routing 13 Garlic Routing • Peer-to-peer • Uni-directional channels • Messages can be bundled • Uses layers of encryption 14 Adversaries External Adversary 16 Internal Adversary 17 Passive Adversary 18 Active Adversary 19 Local Adversary 20 Global Adversary 21 Anonymous Communication Networks Anonymous Communication Networks (ACNs) • Many defunct, unimplemented or unavailable networks exist – Conflux – MorphMix – Herbivore –..
    [Show full text]
  • IP Because of DNS Prefetching • Despite Using a VPN Service…
    BRKSEC-2011 About Garlic and Onions A little journey… Tobias Mayer, Technical Solutions Architect About Garlic and Onions We are all looking for privacy on the internet, for one or the other reason. This Session is about some technologies you can use to anonymise your network traffic, such as Tor (The Onion Router). The first part will give an introduction and explain the underlaying technology of Tor. We will take look at how you can not only use the Tor browser for access but also how the Tor network is working. We will learn how you can establish a Tor session and how we can find hidden websites and give examples of some websites...So we will enter the Darknet together. Beside Tor, we will also take a quick look at other techniques like I2P (Garlic Routing). In the last section we will make a quick sanity check what security technologies we can use to (maybe) detect such traffic in the network. This presentation is aimed at everyone who likes to learn about anonymization techniques and have a little bit of fun in the Darknet. BRKSEC-2011 © 2019 Cisco and/or its affiliates. All rights reserved. Cisco Public 3 Me… CCIE Security #14390, CISSP & Motorboat driving license… Working in Content Security & TLS Security tmayer{at}cisco.com Writing stuff at “blogs.cisco.com” BRKSEC-2011 © 2019 Cisco and/or its affiliates. All rights reserved. Cisco Public 4 Cisco Webex Teams Questions? Use Cisco Webex Teams (formerly Cisco Spark) to chat with the speaker after the session How 1 Find this session in the Cisco Events Mobile App 2 Click “Join the Discussion” 3 Install Webex Teams or go directly to the team space 4 Enter messages/questions in the team space cs.co/ciscolivebot#BRKSEC-2011 BRKSEC-2011 © 2019 Cisco and/or its affiliates.
    [Show full text]
  • I2P Forensic Analysis
    International Journal of Recent Technology and Engineering (IJRTE) ISSN: 2277-3878, Volume-8 Issue-6, March 2020 I2P Forensic Analysis Sneha Soney, C. Balan, Priya P. Sajan, Elizabeth Rose Lalson Tor-based portal for selling illegal products, permanently Abstract: I2P is an anonymous P2P distributed communication abandoned the Tor network for I2P. Cryptowall 3.0 layer used to send messages to each other anonymously and ransomware and Dyre banking Trojan used I2P for their safely. It is built on top of the internet and can be considered as an communication. The malware named i2Ninja, was noticed internet within the internet. Even though I2P is developed with an intention to create censorship resistant environment for the free available at an underground Russian cyber-crime forum. For flow of information, it is misused for illegal activities now a days. all major browsers (Internet Explorer, Firefox and Chrome), The possible misuses are less known among law enforcement i2Ninja is capable of HTML injection and form grabbing. agencies and existing industry approved software programs have The malware toolkit uses I2P networking layer to mask no detection functionality for I2P. Because of the increased use of communications between infected machines and the botnet’s I2P in criminal purposes, there is a need for methods and tools to command-and-control server. acquire and analyze digital evidence related to I2P. We conducted a detailed live memory dump analysis in order to find out the I2P Because of increase in cyber-crimes using I2P there is a related artifacts from a host machine. Furthermore, we propose a need for methods and tools to acquire and analyse digital tool that will analyze the memory dump and system local files to evidence related to the same.
    [Show full text]
  • Anonymity Online
    Anonymity Online Halil Kemal TAŞKIN hkt.me Middle East Technical University Institute of Applied Mathematics Department of Cryptography Notice All the information and pictures in this presentation are gathered from public resources Credits • www.torproject.org • www.i2p2.de • Roger Dingledine – www.freehaven.net • Paul Syverson – www.itd.nrl.navy.mil – www.onion-router.net Index • Introduction – Cryptography – Computer Networks & Internet – Digital Security, Privacy & Anonimity • Tor – Threat Model – Tor Protocol – Tor Services & Tools • I2P – Threat Model – I2P Protocol – I2P Services & Tools • Tor vs. I2P • Tor & I2P Hands on • References, Sources & Links Introduction • Cryptography • Computer Networks & Internet – How Internet works? – Network Security – Proxies • Digital Concerns – Security – Privacy – Anonimity Cryptology Classic Modern Cryptography Cryptanalysis Keyed Primitives Unkeyed Primitives Hash Functions Symmetric Asymmetric MAC PRNG Block Ciphers PKC AES, DES, RC5, IDEA etc. RSA, ECC, ElGamal etc. Stream Ciphers Digital Signature RC4, A5/1,E0 etc. DSA, RSA, ECC etc. Internet A little history • As always, Alice and Bob want to communicate with each other. • Circuit Switched Network • Packet Switched Network Circuit Switched Network • Developed by Bell, Hubbard and Sanders in 1878. • Primarily designed for audio communication. • Manual systems were used until 1920s. Circuit Switched Network • Creates a direct physical connection between 2 devices such as phones or computers. Packet Switched Network • First proposed for military
    [Show full text]
  • Analysis of the I2P Network Information Gathering and Attack Evaluations
    Analysis of the I2P Network Information Gathering and Attack Evaluations Bachelor Thesis Degree course: [Computer Science] Authors: [Jens Muller]¨ Tutor: [Prof. Dr. Emmanuel Benoist] Experts: [Daniel Voisard, BAKOM] Date: 16.06.2016 Berner Fachhochschule j Haute ´ecole sp´ecialis´eebernoise j Bern University of Applied Sciences Versions Version Date Status Remarks 1.0 16.06.2016 Final Final version Management Summary This thesis consists of three main parts, one giving an introduction to I2P, the Invisible Internet Project, one that presents I2P Observer, a software to collect information about I2P and one that evaluates different attack possibilities on I2P. The I2P Network aims to provide anonymous communication between participating systems inside an overlay network, separated from other Internet traffic. It is written in Java with versions for Windows, Linux and Mac, providing HTTP- and HTTPS-Proxies for browsing and APIs to adapt applications to communicate over I2P. Multiple layers of strong cryptography are used to protect the content of packets and a mechanism called Garlic Routing, where multiple messages for the same destination can be encapsulated, to hide meta data. Its NetDB, a database distributed across participating peers - so called floodfil routers - contains all information needed to contact other users and services. I2P Observer is a software written in Java to collect and publish data from the I2P network to provide historical data about it, with graphical representation of the most important facts to ease the detection of major changes. It extracts information from a locally running I2P instance including addresses, the number of floodfil routers, their known amount of entries in the NetDB and the software version.
    [Show full text]
  • An Analysis of Tools for Online Anonymity Stephanie Winkler University of Kentucky, [email protected]
    University of Kentucky UKnowledge Information Science Faculty Publications Information Science 2015 An Analysis of Tools for Online Anonymity Stephanie Winkler University of Kentucky, [email protected] Sherali Zeadally University of Kentucky, [email protected] Right click to open a feedback form in a new tab to let us know how this document benefits oy u. Follow this and additional works at: https://uknowledge.uky.edu/slis_facpub Part of the Communication Technology and New Media Commons, Library and Information Science Commons, and the Science and Technology Studies Commons Repository Citation Winkler, Stephanie and Zeadally, Sherali, "An Analysis of Tools for Online Anonymity" (2015). Information Science Faculty Publications. 20. https://uknowledge.uky.edu/slis_facpub/20 This Article is brought to you for free and open access by the Information Science at UKnowledge. It has been accepted for inclusion in Information Science Faculty Publications by an authorized administrator of UKnowledge. For more information, please contact [email protected]. An Analysis of Tools for Online Anonymity Notes/Citation Information Published in International Journal of Pervasive Computing and Communications, v. 11, no. 4, p. 436-453. © Emerald Group Publishing Limited The opc yright holder has granted the permission for posting the article here. The document available for download is the authors' post-peer-review final draft of the ra ticle. Digital Object Identifier (DOI) http://dx.doi.org/10.1108/IJPCC-08-2015-0030 This article is available at UKnowledge: https://uknowledge.uky.edu/slis_facpub/20 1 An Analysis of Tools for Online Anonymity Abstract The ability to remain anonymous while engaging in different activities online is increasingly sought after by consumers with privacy concerns.
    [Show full text]