DOCSLIB.ORG

Secure Message Transmission and Its Applications

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Secure Message Transmission and Its Applications Secure Message Transmission and its Applications Stelios Erotokritou A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy of University College London. Department of Computer Science University College London June 2016 2 Declaration I, Stelios Erotokritou hereby declare that the work presented in this dissertation submission entitled “Secure Message Transmission and its Applications” in partial fulfilment of the re- quirements for the degree of Doctor of Philosophy of University College London, to the best of my knowledge and belief, contains no material previously published or written by another person and is an authentic record and presentation of my own work during a period of seven and a half years from October 2007 to April 2015 under the supervision of Professor Yvo Desmedt, Department of Computer Science, University College London. Where information has been derived from other sources, I confirm that this has been indicated in the thesis. Abstract In this thesis we focus on various aspects of secure message transmission protocols. Such protocols achieve the secure transmission of a message from a sender to a receiver - where the term “secure” encapsulates the notion of privacy and reliability of message transmission. These two parties are connected using an underlying network in which a static computationally unlimited active adversary able to corrupt up to t network nodes is assumed to be present. Such protocols are important to study as they are used extensively in various cryptographic protocols and are of interest to other research areas such as ad-hoc networks, military networks amongst others. Optimal bounds for the number of phases (communication from sender to receiver or vice versa), connectivity requirements (number of node disjoint network paths connecting sender and receiver - denoted by n), communication complexity (complexity of the number of field elements sent - where F is the finite field used and jFj = q) and transmission complexity (pro- portion of communication complexity to complexity of secrets transmitted) for secure message transmission protocols have been proven in previous work. In the one-phase model it has been shown that n ≥ 3t+1 node disjoint paths are required to achieve perfect communication. In the two phase model only n ≥ 2t + 1 node disjoint paths are necessary. This connectivity is also the required bound for almost perfectly secure one-phase protocols - protocols which achieve perfect privacy but with a negligible probability may fail to achieve reliability. In such cases the receiver accepts a different message to that transmitted by the sender or does not accept any message. The main focus of recent research in secure message transmission protocols has been to present new protocols which achieve optimal transmission complexity. This has been achieved through the transmission of multiple messages. If a protocol has a communication complexity of O(n3) field elements, to achieve optimal transmission complexity O(n2) secrets will have to be communicated. This has somewhat ignored the simplification and improvement of pro- tocols which securely transmit a single secret. Such improvements include constructing more efficient protocols with regards to communication complexity, computational complexity and the number of field elements sent throughout the whole protocol. In the thesis we first consider one-phase almost perfectly secure message transmission and present two new protocols which improve on previous work. We present a polynomial time protocol of O(n2) communication complexity which at the time of writing this thesis, is computationally more efficient than any other protocol of similar communication complexity for the almost perfectly secure transmission of a single message. 4 Abstract Even though our first almost perfectly secure transmission protocol is of polynomial time, it is important to study other protocols also and improve previous work presented by other researchers. This is the idea behind the second one-phase almost perfectly secure message transmission protocol we present which requires an exponential complexity of field operations but lower (O(n)) communication complexity. This protocol also improves on previous proto- cols of similar communication complexity, requiring in the order of O(log q) less computation to complete - where q denotes the size of the finite field used. Even though this protocol is of exponential time, for small values of n (e.g. when t = 1, t = 2 or t = 3) it may be beneficial to use this protocol for almost perfectly secure communication as opposed to using the polynomial time protocol. This is because less field elements need to be transmitted over the whole net- work which connects a sender and a receiver. Furthermore, an optimal almost perfectly secure transmission protocol will be one with O(n) communication complexity and with polynomial computational complexity. We hope that in the future, other researchers will be inspired by our proposed protocol, improve on our work and ideally achieve these optimal results. We also consider multi-phase protocols. By combining various cryptographic schemes, we present a new two-phase perfectly secure single message transmission protocol. At the time of writing this thesis, the protocol is the most efficient protocol when considering communication complexity. Our protocol has a communication complexity of O(n2) compared to O(n3) of previous work thus improving on the communication complexity by an order of O(n) for the perfectly secure message transmission of a single message. This protocol is then extended to a three phase protocol where a multi-recipient broadcast end channel network setting is considered. As opposed to point to point networks where a path from a sender reaches a single receiver, this network model is new in the field of message trans- mission protocols. In this model each path from a sender reaches multiple receivers, with all receivers receiving the same information from their common network communication channel. We show how the use of this protocol upon such a network can lead to great savings in the transmission and computation carried out by a single sender. We also discuss the importance and relevance of such a multi-recipient setting to practical applications. The first protocols in the field of perfectly secure message transmission with a human re- ceiver are also presented. This is a topic proposed by my supervisor Professor Yvo Desmedt for which I constructed solutions. In such protocols, one of the communicating parties is considered to be a human who does not have access to a computational device. Because of this, solutions for such protocols need to be computationally efficient and computationally simple so that they can be executed by the human party. Experiments with human participants were carried out to assess how easily and accurately human parties used the proposed protocols. The experimental results are presented and these identify how well human participants used the protocols. In addition to the security of messages, we also consider how one can achieve anonymity of message transmission protocols. For such protocols, considering a single-receiver multi-sender scenario, the presence of a t-threshold bounded adversary and the transmission of multiple secrets (as many as the number of sender), once the protocols ends one should not be able to identify the sender of a received message. Considering a passive and active adversary new protocols are presented which achieve the secure and anonymous transmission of messages in Abstract 5 the information-theoretic security model. Our proposed solutions can also be applied (with minor alterations) to the dual problem when a single-sender multi-recipient communication setting is considered. The contributions of the thesis are primarily theoretical - thus no implementation of the proposed protocols was carried out. Despite this, we reflect on practical aspects of secure mes- sage transmission protocols. We review the feasibility of implementing secure message trans- mission protocols in general upon various networks - focusing on the Internet which can be considered as the most important communication network at this time. We also describe in the- ory how concepts of secure message transmission protocols could possibly be used in practical implementations for secure communication on various existing communication networks. Open problems that remain unsolved in the research area of the proposed protocols are also discussed and we hope that these inspire research and future solutions for the design (and implementation) of better and more efficient secure message transmission protocols. Acknowledgements Primarily I would like to thank my thesis advisor, Professor Yvo Desmedt. I am most grateful to him both on a personal and academic level. It has been an absolute pleasure for me to know him as a person, to have been his student and to learn from him. His work ethic, motivation, encouragement and demand for thoroughness has greatly im- proved me as a student and as a researcher. Through his teaching I have improved and developed essential skills required for a researcher to possess and I thank him for that. I would also like to thank him for his help during my work - helping me in the identification of errors and providing me with ideas and references to help me find better and correct solutions while at the same time helping me increase my knowledge and become more cautious with my work. Another person I would also like to thank is Dr. Paul Kearney who was my industrial contact with British Telecom (BT). He was always very helpful and was very active in the search for my primary field of research - both from a theoretical and practical viewpoint. He also helped me greatly with gaining access to various industrial contacts at BT labs - which aided me greatly with my work. I would also like to thank British Telecom which partly funded my PhD thesis and allowed me to use its resources during my research period. Special thanks must also be given to Theo Dimitrakos and Srijith Nair of BT labs with whom I worked with during my placement at BT.
Load more

Recommended publications
  • 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]
  • Multiparty Routing: Secure Routing for Mixnets
    Multiparty Routing: Secure Routing for Mixnets Fatemeh Shirazi Elena Andreeva Markulf Kohlweiss Claudia Diaz imec - COSIC KU Leuven imec - COSIC KU Leuven Microsoft Research imec - COSIC KU Leuven Leuven, Belgium Leuven, Belgium Cambridge, UK Leuven, Belgium Abstract—Anonymous communication networks are impor- re-mailer, Freenet [5], [6] used for anonymous file-sharing, and tant building blocks for online privacy protection. One approach DC-Nets [7] that can be deployed for broadcast applications to achieve anonymity is to relay messages through multiple such as group messaging. routers, where each router shuffles messages independently. To achieve anonymity, at least one router needs to be honest. The goal of ACNs is to anonymize communications by In the presence of an adversary that is controlling a subset relaying them over multiple routers. There are three main types of the routers unbiased routing is important for guaranteeing of anonymous routing in terms of how routers are chosen to anonymity. However, the routing strategy also influenced other form the path. factors such as the scalability and the performance of the system. One solution is to use a fixed route for relaying all messages First, in deterministic routing, the paths are predetermined with many routers. If the route is not fixed the routing decision by the system configuration. Chaum’s original ACN pro- can either be made by the communication initiator or the posal [1] considered a sequence of mixes organized in a intermediate routers. However, the existing routing types each cascade. Systems that adopted the cascade network topology have limitations. For example, one faces scalability issues when in their designs include JAP [8], and voting systems, such as increasing the throughput of systems with fixed routes.
    [Show full text]
  • Walking Onions: Scaling Anonymity Networks While Protecting Users Chelsea H
    Walking Onions: Scaling Anonymity Networks while Protecting Users Chelsea H. Komlo, University of Waterloo; Nick Mathewson, The Tor Project; Ian Goldberg, University of Waterloo https://www.usenix.org/conference/usenixsecurity20/presentation/komlo This paper is included in the Proceedings of the 29th USENIX Security Symposium. August 12–14, 2020 978-1-939133-17-5 Open access to the Proceedings of the 29th USENIX Security Symposium is sponsored by USENIX. Walking Onions: Scaling Anonymity Networks while Protecting Users Chelsea H. Komlo Nick Mathewson Ian Goldberg University of Waterloo The Tor Project University of Waterloo Abstract Anonymity networks in practice [13] have prevented these Scaling anonymity networks offers unique security chal- attacks by requiring all participants to share a globally consis- lenges, as attackers can exploit differing views of the net- tent view of the entire state of the network, and giving clients work’s topology to perform epistemic and route capture at- complete control over selecting relays for their paths. While tacks. Anonymity networks in practice, such as Tor, have this approach prevents the described attacks, requiring a glob- opted for security over scalability by requiring participants ally consistent view results in quadratic bandwidth growth as to share a globally consistent view of all relays to prevent the number of clients increases [26], because the number of these kinds of attacks. Such an approach requires each user relays must also increase to provide more capacity, and all to maintain up-to-date information about every relay, causing parties must download information about all relays. While the total amount of data each user must download every epoch today’s Tor network requires only approximately half a per- to scale linearly with the number of relays.
    [Show full text]
  • Network Security
    Cristina Nita-Rotaru CS6740: Network security Anonymity. Sources 1. Crowds: http://avirubin.com/crowds.pdf 2. Chaum mix: http://www.ovmj.org/GNUnet/papers/p84-chaum.pdf 3. To r : https://svn.torproject.org/svn/projects/design-paper/tor-design.pdf 4. Predecessors attack: http://prisms.cs.umass.edu/brian/pubs/wright-tissec.pdf 5. Also based on slides prepared by Chi-Cun Chan. 2 Anonymity systems. 1: Motivation Anonymity Anonymity (``without name’’) means that a person is not identifiable within a set of subjects } Unlinkability of action and identity } For example, sender and his email are no more related after adversary’s observations than they were before } Who talks to whom } Unobservability } Adversary cannot tell whether someone is using a particular system and/or protocol 4 Anonymity systems. There is no anonymity on the Internet } Your IP address can be linked directly to you } ISPs store communications records } Usually for several years (Data Retention Laws) } Law enforcement can subpoena these records } Your browser is being tracked } Cookies, Flash cookies, E-Tags, HTML5 Storage } Browser fingerprinting } Your activities can be used to identify you } Unique websites and apps that you use } Types of links that you click 5 Anonymity systems. Wiretapping is ubiquitous } Wireless traffic can be trivially intercepted } Airsnort, Firesheep, etc. } Wifi and Cellular traffic! } Encryption helps, if it’s strong } WEP and WPA are both vulnerable! } Tier 1 ASs and IXPs are compromised } NSA, GCHQ, “5 Eyes” } ~1% of all Internet traffic } Focus on encrypted traffic 6 Anonymity systems. Who uses anonymity systems? } “If you’re not doing anything wrong, you shouldn’t have anything to hide.” } Implies that anonymous communication is for criminals } The truth: who uses Tor? } Journalists } Law enforcement ¤ Business executives } Human rights activists ¤ Military/intelligence personnel } Normal people ¤ Abuse victims } In fact, the predecesor of Tor was developed by the U.S.
    [Show full text]
  • A System for Privacy-Preserving Mobile Health and Fitness Data Sharing: Design, Implemen- Tation and Evaluation Master Thesis SEEMOO-MSC-0076
    A SYSTEM FOR PRIVACY-PRESERVING MOBILE HEALTH AND FITNESSDATASHARING:DESIGN,IMPLEMENTATIONAND E VA L U AT I O N max jakob maaß Master Thesis April 15, 2016 Secure Mobile Networking Lab Department of Computer Science A System for Privacy-Preserving Mobile Health and Fitness Data Sharing: Design, Implemen- tation and Evaluation Master Thesis SEEMOO-MSC-0076 Submitted by Max Jakob Maaß Date of submission: April 15, 2016 Advisor: Prof. Dr.-Ing. Matthias Hollick Supervisor: Prof. Dr.-Ing. Matthias Hollick Technische Universität Darmstadt Department of Computer Science Secure Mobile Networking Lab ABSTRACT The growing spread of smartphones and other mobile devices has given rise to a number of health and fitness applications. Users can track their calorie intake, get reminders to take their medication, and track their fitness workouts. Many of these services have social com- ponents, allowing users to find like-minded peers, compete with their friends, or participate in open challenges. However, the prevalent ser- vice model forces users to disclose all of their data to the service provider. This may include sensitive information, like their current position or medical conditions. In this thesis, we will design, imple- ment and evaluate a privacy-preserving fitness data sharing system. The system provides privacy not only towards other users, but also against the service provider, does not require any Trusted Third Par- ties (TTPs), and is backed by strong cryptography. Additionally, it hides the communication metadata (i.e. who is sharing data with whom). We evaluate the security of the system with empirical and formal methods, including formal proofs for parts of the system.
    [Show full text]
  • DSMIX: a Dynamic Self-Organizing Mix Anonymous System Renpeng Zou∗, Xixiang Lv∗, ∗School of Cyber Engineering, Xidian University, Xian 710071, China
    1 DSMIX: A Dynamic Self-organizing Mix Anonymous System Renpeng Zou∗, Xixiang Lv∗, ∗School of Cyber Engineering, Xidian University, Xian 710071, China Abstract—Increasing awareness of privacy-preserving has led There are, however, concerns about the lack of efficiency to a strong focus on anonymous systems protecting anonymity. and security in anonymous systems [6], [7], as explained By studying early schemes, we summarize some intractable below: problems of anonymous systems. Centralization setting is a universal problem since most anonymous system rely on central proxies or presetting nodes to forward and mix messages, which • Centralization. Most of anonymous systems, i.e. compromises users’ privacy in some way. Besides, availability Anonymizer [8], LPWA [9] and cMix [10], rely on central becomes another important factor limiting the development of proxies or preset nodes to hide the address information, anonymous system due to the large requirement of additional ad- then still use these proxies to blind and forward messages. ditional resources (i.e. bandwidth and storage) and high latency. Moreover, existing anonymous systems may suffer from different The centralized anonymous systems bring privacy leakage attacks including abominable Man-in-the-Middle (MitM) attacks, risks to users since the service providers can control Distributed Denial-of-service (DDoS) attacks and so on. In this all proxies and mix node to infer the users’ identities. context, we first come up with a BlockChain-based Mix-Net What’s worse, the public proxies or preset nodes are (BCMN) protocol and theoretically demonstrate its security and easily exposed to attackers. For instance, an attacker can anonymity. Then we construct a concrete dynamic self-organizing BlockChain-based MIX anonymous system (BCMIX).
    [Show full text]
  • 2014 Bis 2015
    Tätigkeitsbericht 2014/2015 Horst Görtz Institut für IT-Sicherheit Vorwort Sehr geehrte Damen und Herren, liebe Freunde des Horst Görtz Instituts, das HGI steht für Exzellenz in For- senschaftler im Berichtszeitraum aus- schung, Lehre und Nachwuchsförderung. gezeichnet wurden, den Erfolg und die In dieser Ausgabe möchten wir Ihnen – internationale Sichtbarkeit des Instituts zusätzlich zu den Einblicken in unsere veranschaulichen. Forschungsvorhaben, die Sie in der Son- derausgabe 2016 von RUBIN nachlesen Nicht zuletzt blicken wir auf unsere vier können – einige Statistiken zu unserer jüngsten Firmenausgründungen, die Forschung und Ausbildung in der IT-Si- das im Studium erworbene theoretische cherheit aus den Jahren 2014 und 2015 Wissen erfolgreich in eigene Geschäftsi- angeben. deen umgewandelt haben und florieren- de junge Start-ups erschaffen haben. In diesen beiden überaus eindrucksvollen Jahren haben insgesamt 210 Absolven- tinnen und Absolventen erfolgreich ein Studium der IT-Sicherheit an der Wir wünschen Ihnen und Euch viel Spaß Ruhr-Universität Bochum beendet, davon beim Lesen. 123 Bachelor- und 87 Masterabschlüsse. Hinzu kommen 15 Promotionen aus den verschiedensten Bereichen der IT-Sich- erheit. Ihr Wir blicken auf insgesamt 210 wis- senschaftliche Veröffentlichungen auf renommierten internationalen Kon- Prof. Christof Paar ferenzen und in Zeitschriften zurück, die ebenso wie die 11 Preise, mit denen Geschäftsführender Direktor des unsere Wissenschaftlerinnen und Wis- Horst Görtz Instituts Vorwort 3 Abschlussarbeiten Bachelor
    [Show full text]
  • Anonymous Network Concepts & Implementation
    FORENSIC INSIGHT; DIGITAL FORENSICS COMMUNITY IN KOREA Anonymous Network Concepts & Implementation [email protected] Overview 1. Overview & Background 2. Anonymous Network tor freenet Gnunet I2P 3. Circumvention Techniques against Censorships Obfsproxy flashproxy forensicinsight.org Page 2 Overview . Attack Trends Summary Modern attack mostly involves malware, which Attempts to conceal attack itself Makes it hard to trace themselves down from network perspective Makes it difficult to find artifacts by wiping out themselves from system perspective Employs many techniques to be hard for analysis including: Anti-VM, Anti-disassembly, Anti-debugging and cryptography Infects a target but do nothing harm until they achieve their goals Imagine how future malware will evolve, which Employs the combination of existing – even legitimate – tools/techniques in a malicious fashion Emerges new variables targeting cloud computing Focuses highly on target-oriented attack which does not affect others Uses steganography technique in a wild more often Forms private tor network with exploited zombie machines forensicinsight.org Page 3 Overview . Malware/Crimeware Let’s briefly take a look at what to have, how to spread and what to do. Key Loggers Attachment Information Compromise Screenscrapers Peer-to-Peer Networks Spam Transmission Email, IM Redirectors Piggybacking Denial-of-Service, DDoS Session Hijackers Internet Worms, Virus Click Fraud Web Trojans Web Browser Exploits Data Ransoming Transaction Generators Server Compromise Identity Stealing Data Theft Affiliate Marketing Credit Card Abuse Man-in-the-Middle Phishing Defamation Rootkits Pharming Embezzlement Political Argument Misuse Distribution Features forensicinsight.org Page 4 Background . Necessity / Motivation (1/2) “Anonymity serves different interests for different user groups.” by Roger Dingledine, the creator of the Tor forensicinsight.org Page 5 Background .
    [Show full text]
  • Vtalk: Secure Deployment of Voip Over LAN's
    IOSR Journal of Computer Engineering (IOSR-JCE) e-ISSN: 2278-0661, p- ISSN: 2278-8727Volume 16, Issue 1, Ver. VI (Feb. 2014), PP 26-28 www.iosrjournals.org Vtalk: Secure Deployment of VoIP over LAN’S Ms.Sassirekha.S.M1, Ms. J.R.Thresphine2 1(Student, Department of CSE, PRIST University, Tamil Nadu) 2(Assistant Professor, Department of CSE, PRIST University, Tamil Nadu) ABSTRACT: Peer-to-peer VoIP (voice over IP) networks, exemplified by Skype, are becoming increasingly popular due to their significant cost advantage and richer call forwarding features than traditional public switched telephone networks. One of the most important features of a VoIP network is privacy (for VoIP clients). Unfortunately, most peer-to-peer VoIP networks neither provide personalization nor guarantee a quantifiable privacy level. In this paper, we propose novel flow analysis attacks that demonstrate the vulnerabilities of peer-to-peer VoIP networks to privacy attacks. We then address two important challenges in designing privacy-aware VoIP networks: Can we provide personalized privacy guarantees for VoIP clients that allow them to select privacy requirements on a per-call basis? How to design VoIP protocols to support customizable privacy guarantee? This paper proposes practical solutions to address these challenges using a quantifiable k-anonymity metric and a privacy-aware VoIP route setup and route maintenance protocols. We present detailed experimental evaluation that demonstrates the performance and scalability of our protocol, while meeting customizable privacy guarantees. IndexTerms: VOIP,SSH,QOS,ITU,RSP,AARSP,FCC,PSTN I. INTRODUCTION Peer-to-peer ("P2P") technology became widely deployed and popularized by file-sharing applications such as Napster and Kazaa.
    [Show full text]
  • Public-Key Cryptography Theory and Practice
    Public-Key Cryptography Theory and Practice Vom Fachbereich Informatik der Technischen Universit¨atDarmstadt genehmigte Dissertation zur Erreichung des akademischen Grades Doctor rerum naturalium (Dr. rer. nat.) von Dipl.-Inform. Bodo M¨oller aus Hamburg Referenten: Prof. Dr. Johannes Buchmann (TU Darmstadt) Prof. Dr. Christof Paar (Ruhr-Universit¨atBochum) Tag der Einreichung: 1. Juli 2003 Tag der m¨undlichen Pr¨ufung: 16. September 2003 Darmstadt, 2003 Hochschulkennziffer: D 17 Viele haben auf die eine oder andere Weise dazu beigetragen, dass diese Dissertation so entstehen konnte, wie sie nun vorliegt. Der Versuch einer vollst¨andigenAufz¨ahlungm¨usstescheitern; hier seien zun¨achst die erw¨ahnt, die nicht mit Namen genannt werden k¨onnen,weil sie als anonyme Gutachter f¨urKonferenzen t¨atigwaren und dabei Anregungen zur Darstellung einiger der hier pr¨asentierten Ergebnisse beigetragen haben. Außerdem zu nennen ist David Hopwood, der in einer fr¨uherenFassung der Ausf¨uhrungenzur beweisbaren Sicherheit des Mix-Verfahrens (hier in Abschnitt 4.2) eine L¨ucke aufgesp¨urthat. Prof. Johannes Buchmann hat es auf bemerkenswerte Weise verstanden, die Arbeits- bedingungen zu schaffen, in denen diese Dissertation gedeihen konnte, und hat wertvolle Anregungen geliefert. Auch alle anderen am Fachgebiet Theoretische Informatik hatten teil daran, eine angenehme und fruchtbare Arbeitsatmosph¨arezu schaffen. Danke! Darmstadt, im September 2003 B. M. 3 Abstract Part I: Theory Provable security is an important goal in the design of public-key cryptosystems. For most security properties, it is computational security that has to be considered: an attack scenario describes how adversaries interact with the cryptosystem, trying to attack it; the system can be called secure if adversaries with reasonably bounded computational means have negligible prospects of success.
    [Show full text]
  • Improving the Sphinx Mix Network
    Improving the Sphinx Mix Network Filipe Beato1, Kimmo Halunen2, and Bart Mennink1 1 Dept. Electrical Engineering, ESAT/COSIC, KU Leuven, and iMinds, Belgium ffilipe.beato,[email protected] 2 VTT Technical Research Center of Finland, Oulu, Finland Abstract. Secure mix networks consider the presence of multiple nodes that relay encrypted messages from one node to another in such a way that anonymous communication can be achieved. We consider the Sphinx mix formatting protocol by Danezis and Goldberg (IEEE Security and Privacy 2009), and analyze its use of symmetric-key cryptographic prim- itives. We scrutinize the reliance on multiple distinct primitives, as well as the use of the ancient LIONESS cipher, and suggest various paths towards improving the security and efficiency of the protocol. Keywords: Sphinx; mix network; authenticated encryption; sponge 1 Introduction With the large growth of Internet services, modern users rely more on digital and ubiquitous communications. In this digital domain, privacy needs to be protected against the very nature of the communications, which tend to be easily traceable and produce massive amounts of metadata. Hiding the metadata of communications is hard, but there are systems, called mix networks, that provide such capabilities. One example is the Sphinx [15] mix network, that is used in privacy protecting applications. The Sphinx mix network format provides security against powerful adversaries and good communications possibilities such as replies, which are not easily available in other such systems. The Sphinx protocol (see Section 2) uses internally many symmetric-key primitives. At first, there is the SHA-2 hash function for hashing.
    [Show full text]
  • Lecture Notes in Computer Science 4856 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan Van Leeuwen
    Lecture Notes in Computer Science 4856 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Moshe Y. Vardi Rice University, Houston, TX, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany Feng Bao San Ling Tatsuaki Okamoto Huaxiong Wang Chaoping Xing (Eds.) Cryptology and Network Security 6th International Conference, CANS 2007 Singapore, December 8-10, 2007 Proceedings 13 Volume Editors Feng Bao Institute for Infocomm Research Singapore E-mail: [email protected] San Ling Nanyang Technological University Singapore E-mail: [email protected] Tatsuaki Okamoto NTT Laboratories Japan E-mail: [email protected] Huaxiong Wang Nanyang Technological University Singapore E-mail: [email protected] Chaoping Xing Nanyang Technological University Singapore E-mail: [email protected] Library of Congress Control Number: 2007939802 CR Subject Classification (1998): E.3, D.4.6, F.2.1, C.2, J.1, K.4.4, K.6.5 LNCS Sublibrary: SL 4 – Security and Cryptology ISSN 0302-9743 ISBN-10 3-540-76968-4 Springer Berlin Heidelberg New York ISBN-13 978-3-540-76968-2 Springer Berlin Heidelberg New York This work is subject to copyright.
    [Show full text]