DOCSLIB.ORG

A Systematic Review of Anonymous Communication Systems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Systematic Review of Anonymous Communication Systems A Systematic Review of Anonymous Communication Systems Ramzi A. Haraty1, Maram Assi1 and Imad Rahal2 1Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon 2Department of Computer Science, College of Saint Benedict & Saint John’s University, Collegeville, MN, U.S.A. Keywords: Anonymous Systems, Crowds, FreeNet, NetCamo, Mixmaster, Tarzan, TOR. Abstract: Privacy and anonymity are important concepts in the field of communication. Internet users seek to adopt protective measures to ensure the privacy and security of the data transmitted over the network. Encryption is one technique to secure critical information and protect its confidentiality. Although there exist many encryption algorithms, hiding the identity of the sender can only be achieved through an anonymous network. Different classifications of anonymous networks exist. Latency level and system model architecture are two essential criteria. In this paper, we present a description of a set of anonymous systems including NetCamo, TOR, I2P and many others. We will show how these systems work and contrast the advantages and disadvantages of each one of them. 1 INTRODUCTION (Mittal 2012). Hiding the user-server relationship is another crucial goal behind any communication. For Due to the increasing use of the Internet and the example, let us consider a client that wishes to emergence of wireless technologies, the value of communicate with a web server. This client might security and privacy is becoming more significant. prefer to stay anonymous. One of the protective New online activities have arisen during the last measures that help hiding the identity of users decade with the advancement of the electronic communicating through the internet is anonymous communication. People can now shop online, send network. These networks allow users to surf the and receive emails, pay their mobile bills, and make Web without leaving any tracking information. diverse banking operations. These types of In (Chaum 1981), Chaum presented almost the electronic activities produced new challenges. Two first architecture allowing the transmission of main goals the sender of information over the untraceable email. The main idea behind the network seeks to ensure: the privacy and the security proposed architecture is to allow communicating of the communicated information. Confidentiality peers to transmit data through cascade proxies and protection of the data can be achieved through known as Onion Routers. Anonymity is achieved by encryption mechanisms. Encryption in general is the use of public key cryptography. Most other capable of hiding the content of the information in proposed anonymous systems nowadays are based the network. Moreover, in some cases, the sender on Chaum’s scheme. While the main goal behind might wish to hide his/her identity. This objective anonymous system is to protect the identity of the can be achieved through the use of anonymous sender or the receiver, several other motivations systems. exist. Some common ones include freedom of Traffic analysis is the art of examining and speech, censorships and personal privacy in order to intercepting messages transmitted over the network prevent data mining and tracking. Anonymous to infer information, thus it violates user privacy. systems can be classified into two main types: high Several technologies exist to ensure data integrity latency and low latency. In the former category of and the security of the transmitted information that networks, the transmitted message takes several might be very critical in certain cases. Anonymous hours or even several days to reach the desired communication protects the identities of the sender destination. Quick response is not required for such and the receiver from third parties and keeps the application including email systems for example identity of the user hidden from remote parties (Wiangsripanawan, 2007). For interactive and real- time applications like instant messaging, a low 211 Haraty, R., Assi, M. and Rahal, I. A Systematic Review of Anonymous Communication Systems. DOI: 10.5220/0006216802110220 In Proceedings of the 19th International Conference on Enterprise Information Systems (ICEIS 2017) - Volume 2, pages 211-220 ISBN: 978-989-758-248-6 Copyright © 2017 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved ICEIS 2017 - 19th International Conference on Enterprise Information Systems latency communication network is required because occur at any of these locations or even public of the timing constraint. TOR and I2P are two networks whereby a malicious attacker can sniff examples of low latency anonymous systems that packets being transmitted and received by a will be discussed in the next section (Zantout, particular user or a number of users, and then apply 2011)(Haraty, 2014). From an architecture point of traffic analysis techniques. One has to note here that view, anonymous systems can be divided into two preventing traffic analysis at the end-to-end level is categories client-server communication system and realistically impossible if infrastructure network peer-to-peer based anonymous network. In fact, in security measurements are not implemented on the the client-server model, only few nodes are selected infrastructure level. to provide anonymity to the rest of the users. One 2. Trust is in “Cathy” disadvantage of this architecture is that the number In any security model example or illustration, of server nodes is small, and an attacker can easily authors tend to use Bob and Alice as two entities track the traffic. The P2P architecture overcomes wishing to receive and send information from/to this challenge. The main idea behind this model is each other with a trusted entity called Cathy, and a that there is no distinction between a server and a malicious attacker called Eve. The aim of any traffic user (Zhang, 2011). In these systems, it is hard to analysis avoidance algorithm considers Eve as an distinguish the sender and the receiver nodes. As a eavesdropper that will only sniff information. matter of fact, all nodes in the network are Hence, the algorithm designed by security personnel considered universal receivers and universal senders tries as much as possible to circumvent traffic being making it difficult to detect whether a specific node passed to Alice and Bob through many and different is transmitting or receiving data. routes while camouflaging and encrypting data in This paper investigates the network anonymous order not to allow Eve to sniff this information. systems that seek to protect the identity of the sender What is somewhat confusing is that sometimes one of information transmitted over the Internet and that only considers Eve to be on one of the routes that provide secrecy. Each upcoming section describes information is being sent to and from Alice and Bob, how a specific system works to achieve anonymity. and that Eve is only capable of sniffing abilities and A contrast of the advantages and disadvantages of not injecting information or even tampering with the each technology is illustrated later. Finally, the last data being sent through a route or different routes. section summarizes the major ideas discussed in this Moreover, in any security model, the adoption of paper. a trusted entity, Cathy, is a must to verify the identity of senders and receivers and later to validate the data being transmitted and received from parties 2 BACKROUND involved. Cathy happens to be a fixed host that is susceptible to attacks by Eve also, and any Throughout the research that was conducted during compromise done to Cathy renders the whole the preparation of this paper, a number of security model useless sometimes. As a simple observations where noted for the design and example, if Eve is capable of injecting information implementation of the new methodology. They are onto a stream whereby Cathy has been compromised as follows: by Eve, the receiving entity will try to validate this 1. No Real End-to-End Traffic Analysis information against Eve and not the trusted entity Prevention Assurance: Cathy. Data integrity is a vital part of any security Although many of the previously mentioned system and having a single point of failure is ultimately a drawback in any security model. In an implementations claimed avoiding traffic analysis, ever growing world of communication and the possibility for this to occur is extremely high and unavoidable in unmanaged Local Area Networks networks, one has to consider alternatives to basic security models and concepts. Decentralization of (LAN). Securing LAN environments could be a costly, trusted entities needs to be seriously considered in and sometimes an overkill (cost wise), for anonymous systems hence the reason why I2P was invented. organizations of different sizes. Using any of the implementations in unsecured LAN environments 3. Questionable Host Reliability and Security such as computer labs, work environments, or Almost every traffic analysis avoidance design and wireless networks is somehow a hassle and rarely implementation relies on hosts that belong to users found. Therefore man-in-the-middle attacks can for creating different routes and therefore passing 212 A Systematic Review of Anonymous Communication Systems data through different hops on the network or the more anonymity to the transmission of traffic and Internet. also hiding the identity of the sender. However this What some of the implementations lack, is also adds more latency and
Load more

Recommended publications
  • What Is Peer-To-Peer File Transfer? Bandwidth It Can Use
    sharing, with no cap on the amount of commonly used to trade copyrighted music What is Peer-to-Peer file transfer? bandwidth it can use. Thus, a single NSF PC and software. connected to NSF’s LAN with a standard The Recording Industry Association of A peer-to-peer, or “P2P,” file transfer 100Mbps network card could, with KaZaA’s America tracks users of this software and has service allows the user to share computer files default settings, conceivably saturate NSF’s begun initiating lawsuits against individuals through the Internet. Examples of P2P T3 (45Mbps) internet connection. who use P2P systems to steal copyrighted services include KaZaA, Grokster, Gnutella, The KaZaA software assesses the quality of material or to provide copyrighted software to Morpheus, and BearShare. the PC’s internet connection and designates others to download freely. These services are set up to allow users to computers with high-speed connections as search for and download files to their “Supernodes,” meaning that they provide a How does use of these services computers, and to enable users to make files hub between various users, a source of available for others to download from their information about files available on other create security issues at NSF? computers. users’ PCs. This uses much more of the When configuring these services, it is computer’s resources, including bandwidth possible to designate as “shared” not only the and processing capability. How do these services function? one folder KaZaA sets up by default, but also The free version of KaZaA is supported by the entire contents of the user’s computer as Peer to peer file transfer services are highly advertising, which appears on the user well as any NSF network drives to which the decentralized, creating a network of linked interface of the program and also causes pop- user has access, to be searchable and users.
    [Show full text]
  • File Formats
    man pages section 4: File Formats Sun Microsystems, Inc. 4150 Network Circle Santa Clara, CA 95054 U.S.A. Part No: 817–3945–10 September 2004 Copyright 2004 Sun Microsystems, Inc. 4150 Network Circle, Santa Clara, CA 95054 U.S.A. All rights reserved. This product or document is protected by copyright and distributed under licenses restricting its use, copying, distribution, and decompilation. No part of this product or document may be reproduced in any form by any means without prior written authorization of Sun and its licensors, if any. Third-party software, including font technology, is copyrighted and licensed from Sun suppliers. Parts of the product may be derived from Berkeley BSD systems, licensed from the University of California. UNIX is a registered trademark in the U.S. and other countries, exclusively licensed through X/Open Company, Ltd. Sun, Sun Microsystems, the Sun logo, docs.sun.com, AnswerBook, AnswerBook2, and Solaris are trademarks or registered trademarks of Sun Microsystems, Inc. in the U.S. and other countries. All SPARC trademarks are used under license and are trademarks or registered trademarks of SPARC International, Inc. in the U.S. and other countries. Products bearing SPARC trademarks are based upon an architecture developed by Sun Microsystems, Inc. The OPEN LOOK and Sun™ Graphical User Interface was developed by Sun Microsystems, Inc. for its users and licensees. Sun acknowledges the pioneering efforts of Xerox in researching and developing the concept of visual or graphical user interfaces for the computer industry. Sun holds a non-exclusive license from Xerox to the Xerox Graphical User Interface, which license also covers Sun’s licensees who implement OPEN LOOK GUIs and otherwise comply with Sun’s written license agreements.
    [Show full text]
  • IPFS and Friends: a Qualitative Comparison of Next Generation Peer-To-Peer Data Networks Erik Daniel and Florian Tschorsch
    1 IPFS and Friends: A Qualitative Comparison of Next Generation Peer-to-Peer Data Networks Erik Daniel and Florian Tschorsch Abstract—Decentralized, distributed storage offers a way to types of files [1]. Napster and Gnutella marked the beginning reduce the impact of data silos as often fostered by centralized and were followed by many other P2P networks focusing on cloud storage. While the intentions of this trend are not new, the specialized application areas or novel network structures. For topic gained traction due to technological advancements, most notably blockchain networks. As a consequence, we observe that example, Freenet [2] realizes anonymous storage and retrieval. a new generation of peer-to-peer data networks emerges. In this Chord [3], CAN [4], and Pastry [5] provide protocols to survey paper, we therefore provide a technical overview of the maintain a structured overlay network topology. In particular, next generation data networks. We use select data networks to BitTorrent [6] received a lot of attention from both users and introduce general concepts and to emphasize new developments. the research community. BitTorrent introduced an incentive Specifically, we provide a deeper outline of the Interplanetary File System and a general overview of Swarm, the Hypercore Pro- mechanism to achieve Pareto efficiency, trying to improve tocol, SAFE, Storj, and Arweave. We identify common building network utilization achieving a higher level of robustness. We blocks and provide a qualitative comparison. From the overview, consider networks such as Napster, Gnutella, Freenet, BitTor- we derive future challenges and research goals concerning data rent, and many more as first generation P2P data networks, networks.
    [Show full text]
  • Privacy Enhancing Technologies 2003 an Analysis of Gnunet And
    Privacy Enhancing Technologies 2003 An Analysis of GNUnet and the Implications for Anonymous, Censorship-Resistant Networks Dennis Kügler Federal Office for Information Security, Germany [email protected] 1 Anonymous, Censorship-Resistant Networks • Anonymous Peer-to-Peer Networks – Gnutella • Searching is relatively anonymous • Downloading is not anonymous • Censorship-Resistant Networks – Eternity Service • Distributed storage medium • Attack resistant • Anonymous, Censorship-Resistant Networks – Freenet – GNUnet 2 GNUnet: Obfuscated, Distributed Filesystem Content Hash Key: [H(B),H(E (B))] • H(B) – Content encryption: H(B) – Unambiguous filename: H(E (B)) H(B) • Content replication – Caching while delivering – Based on unambiguous filename • Searchability – Keywords 3 GNUnet: Peer-to-Peer MIX Network • Initiating node – Downloads content • Supplying nodes – Store content unencrypted • Intermediary nodes – Forward and cache encrypted content – Plausible deniability due to encryption • Economic model – Based on credit Query A Priority=20 B – Charge for queries c =c -20 B B - – Pay for responses 4 GNUnet Encoding • DBlocks DBlock DBlock ... DBlock – 1KB of the content – Content hash encrypted • IBlocks IBlock ... IBlock – CHKs of 25 DBlocks – Organized as tree – Content hash encrypted IBlock • RBlock – Description of the content – CHK of the root IBlock RBlock – Keyword encrypted 5 The Attacker Model • Attacker – Controls malicious nodes that behave correctly – Prepares dictionary of interesting keywords – Observes queries and
    [Show full text]
  • CS505: Distributed Systems
    Cristina Nita-Rotaru CS505: Distributed Systems Lookup services. Chord. CAN. Pastry. Kademlia. Required Reading } I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, H. Balakrishnan, Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications, SIGCOMM 2001. } A Scalable Content-Addressable Network S.a Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, SIGCOMM 2001 } A. Rowstron and P. Druschel. "Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems". IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 2001 } Kademlia: A Peer-to-peer Information System Based on the XOR Metric. P. Maymounkov and D. Mazieres, IPTPS '02 2 DHTs 1: Lookup services Peer-to-Peer (P2P) Systems } Applications that take advantage of resources (storage, cycles, content, human presence) available at the edges of the Internet. } Characteristics: } System consists of clients connected through Internet and acting as peers } System is designed to work in the presence of variable connectivity } Nodes at the edges of the network have significant autonomy; no centralized control } Nodes are symmetric in function 4 DHTs Benefits of P2P and Applications } High capacity: all clients provide resources (bandwidth, storage space, and computing power). The capacity of the system increases as more nodes become part of the system. } Increased reliability: achieved by replicating data over multiple peers, and by enabling peers to find the data without relying on a centralized index server. } Applications:
    [Show full text]
  • Practical Anonymous Networking?
    gap – practical anonymous networking? Krista Bennett Christian Grothoff S3 lab and CERIAS, Department of Computer Sciences, Purdue University [email protected], [email protected] http://www.gnu.org/software/GNUnet/ Abstract. This paper describes how anonymity is achieved in gnunet, a framework for anonymous distributed and secure networking. The main focus of this work is gap, a simple protocol for anonymous transfer of data which can achieve better anonymity guarantees than many traditional indirection schemes and is additionally more efficient. gap is based on a new perspective on how to achieve anonymity. Based on this new perspective it is possible to relax the requirements stated in traditional indirection schemes, allowing individual nodes to balance anonymity with efficiency according to their specific needs. 1 Introduction In this paper, we present the anonymity aspect of gnunet, a framework for secure peer-to-peer networking. The gnunet framework provides peer discovery, link encryption and message-batching. At present, gnunet’s primary application is anonymous file-sharing. The anonymous file-sharing application uses a content encoding scheme that breaks files into 1k blocks as described in [1]. The 1k blocks are transmitted using gnunet’s anonymity protocol, gap. This paper describes gap and how it attempts to achieve privacy and scalability in an environment with malicious peers and actively participating adversaries. The gnunet core API offers node discovery, authentication and encryption services. All communication between nodes in the network is confidential; no host outside the network can observe the actual contents of the data that flows through the network. Even the type of the data cannot be observed, as all packets are padded to have identical size.
    [Show full text]
  • Zeronet Presentation
    ZeroNet Decentralized web platform using Bitcoin cryptography and BitTorrent network. ABOUT ZERONET Why? Current features We believe in open, free, and ◦ Real-time updated sites uncensored network and communication. ◦ Namecoin .bit domain support ◦ No hosting costs ◦ Multi-user sites Sites are served by visitors. ◦ Password less, Bitcoin's BIP32- ◦ Impossible to shut down based authorization It's nowhere because it's ◦ Built-in SQL server with P2P data everywhere. synchronization ◦ No single point of failure ◦ Tor network support Site remains online so long as at least 1 peer serving it. ◦ Works in any browser/OS ◦ Fast and works offline You can access the site even if your internet is unavailable. HOW DOES IT WORK? THE BASICS OF ASYMMETRIC CRYPTOGRAPHY When you create a new site you get two keys: Private key Public key 5JNiiGspzqt8sC8FM54FMr53U9XvLVh8Waz6YYDK69gG6hso9xu 16YsjZK9nweXyy3vNQQPKT8tfjCNjEX9JM ◦ Only you have it ◦ This is your site address ◦ Allows you to sign new content for ◦ Using this anyone can verify if the your site. file is created by the site owner. ◦ No central registry ◦ Every downloaded file is verified, It never leaves your computer. makes it safe from malicious code inserts or any modifications. ◦ Impossible to modify your site without it. MORE INFO ABOUT CRYPTOGRAPHY OF ZERONET ◦ ZeroNet uses the same elliptic curve based encryption as in your Bitcoin wallet. ◦ You can accept payments directly to your site address. ◦ Using the current fastest supercomputer, it would take around 1 billion years to "hack" a private key. WHAT HAPPENS WHEN YOU VISIT A ZERONET SITE? WHAT HAPPENS WHEN YOU VISIT A ZERONET SITE? (1/2) 1 Gathering visitors IP addresses: Please send some IP addresses for site 1EU1tbG9oC1A8jz2ouVwGZyQ5asrNsE4Vr OK, Here are some: 12.34.56.78:13433, 42.42.42.42:13411, ..
    [Show full text]
  • CS 552 Peer 2 Peer Networking
    CS 552 Peer 2 Peer Networking R. Martin Credit slides from B. Richardson, I. Stoica, M. Cuenca Peer to Peer • Outline • Overview • Systems: – Gnutella – Freenet – Chord – PlanetP Why Study P2P • Huge fraction of traffic on networks today – >=50%! • Exciting new applications • Next level of resource sharing – Vs. timesharing, client-server, P2P – E.g. Access 10’s-100’s of TB at low cost. P2P usage • CMU network (external to world), 2003 • 47% of all traffic was easily classifiable as P2P • 18% of traffic was HTTP • Other traffic: 35% – Believe ~28% is port- hopping P2P • Other sites have a similar distribution Big Picture • Gnutella – Focus is simple sharing – Using simple flooding • Bit torrent – Designed for high bandwidth • PlanetP – Focus on search and retrieval – Creates global index on each node via controlled, randomized flooding • Cord – Focus on building a distributed hash table (DHT) – Finger tables Other P2P systems • Freenet: – Focus privacy and anonymity – Builds internal routing tables • KaaZa • eDonkey • Napster – Success started the whole craze Key issues for P2P systems • Join/leave – How do nodes join/leave? Who is allowed? • Search and retrieval – How to find content? – How are metadata indexes built, stored, distributed? • Content Distribution – Where is content stored? How is it downloaded and retrieved? Search and Retrieval • Basic strategies: – Flooding the query – Flooding the index – Routing the query • Different tradeoffs depending on application – Robustness, scalability, legal issues Flooding the Query (Gnutella) N3 Lookup(“title”) N1 N2 N4 N5 Key=title N8 N6 Value=mp3 N7 Pros: highly robust. Cons: Huge network traffic Flooding the Index (PlanetP) Key1=title1 N3 N1 Key2=title2 N2 N4 N5 Lookup(“title4”) Key1=title3 N8 N6 Key2=title4 N7 Pros: Robust.
    [Show full text]
  • ERDA User Guide
    User Guide 22. July 2021 1 / 116 Table of Contents Introduction..........................................................................................................................................3 Requirements and Terms of Use...........................................................................................................3 How to Access UCPH ERDA...............................................................................................................3 Sign-up.............................................................................................................................................4 Login................................................................................................................................................7 Overview..........................................................................................................................................7 Home................................................................................................................................................8 Files..................................................................................................................................................9 File Sharing and Data Exchange....................................................................................................15 Share Links...............................................................................................................................15 Workgroup Shared Folders.......................................................................................................19
    [Show full text]
  • Title: P2P Networks for Content Sharing
    Title: P2P Networks for Content Sharing Authors: Choon Hoong Ding, Sarana Nutanong, and Rajkumar Buyya Grid Computing and Distributed Systems Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Australia (chd, sarana, raj)@cs.mu.oz.au ABSTRACT Peer-to-peer (P2P) technologies have been widely used for content sharing, popularly called “file-swapping” networks. This chapter gives a broad overview of content sharing P2P technologies. It starts with the fundamental concept of P2P computing followed by the analysis of network topologies used in peer-to-peer systems. Next, three milestone peer-to-peer technologies: Napster, Gnutella, and Fasttrack are explored in details, and they are finally concluded with the comparison table in the last section. 1. INTRODUCTION Peer-to-peer (P2P) content sharing has been an astonishingly successful P2P application on the Internet. P2P has gained tremendous public attention from Napster, the system supporting music sharing on the Web. It is a new emerging, interesting research technology and a promising product base. Intel P2P working group gave the definition of P2P as "The sharing of computer resources and services by direct exchange between systems". This thus gives P2P systems two main key characteristics: • Scalability: there is no algorithmic, or technical limitation of the size of the system, e.g. the complexity of the system should be somewhat constant regardless of number of nodes in the system. • Reliability: The malfunction on any given node will not effect the whole system (or maybe even any other nodes). File sharing network like Gnutella is a good example of scalability and reliability.
    [Show full text]
  • Transferring Files Using HTTP Or HTTPS
    Transferring Files Using HTTP or HTTPS Cisco IOS Release 12.4 provides the ability to transfer files between your Cisco IOS software-based device and a remote HTTP server using the HTTP or HTTP Secure (HTTPS) protocol. HTTP and HTTPS can now be specified as the targets and source locations in Cisco IOS command-line interface (CLI) commands that use file system prefixes such as the copy command. • Finding Feature Information, page 1 • Prerequisites for Transferring Files Using HTTP or HTTPs, page 1 • Restrictions for Transferring Files Using HTTP or HTTPs, page 2 • Information About File Transfers Using HTTP or HTTPs, page 2 • How to Transfer Files Using HTTP or HTTPs, page 2 • Configuration Examples for the File Transfer Using HTTP or HTTPs, page 9 • Additional References, page 10 • Feature Information for Transferring Files Using HTTP or HTTPS, page 12 Finding Feature Information Your software release may not support all the features documented in this module. For the latest caveats and feature information, see Bug Search Tool and the release notes for your platform and software release. To find information about the features documented in this module, and to see a list of the releases in which each feature is supported, see the feature information table. Use Cisco Feature Navigator to find information about platform support and Cisco software image support. To access Cisco Feature Navigator, go to www.cisco.com/go/cfn. An account on Cisco.com is not required. Prerequisites for Transferring Files Using HTTP or HTTPs To copy files to or from a remote HTTP server, your system must support the HTTP client feature, which is integrated in most Cisco IOS software images.
    [Show full text]
  • El Gamal Mix-Nets and Implementation of a Verifier
    KTH Royal Institute of Technology School of Computer Science and Communication El Gamal Mix-Nets and Implementation of a Verifier SA104X Degree Project in Engineering Physics Erik Larsson ([email protected]) Carl Svensson ([email protected]) Supervisor: Douglas Wikstr¨om Abstract A mix-net is a cryptographic protocol based on public key cryptography which enables untraceable communication through a collection of nodes. One important application is electronic voting where it enables the construction of systems which satisfies many voting security requirements, including veri- fiability of correct execution. Verificatum is an implementation of a mix-net by Douglas Wikstr¨om. This report concerns the implementation of a verifier and evaluation of the implementation manual for the Verificatum mix-net. The purpose of the document is to enable third parties to convince themselves that the mix- net has behaved correctly without revealing any secret information. This implementation is a simple version of the verifier using the document and some test vectors generated by the mix-net. The document contains all information but there are still some possibilities for further clarification in order to make it comprehensible to a larger audience. Contents 1 Introduction 2 1.1 Verificatum . 2 1.2 Goals and Scope . 3 2 Background 3 2.1 El Gamal Cryptography . 3 2.1.1 Definition . 4 2.1.2 Security . 4 2.1.3 Properties . 5 2.2 Cryptographic Primitives . 6 2.2.1 Hash functions . 6 2.2.2 Pseudo Random Generators . 6 2.2.3 Random Oracles . 7 2.3 Mix Networks . 7 2.3.1 Overview . 7 2.3.2 El Gamal Mix-Nets .
    [Show full text]