# Using Adversary Structures to Analyze Network Models,

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 MTAT Graduate seminar in cryptography Using Adversary Structures to Analyze Network Models University of Tartu 1

2 Outline of the talk Problems in distributed systems Adversary Structure - definition Communication and Connectivity Secure Message Transfer 2

3 Problems and results Byzantine Generals Problem Byzantine faults Communication networks Goal of the research Some results 3

4 The network model We will define: the adversary structure and it s properties the communication network message transmission protocols special connectivity properties secure message transmissions 4

5 Adversary types There are two types of adversaries: passive and active. A passive adversary reads all the traffic going through corrupted parties An active adversary is computationally unbounded and can both control and read the traffic going through the corrupted parties. Both types have complete knowledge of the protocol, the message space and structure of the network. The described model considers only static adversaries i.e. ones, who select the set of parties to corrupt before the start of the protocol. 5

6 Adversary structure - definition Let P be the set of parties in the network. Let Γ P be a subset of the power set of P. We call such a Γ P 2 P an access structure on P. An access structure is monotone if and only if / Γ P and A if A Γ P, A A P then A Γ P. We call Z 2 P an adversary structure, if Z c = 2 P \Z is a monotone access structure. 6

7 Adversary structure - combining them If Z 1 and Z 2 are adversary structures, then Z 1 + Z 2 = {Z 1 Z 2 : Z 1 Z 1, Z 2 Z 2 } is also an adversary structure. We define 2Z = Z + Z and 3Z = Z + Z + Z. 7

8 The communication network The communication network is modelled by using a directed graph G = G(V, E). Each node v G is a communication party. Each edge (u, v) E is a point-to-point private reliable communication channel between the two parties. 8

9 Message Transmission Protocols Let π be a message transmission protocol, let A be the sender and B the receiver (A, B P ). Let Z be an adversary structure. The sender A selects a M A drawn from a message space M with a certain probability distribution. At the beginning of the protocol the adversary randomly chooses a subset of Z (determines, which nodes to corrupt). At the end of the protocol π the receiver B outputs a message M B M. For any message transmission protocol adv(m, r) is the view when M A = M and r is the sequence of coin flips used by the adversary. 9

10 Reliability and privacy Definition 1: Let π be a transmission protocol. Let M A be the message selected by A and M B the message output by B. Let Z be an adversary structure. 1. We say that π is Z-reliable, if B outputs M B = M A with probability 1 (taken over the choices of M A and the coin flips of all parties). 2. We say that π is perfectly Z-private if for any two messages M 0, M 1 and for any coin tosses r, we have Pr[adv(M 0, r) = c] = Pr[adv(M 1, r) = c]. The probabilities is taken over the coin flips of the honest parties). 3. π is perfectly Z-secure if it is Z-reliable and perfectly Z-private. 10

11 Separability of nodes Definition 2: Let G(V,E) be a directed graph, A, B be nodes in G(V,E) and Z be an adversary structure on V \{A, B}. A and B are Z-separable in G, if there is a set Z Z such that all paths from A to B go through at least one node in Z. We say that Z separates A and B. A, B are (Z + 1)-connected if they are not Z-separable in G. Note, that if (A, B) E then A, B are (Z + 1) connected for any Z on V \{A, B}. 11

12 Connectivity - results Theorem 1: Let G = G(V,E) be a directed graph. Let A, B be nodes in G and Z 1, Z 2 be adversary structures on V \{A, B}. Then A, B are (Z 1 + Z 2 + 1) connected if, and only if: for all sets Z 1 Z 1 there is a set S Z1 of paths between A and B such that, the paths in S Z1 are free from nodes of Z 1, for every Z 2 Z 2 there is at least one path in S Z1 that is free from nodes of Z 2. 12

13 Secure Message Transmissions - results The following results set constraints needed for secure message transmissions in the given network. Theorem 2: Let G = G(V,E) be a directed graph. Let A, B be nodes in G and Z be an adversary structure on V \{A, B}. We suppose, that the adversary is passive. 1. We have polynomial time (with regard to graph size) Z-reliable message transmission from A to B if, and only if, A, B are ({ } + 1)- connected in G. 2. We have polynomial time (with regard to graph size) perfectly Z- secure message transmissions from A to B if and only if, A, B, are (Z + 1)-connected in G. 13

14 Secure Message Transmissions - results (cont.) Theorem 3: Let G = G(V,E) be a directed graph. Let A, B be nodes in G and Z be an adversary structure on V \{A, B}. We have Z-reliable message transmission from A to B if, and only if, A, B, are (2Z + 1)-connected in G. Theorem 4: Let G = G(V,E) be a directed graph. Let A, B be nodes in G and Z be an adversary structure on V \{A, B}. If there are no directed paths from B to A, then we have perfectly Z-secure message transmission from A to B if and only if, A and B are (3Z + 1)-connected in G. 14

15 To be continued... Next time: 1. More results about the given model. 2. Possibly other models or approaches. See you then! 15

16 End of talk Thanks for listening! 16

Efficient General-Adversary Multi-Party Computation Martin Hirt, Daniel Tschudi ETH Zurich {hirt,tschudid}@inf.ethz.ch Abstract. Secure multi-party computation (MPC) allows a set P of n players to evaluate

### An Overview of Common Adversary Models

An Overview of Common Adversary Karl Palmskog palmskog@kth.se 2012-03-29 Introduction Requirements of Software Systems 1 Functional Correctness: partial, termination, liveness, safety,... 2 Nonfunctional

### Secret Sharing and Reliable Cloud Computing

Secret Sharing and Reliable Cloud Computing Yvo Desmedt University College London, UK November, 2011 Yvo c Desmedt OVERVIEW 1. Clouds: examples of deployment 2. Clouds: a security nightmare? 3. Secret

### 3/25/2014. 3/25/2014 Sensor Network Security (Simon S. Lam) 1

Sensor Network Security 3/25/2014 Sensor Network Security (Simon S. Lam) 1 1 References R. Blom, An optimal class of symmetric key generation systems, Advances in Cryptology: Proceedings of EUROCRYPT 84,

### Minimum Spanning Trees

Minimum Spanning Trees Algorithms and 18.304 Presentation Outline 1 Graph Terminology Minimum Spanning Trees 2 3 Outline Graph Terminology Minimum Spanning Trees 1 Graph Terminology Minimum Spanning Trees

MACs Message authentication and integrity Foundations of Cryptography Computer Science Department Wellesley College Table of contents Introduction MACs Constructing Secure MACs Secure communication and

### 5.1 Bipartite Matching

CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson

### NP-complete? NP-hard? Some Foundations of Complexity. Prof. Sven Hartmann Clausthal University of Technology Department of Informatics

NP-complete? NP-hard? Some Foundations of Complexity Prof. Sven Hartmann Clausthal University of Technology Department of Informatics Tractability of Problems Some problems are undecidable: no computer

### Network Coding With Wireless Applications

Department of Electrical Engineering Information Systems Laboratory Stanford University Motivation Outline Network coding is a theory for communicating information across networks more efficiently. Although

### Introduction to Algorithms. Part 3: P, NP Hard Problems

Introduction to Algorithms Part 3: P, NP Hard Problems 1) Polynomial Time: P and NP 2) NP-Completeness 3) Dealing with Hard Problems 4) Lower Bounds 5) Books c Wayne Goddard, Clemson University, 2004 Chapter

### Lecture 5 - CPA security, Pseudorandom functions

Lecture 5 - CPA security, Pseudorandom functions Boaz Barak October 2, 2007 Reading Pages 82 93 and 221 225 of KL (sections 3.5, 3.6.1, 3.6.2 and 6.5). See also Goldreich (Vol I) for proof of PRF construction.

### Topology-based network security

Topology-based network security Tiit Pikma Supervised by Vitaly Skachek Research Seminar in Cryptography University of Tartu, Spring 2013 1 Introduction In both wired and wireless networks, there is the

### Simulation-Based Security with Inexhaustible Interactive Turing Machines

Simulation-Based Security with Inexhaustible Interactive Turing Machines Ralf Küsters Institut für Informatik Christian-Albrechts-Universität zu Kiel 24098 Kiel, Germany kuesters@ti.informatik.uni-kiel.de

### ECE 333: Introduction to Communication Networks Fall 2002

ECE 333: Introduction to Communication Networks Fall 2002 Lecture 14: Medium Access Control II Dynamic Channel Allocation Pure Aloha In the last lecture we began discussing medium access control protocols

### Attacks on neighbor discovery

Cryptographic Protocols (EIT ICT MSc) Dr. Levente Buttyán associate professor BME Hálózati Rendszerek és Szolgáltatások Tanszék Lab of Cryptography and System Security (CrySyS) buttyan@hit.bme.hu, buttyan@crysys.hu

### MPC vs. SFE : Unconditional and Computational Security

MPC vs. SFE : Unconditional and Computational Security Martin Hirt, Ueli Maurer, and Vassilis Zikas Department of Computer Science, ETH Zurich, 8092 Zurich, Switzerland {hirt,maurer,vzikas}@inf.ethz.ch

### CPSC 467b: Cryptography and Computer Security

CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 1 January 9, 2012 CPSC 467b, Lecture 1 1/22 Course Overview Symmetric Cryptography CPSC 467b, Lecture 1 2/22 Course Overview CPSC

### Secure Computation Without Authentication

Secure Computation Without Authentication Boaz Barak 1, Ran Canetti 2, Yehuda Lindell 3, Rafael Pass 4, and Tal Rabin 2 1 IAS. E:mail: boaz@ias.edu 2 IBM Research. E-mail: {canetti,talr}@watson.ibm.com

### Opt p ic i al a l Netw t or o k r s k Bas a ic i Concepts (Part 1)

Optical Networks Basic Concepts (Part 1) Introduction What is an optical network? Optical devices and components Basic concepts in optical networking Optimization of optical network design How to handle

### Security Aspects of. Database Outsourcing. Vahid Khodabakhshi Hadi Halvachi. Dec, 2012

Security Aspects of Database Outsourcing Dec, 2012 Vahid Khodabakhshi Hadi Halvachi Security Aspects of Database Outsourcing Security Aspects of Database Outsourcing 2 Outline Introduction to Database

### 1 Message Authentication

Theoretical Foundations of Cryptography Lecture Georgia Tech, Spring 200 Message Authentication Message Authentication Instructor: Chris Peikert Scribe: Daniel Dadush We start with some simple questions

### Network Algorithms for Homeland Security

Network Algorithms for Homeland Security Mark Goldberg and Malik Magdon-Ismail Rensselaer Polytechnic Institute September 27, 2004. Collaborators J. Baumes, M. Krishmamoorthy, N. Preston, W. Wallace. Partially

### Denial of Service in Sensor Networks

Denial of Service in Sensor Networks Authors : From: Anthony D. Wood John A. Stankovic University of Virginia Presented by: Luba Sakharuk Agenda for the DOS in Sensor Networks Abstract Theory and Application

### Oblivious Transfer. Sven Laur University of Tartu

Oblivious Transfer Sven Laur swen@math.ut.ee University of Tartu Ideal implementation b x 0, x 1 b x 0, x 1 x b Ideal ( 2 1) -OT The protocol is always carried out between a client P 1 and a sender P 2.

### Security for Ubiquitous and Adhoc Networks

Security for Ubiquitous and Adhoc Networks Mobile Adhoc Networks Collection of nodes that do not rely on a predefined infrastructure Adhoc networks can be formed merged together partitioned to separate

### CHAPTER 6 SECURE PACKET TRANSMISSION IN WIRELESS SENSOR NETWORKS USING DYNAMIC ROUTING TECHNIQUES

CHAPTER 6 SECURE PACKET TRANSMISSION IN WIRELESS SENSOR NETWORKS USING DYNAMIC ROUTING TECHNIQUES 6.1 Introduction The process of dispersive routing provides the required distribution of packets rather

### Communication Networks. MAP-TELE 2011/12 José Ruela

Communication Networks MAP-TELE 2011/12 José Ruela Network basic mechanisms Introduction to Communications Networks Communications networks Communications networks are used to transport information (data)

### Complexity Theory. IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar

Complexity Theory IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar Outline Goals Computation of Problems Concepts and Definitions Complexity Classes and Problems Polynomial Time Reductions Examples

### Near Optimal Solutions

Near Optimal Solutions Many important optimization problems are lacking efficient solutions. NP-Complete problems unlikely to have polynomial time solutions. Good heuristics important for such problems.

### Lecture 2: Complexity Theory Review and Interactive Proofs

600.641 Special Topics in Theoretical Cryptography January 23, 2007 Lecture 2: Complexity Theory Review and Interactive Proofs Instructor: Susan Hohenberger Scribe: Karyn Benson 1 Introduction to Cryptography

### Chapter 9: Transport Layer and Security Protocols for Ad Hoc Wireless Networks

Chapter 9: Transport Layer and Security Protocols for Ad Hoc Wireless Networks Introduction Issues Design Goals Classifications TCP Over Ad Hoc Wireless Networks Other Transport Layer Protocols Security

### Voice over IP. Demonstration 1: VoIP Protocols. Network Environment

Voice over IP Demonstration 1: VoIP Protocols Network Environment We use two Windows workstations from the production network, both with OpenPhone application (figure 1). The OpenH.323 project has developed

### Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits

Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique

### Lecture 2.1 : The Distributed Bellman-Ford Algorithm. Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol

Lecture 2 : The DSDV Protocol Lecture 2.1 : The Distributed Bellman-Ford Algorithm Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol The Routing Problem S S D D The routing problem

### Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n 2 ) Messages, and O(1) Expected Time

Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n 2 ) Messages, and O(1) Expected Time Achour Mostéfaoui Hamouma Moumen Michel Raynal, LINA, Université de Nantes, 44322 Nantes Cedex,

### Mixed-Criticality Systems Based on Time- Triggered Ethernet with Multiple Ring Topologies. University of Siegen Mohammed Abuteir, Roman Obermaisser

Mixed-Criticality s Based on Time- Triggered Ethernet with Multiple Ring Topologies University of Siegen Mohammed Abuteir, Roman Obermaisser Mixed-Criticality s Need for mixed-criticality systems due to

### This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination.

IEEE/ACM TRANSACTIONS ON NETWORKING 1 A Greedy Link Scheduler for Wireless Networks With Gaussian Multiple-Access and Broadcast Channels Arun Sridharan, Student Member, IEEE, C Emre Koksal, Member, IEEE,

### A Catechistic Method for Traffic Pattern Discovery in MANET

A Catechistic Method for Traffic Pattern Discovery in MANET R. Saranya 1, R. Santhosh 2 1 PG Scholar, Computer Science and Engineering, Karpagam University, Coimbatore. 2 Assistant Professor, Computer

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

### Computational complexity theory

Computational complexity theory Goal: A general theory of the resources needed to solve computational problems What types of resources? Time What types of computational problems? decision problem Decision

### SECURITY ASPECTS IN MOBILE AD HOC NETWORK (MANETS)

SECURITY ASPECTS IN MOBILE AD HOC NETWORK (MANETS) Neha Maurya, ASM S IBMR ABSTRACT: Mobile Ad hoc networks (MANETs) are a new paradigm of wireless network, offering unrestricted mobility without any underlying

### First Semester Examinations 2011/12 INTERNET PRINCIPLES

PAPER CODE NO. EXAMINER : Martin Gairing COMP211 DEPARTMENT : Computer Science Tel. No. 0151 795 4264 First Semester Examinations 2011/12 INTERNET PRINCIPLES TIME ALLOWED : Two Hours INSTRUCTIONS TO CANDIDATES

### ECEN 5682 Theory and Practice of Error Control Codes

ECEN 5682 Theory and Practice of Error Control Codes Convolutional Codes University of Colorado Spring 2007 Linear (n, k) block codes take k data symbols at a time and encode them into n code symbols.

### Unit 19: Probability Models

Unit 19: Probability Models Summary of Video Probability is the language of uncertainty. Using statistics, we can better predict the outcomes of random phenomena over the long term from the very complex,

### Victor Shoup Avi Rubin. fshoup,rubing@bellcore.com. Abstract

Session Key Distribution Using Smart Cards Victor Shoup Avi Rubin Bellcore, 445 South St., Morristown, NJ 07960 fshoup,rubing@bellcore.com Abstract In this paper, we investigate a method by which smart

### Cost Model: Work, Span and Parallelism. 1 The RAM model for sequential computation:

CSE341T 08/31/2015 Lecture 3 Cost Model: Work, Span and Parallelism In this lecture, we will look at how one analyze a parallel program written using Cilk Plus. When we analyze the cost of an algorithm

### Probabilistic Graphical Models

Probabilistic Graphical Models Raquel Urtasun and Tamir Hazan TTI Chicago April 4, 2011 Raquel Urtasun and Tamir Hazan (TTI-C) Graphical Models April 4, 2011 1 / 22 Bayesian Networks and independences

### Introduction to Wide-Area WiFi. AfNOG 2009 Wireless Tutorials Cairo

Introduction to Wide-Area WiFi AfNOG 2009 Wireless Tutorials Cairo Wireless networking protocols The 802.11 family of radio protocols are commonly referred to as WiFi. 802.11a supports up to 54 Mbps using

### A Probabilistic Quantum Key Transfer Protocol

A Probabilistic Quantum Key Transfer Protocol Abhishek Parakh Nebraska University Center for Information Assurance University of Nebraska at Omaha Omaha, NE 6818 Email: aparakh@unomaha.edu August 9, 01

### CONVERGECAST, namely the collection of data from

1 Fast Data Collection in Tree-Based Wireless Sensor Networks Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar Krishnamachari, and Krishnakant Chintalapudi Abstract We investigate the following fundamental

### Medium Access Sublayer

Medium Access Sublayer Topology of the Network Bus, Ring, Tree Protocols IEEE 802.3 for bus topology IEEE 802.4 for token bus IEEE 802.5 for token ring FDDI for fibre ring IEEE 802.11 for wireless networks

### Introductory Probability. MATH 107: Finite Mathematics University of Louisville. March 5, 2014

Introductory Probability MATH 07: Finite Mathematics University of Louisville March 5, 204 What is probability? Counting and probability 2 / 3 Probability in our daily lives We see chances, odds, and probabilities

### Max Flow, Min Cut, and Matchings (Solution)

Max Flow, Min Cut, and Matchings (Solution) 1. The figure below shows a flow network on which an s-t flow is shown. The capacity of each edge appears as a label next to the edge, and the numbers in boxes

### A Security Review of an Anonymous Peer-to-Peer File Transfer Protocol

A Security Review of an Anonymous Peer-to-Peer File Transfer Protocol Bryan Lipinski, Patrick MacAlpine [lipinski,patmac]@rice.edu Abstract This paper examines the overall security of AP3 [2] (Anonymous

### ECE 333: Introduction to Communication Networks Fall 2001

ECE 333: Introduction to Communication Networks Fall 2001 Lecture 17: Medium Access Control V Perfectly scheduled approaches Token ring networks 1 We have categorized channel allocation techniques as either

### CUNSHENG DING HKUST, Hong Kong. Computer Security. Computer Security. Cunsheng DING, HKUST COMP4631

Cunsheng DING, HKUST Lecture 08: Key Management for One-key Ciphers Topics of this Lecture 1. The generation and distribution of secret keys. 2. A key distribution protocol with a key distribution center.

### Giving life to today s media distribution services

Giving life to today s media distribution services FIA - Future Internet Assembly Athens, 17 March 2014 Presenter: Nikolaos Efthymiopoulos Network architecture & Management Group Copyright University of

### Lecture 7: NP-Complete Problems

IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 7: NP-Complete Problems David Mix Barrington and Alexis Maciel July 25, 2000 1. Circuit

WAN Data Link Protocols In addition to Physical layer devices, WANs require Data Link layer protocols to establish the link across the communication line from the sending to the receiving device. 1 Data

### TCP - Introduction. Features of TCP

TCP - Introduction The Internet Protocol (IP) provides unreliable datagram service between hosts The Transmission Control Protocol (TCP) provides reliable data delivery It uses IP for datagram delivery

### RANDOMIZATION IN APPROXIMATION AND ONLINE ALGORITHMS. Manos Thanos Randomized Algorithms NTUA

RANDOMIZATION IN APPROXIMATION AND ONLINE ALGORITHMS 1 Manos Thanos Randomized Algorithms NTUA RANDOMIZED ROUNDING Linear Programming problems are problems for the optimization of a linear objective function,

### CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS

137 CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS 8.1 CONCLUSION In this thesis, efficient schemes have been designed and analyzed to control congestion and distribute the load in the routing process of

### Application of Quantum Cryptography to an Eavesdropping Detectable Data Transmission

Title Application of Quantum Cryptography Detectable Data Transmission Author(s) Kudo, Takamitsu; Usuda, Tsuyoshi Sa Masayasu IEICE Transactions on Fundamentals Citation Communications and Computer Science

### The Predecessor Attack: An Analysis of a Threat to Anonymous Communications Systems

The Predecessor Attack: An Analysis of a Threat to Anonymous Communications Systems MATTHEW K. WRIGHT, MICAH ADLER, and BRIAN NEIL LEVINE University of Massachusetts Amherst and CLAY SHIELDS Georgetown

### WORKED EXAMPLES 1 TOTAL PROBABILITY AND BAYES THEOREM

WORKED EXAMPLES 1 TOTAL PROBABILITY AND BAYES THEOREM EXAMPLE 1. A biased coin (with probability of obtaining a Head equal to p > 0) is tossed repeatedly and independently until the first head is observed.

### A Survey of Zero-Knowledge Proofs with Applications to Cryptography

A Survey of Zero-Knowledge Proofs with Applications to Cryptography Austin Mohr Southern Illinois University at Carbondale Carbondale, IL 62901 E-mail: austinmohr@gmail.com Abstract Zero-knowledge proofs

### C.4 Tree Diagrams and Bayes Theorem

A26 APPENDIX C Probability and Probability Distributions C.4 Tree Diagrams and Bayes Theorem Find probabilities using tree diagrams. Find probabilities using Bayes Theorem. Tree Diagrams A type of diagram

### Weakly Secure Network Coding

Weakly Secure Network Coding Kapil Bhattad, Student Member, IEEE and Krishna R. Narayanan, Member, IEEE Department of Electrical Engineering, Texas A&M University, College Station, USA Abstract In this

### On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation

On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation Yuval Ishai 1, Eyal Kushilevitz 1, Yehuda Lindell 2, and Erez Petrank 1 1 Technion ({yuvali,eyalk,erez}@cs.technion.ac.il)

### Secure Network Coding for Wiretap Networks of Type II

1 Secure Network Coding for Wiretap Networks of Type II Salim El Rouayheb, Emina Soljanin, Alex Sprintson Abstract We consider the problem of securing a multicast network against a wiretapper that can

### Distillation Codes and Applications to DoS Resistant Multicast Authentication

Proceedings of the Network and Distributed System Security Conference (NDSS 2004), February 2004, pp. 37-56 Distillation Codes and Applications to DoS Resistant Multicast Authentication Chris Karlof UC

### Introduction to Symmetric and Asymmetric Cryptography

Introduction to Symmetric and Asymmetric Cryptography Ali E. Abdallah Birmingham CityUniversity Email: Ali.Abdallah@bcu.ac.uk Lectures are part of the project: ConSoLiDatE Multi-disciplinary Cooperation

CSE / Notes : Task Scheduling & Load Balancing Task Scheduling A task is a (sequential) activity that uses a set of inputs to produce a set of outputs. A task (precedence) graph is an acyclic, directed

### Fairness in Routing and Load Balancing

Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria

### A Secure Protocol for the Oblivious Transfer (Extended Abstract) M. J. Fischer. Yale University. S. Micali Massachusetts Institute of Technology

J, Cryptoiogy (1996) 9:191-195 Joumol of CRYPTOLOGY O 1996 International Association for Cryptologic Research A Secure Protocol for the Oblivious Transfer (Extended Abstract) M. J. Fischer Yale University

### Authentication and Encryption: How to order them? Motivation

Authentication and Encryption: How to order them? Debdeep Muhopadhyay IIT Kharagpur Motivation Wide spread use of internet requires establishment of a secure channel. Typical implementations operate in

### - Easy to insert & delete in O(1) time - Don t need to estimate total memory needed. - Hard to search in less than O(n) time

Skip Lists CMSC 420 Linked Lists Benefits & Drawbacks Benefits: - Easy to insert & delete in O(1) time - Don t need to estimate total memory needed Drawbacks: - Hard to search in less than O(n) time (binary

### The dangers of composing anonymous channels

The dangers of composing anonymous channels George Danezis 1 and Emilia Käsper 2 1 Microsoft Research 2 Google gdane@microsoft.com, ekasper@google.com Abstract. We present traffic analyses of two anonymous

### Introduction to LAN/WAN. Network Layer

Introduction to LAN/WAN Network Layer Topics Introduction (5-5.1) Routing (5.2) (The core) Internetworking (5.5) Congestion Control (5.3) Network Layer Design Isues Store-and-Forward Packet Switching Services

### On the k-path cover problem for cacti

On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we

### Content Delivery Networks. Shaxun Chen April 21, 2009

Content Delivery Networks Shaxun Chen April 21, 2009 Outline Introduction to CDN An Industry Example: Akamai A Research Example: CDN over Mobile Networks Conclusion Outline Introduction to CDN An Industry

### CSC 373: Algorithm Design and Analysis Lecture 16

CSC 373: Algorithm Design and Analysis Lecture 16 Allan Borodin February 25, 2013 Some materials are from Stephen Cook s IIT talk and Keven Wayne s slides. 1 / 17 Announcements and Outline Announcements

### Midterm Exam Solutions CS161 Computer Security, Spring 2008

Midterm Exam Solutions CS161 Computer Security, Spring 2008 1. To encrypt a series of plaintext blocks p 1, p 2,... p n using a block cipher E operating in electronic code book (ECB) mode, each ciphertext

### 1. The subnet must prevent additional packets from entering the congested region until those already present can be processed.

Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because routers are receiving packets faster than they can forward them, one

### COM S 687 Introduction to Cryptography October 19, 2006

COM S 687 Introduction to Cryptography October 19, 2006 Lecture 16: Non-Malleability and Public Key Encryption Lecturer: Rafael Pass Scribe: Michael George 1 Non-Malleability Until this point we have discussed

### Database Security. The Need for Database Security

Database Security Public domain NASA image L-1957-00989 of people working with an IBM type 704 electronic data processing machine. 1 The Need for Database Security Because databases play such an important

### On the Traffic Capacity of Cellular Data Networks. 1 Introduction. T. Bonald 1,2, A. Proutière 1,2

On the Traffic Capacity of Cellular Data Networks T. Bonald 1,2, A. Proutière 1,2 1 France Telecom Division R&D, 38-40 rue du Général Leclerc, 92794 Issy-les-Moulineaux, France {thomas.bonald, alexandre.proutiere}@francetelecom.com

### On the Effectiveness of Secret Key Extraction from Wireless Signal Strength in Real Environments

On the Effectiveness of Secret Key Extraction from Wireless Signal Strength in Real Environments Suman Jana, Sriram Nandha Premnath Mike Clark, Sneha K. Kasera, Neal Patwari University of Utah Srikanth

### A Randomized Approximation Algorithm for MAX 3-SAT

A Randomized Approximation Algorithm for MAX 3-SAT CS 511 Iowa State University December 8, 2008 Note. This material is based on Kleinberg & Tardos, Algorithm Design, Chapter 13, Section 4, and associated

### Message Authentication Code

Message Authentication Code Ali El Kaafarani Mathematical Institute Oxford University 1 of 44 Outline 1 CBC-MAC 2 Authenticated Encryption 3 Padding Oracle Attacks 4 Information Theoretic MACs 2 of 44

### princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of

### Lecture 10: CPA Encryption, MACs, Hash Functions. 2 Recap of last lecture - PRGs for one time pads

CS 7880 Graduate Cryptography October 15, 2015 Lecture 10: CPA Encryption, MACs, Hash Functions Lecturer: Daniel Wichs Scribe: Matthew Dippel 1 Topic Covered Chosen plaintext attack model of security MACs

### Detecting Denial of Service Attacks in Tor

Detecting Denial of Service Attacks in Tor Norman Danner, Danny Krizanc, and Marc Liberatore Department of Mathematics and Computer Science Wesleyan University Middletown, CT 06459 USA Abstract. Tor is

### On the Unique Games Conjecture

On the Unique Games Conjecture Antonios Angelakis National Technical University of Athens June 16, 2015 Antonios Angelakis (NTUA) Theory of Computation June 16, 2015 1 / 20 Overview 1 Introduction 2 Preliminary

### Tema 5.- Seguridad. Problemas Soluciones

Tema 5.- Seguridad Problemas Soluciones Wireless medium is easy to snoop on Routing security vulnerabilities Due to ad hoc connectivity and mobility, it is hard to guarantee access to any particular node

### Chapter 15. Definitions: experiment: is the act of making an observation or taking a measurement.

MATH 11008: Probability Chapter 15 Definitions: experiment: is the act of making an observation or taking a measurement. outcome: one of the possible things that can occur as a result of an experiment.

### Coin Flip Questions. Suppose you flip a coin five times and write down the sequence of results, like HHHHH or HTTHT.

Coin Flip Questions Suppose you flip a coin five times and write down the sequence of results, like HHHHH or HTTHT. 1 How many ways can you get exactly 1 head? 2 How many ways can you get exactly 2 heads?

### Security Analysis of PLAID

Security Analysis of PLAID Dai Watanabe 1 Yokoyama Laboratory, Hitachi, Ltd., 292 Yoshida-cho, Totsuka-ku, Yokohama, 244-0817, Japan dai.watanabe.td@hitachi.com Abstract. PLAID is a mutual authentication