Self-Organized Public-Key Management for Mobile Ad Hoc Networks
|
|
- Roland Dennis
- 5 years ago
- Views:
Transcription
1 Self-Organized Public-Key Management for Mobile Ad Hoc Networks Srđan Čapkun, Levente Buttyàn and Jean-Pierre Hubaux {srdan.capkun, levente.buttyan and Laboratory for Computer Communications and Application (LCA) Swiss Federal Institute of Technology (EPFL) 1 Security in ad hoc networks Ad hoc networks mobile terminals (can be captured or compromised) wireless communications (passive eavesdropping and active interfering) no centralized management point (cooperation) Vulnerabilities basic mechanisms (e.g. routing) security mechanisms (e.g. (public) key management) 2
2 Self-Organized Public-Key Management Security: we use public-key cryptography scheme to support security services in mobile ad hoc networks Problem: How can a user u obtain the authentic public key of another user v in the presence of an active attacker? Our system: - users generate their keys and issue certificates - no central certification authority - no certification directories - no specific role assigned to a subset of nodes - no preinstalled keys/procedures 3 Model We assume that if a user i believes that a given public key belongs to a given user j, then i can issue a public-key certificate to j A certificate graph G(V,E) V is a set of keys E is the set of edges, where a directed edge (i,j) is added if i signed a public key certificate {, jk j } to user j Pr K i K i K j {, jk j } Pr K i 4
3 Certificate graph K 8 K 3 K 12 K K10 K 11 K 1 K 7 K 9 K 6 K 5 K 2 K 4 authentication via a chain of certificates 5 Self Organized Public Key Management The system works in two phases: 1. INITIALIZATION: USERS CONSTRUCT THEIR LOCAL CERTIFICATE REPOSITORIES (STORE A SET OF CERTIFICATES) 2. WHEN USER WANTS TO GET VERIFY A PUBLIC KEY OF ANOTHER USER, USERS MERGE THEIR LOCAL REPOSITORIES AND TRY TO FIND A PATH(S) OF CERTIFICATE BETWEEN THEM IN A CERTIFICATE GRAPH i i j 6
4 j Initialization (1) k i 7 Initialization (2) Each user stores a local repository of public-key certificates (a subgraph) stores the certificates that it issued (outgoing edges) stores the list of certificates that others issued for it (incoming edges) stores an additional set of certificates chosen according to some algorithm A Users use the same algorithm to build their repositories Centralized Distributed CD sub-graph 1 req 2 sub-graph 8
5 Merging the local repositories (verifying the key) j i 9 Example of an algorithm: Maximum Degree Node builds its incoming and outgoing path(s) choosing the nodes with the highest degrees. 10
6 Algorithm performance We define the performance p algorithm A on the certificate graph G as p (, s G) = A {( uv, ) V V: Ku G ua, G K va, v} {( uv, ) V V: K K} A (, s G) of the local repository construction u G v where s is the size of the local repoi stories of the users (i.e. the number of edges in the subgraph of each user): ( ). s= E G ua, 11 Performance of Maximum Degree Node builds its incoming and outgoing path(s) choosing the nodes with the highest degrees. 1 algorithm performance p MD (s,pgp) PGP graph size = ~ c = 1 path c = 4 paths local repository size (s) 12
7 False certificates { FK, j } Pr K D K i K D {, jk'} j Pr KD K j K' j K D K' j { FK, j } Pr K D a key controlled by a dishonest user a false key created by a dishonest user a certificate binding user F to a key K j j i 13 Design goals performance redefined by taking authentication metrics into account key usage ideally, all vertices need to be used for authentication equal number of times (to be on the path equal number of times) scalability minimize the size of the local repositories (subgraphs) and the communication cost invariance to certificate graph changes 14
8 Performance with authentication metrics Authentication metric : the value ( u, vg, ) represents the assurance with which u can obtain the authentic public key of v using the information in G. Performance of a subgraph selection algorithm: p A, ( G) = 1 J~ ( uv, ) W ( uvg,, u U Gv) ( uvg,, ) { } where W = ( u, v) V V : ( u, v, G) 0 Examples of authentication metrics include: number of disjoint paths of certificates, number of bounded and k-bounded disjoint paths... Authentication metric analysis and design; M. Reiter and S. Stubblebine ACM trans.on Information and System Security Certificate (Key usage) By usage for key authentication, we mean that a certificate in the merged subgraphs will be used for key authentication by the authentication metric. The number of times that a key is used for authentication is the sum of the numbers of times that the certificates signed by that key are used for authentication Given a certificate graph GV (, E), a local repository construction algorithm Aand an authentication metric, and for each pair of vertices, ( Ku, Kv) V V, a set of edges M ( K, K ) that are used by the authentication metric u v {,,,,,, } M ( K, K ) = ( K, K ) G G : ( K, K, G G \( K, K )) ( K, K, G G ) u v w z u A v A u v u A v A w z u v u A v A and for each vertex K V, the usage U ( K ) in M ( K, K ) w ( u, v),, A, G w u v { } U ( K ) = ( K, K ) M ( K, K ): K = K ( uv, ),, AG, w z x u v z w we define for each Kw V, a vertex (key usage) U, A, G( Kw) : U, AG, ( Kw) = U( uv, ),, AG,( Kw) Ku, Kv V 16
9 Fundamental design limit (1): size of the repositories Problem 1: Find a set of subgraphs that minimizes the size of local repositories such that p=1 Theorem 1: Let us consider a certificate graph G( V, E), a subgraph construction algorithm A, and an authentication metric 0. If pa, ( s, G) = 1, then s is minimized if 0 K V, G = spk (, K) spk (, K), v v v x x v where sp( K, K ) is the shortest path from K to K in G such that K minimizes Kv V, Kv Kx v x v x x max ( dk (, K) + dk (, K)) v x x v where d( K, K ) is the length of sp( K, K ). v x v x Furthermore, s = min max ( d( K, K ) + d( K, K )) Kx V Kv V, Kv Kx v x x v 17 Fundamental design limit (2): key usage Problem 2: Find a set of subgraphs that minimizes the size of local repositories such that p=1 and U(K v )=U(K u ) Theorem 2: Let us consider a certificate graph G( V, E), a subgraph construction algorithm A, and a binary authentication metric 0. If (i) pa, ( s, G) = 1, (ii) U( K ) ( ) 0 v = U Ku K, K V, and (iii) V( G ) = s for each K V, then s V -1. v v v v V = 4, s = 2 V = 9, s = 4 s = 2( V -1) 18
10 Maximum degree simulation results 19 Key usage: Maximum degree 20
11 Helper users pa(s,h,g) helper 2 helpers 3 helpers 4 helpers 0 helpers pa(s,0,g) 21 Conclusion and Future work Conclusion We have proposed a public key management system for mobile ad hoc networks no publicly accessible certificate directories needed but can be used off line verification enabled the scheme provides probabilistic guarantees Possible applications Key Authentication in Ad hoc networks in the absence of connectivity to the backbone Peer-to-peer computing with no centralized certificate server Future work Key revocation 22
12 References g Jean-Pierre Hubaux, Levente Buttyan, Srdjan Capkun The Quest for security of mobile ad hoc networks MobiHoc g Srdjan Capkun, Levente Buttyan and Jean-Pierre Hubaux Self-Organized Public-Key Management for Mobile Ad Hoc Networks, EPFL/IC Technical Report no. 2002/34, May g Srdjan Capkun, Levente Buttyan and Jean-Pierre Hubaux Small Worlds in Security Systems: an Analysis of the PGP Certificate Graph, EPFL/IC Technical Report no. 2002/23, May icwww.epfl.ch
Fraud within Asymmetric Multi-Hop Cellular Networks
Financial Cryptography 2005 EPFL, Lausanne, Switzerland ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE Wireless networks Single-hop cellular network Multi-hop network Multi-hop cellular network Asymmetric multi-hop
More informationOverlapping Communities
Overlapping Communities Davide Mottin HassoPlattner Institute Graph Mining course Winter Semester 2017 Acknowledgements Most of this lecture is taken from: http://web.stanford.edu/class/cs224w/slides GRAPH
More informationOn the Average Pairwise Connectivity of Wireless Multihop Networks
On the Average Pairwise Connectivity of Wireless Multihop Networks Fangting Sun and Mark Shayman Department of Electrical and Computer Engineering University of Maryland, College Park, MD 2742 {ftsun,
More informationCS 4407 Algorithms Lecture: Shortest Path Algorithms
CS 440 Algorithms Lecture: Shortest Path Algorithms Prof. Gregory Provan Department of Computer Science University College Cork 1 Outline Shortest Path Problem General Lemmas and Theorems. Algorithms Bellman-Ford
More informationComputing Trusted Authority Scores in Peer-to-Peer Web Search Networks
Computing Trusted Authority Scores in Peer-to-Peer Web Search Networks Josiane Xavier Parreira, Debora Donato, Carlos Castillo, Gerhard Weikum Max-Planck Institute for Informatics Yahoo! Research May 8,
More informationResearch Article MDS-Based Wormhole Detection Using Local Topology in Wireless Sensor Networks
Distributed Sensor Networks Volume 212, Article ID 14572, 9 pages doi:1.1155/212/14572 Research Article MDS-Based Wormhole Detection Using Local Topology in Wireless Sensor Networks Xiaopei Lu, Dezun Dong,
More informationDesign and Analysis of Algorithms
Design and Analysis of Algorithms CSE 5311 Lecture 21 Single-Source Shortest Paths Junzhou Huang, Ph.D. Department of Computer Science and Engineering CSE5311 Design and Analysis of Algorithms 1 Single-Source
More information7. Shortest Path Problems and Deterministic Finite State Systems
7. Shortest Path Problems and Deterministic Finite State Systems In the next two lectures we will look at shortest path problems, where the objective is to find the shortest path from a start node to an
More informationSecure and reliable connectivity in heterogeneous wireless sensor networks
Secure and reliable connectivity in heterogeneous wireless sensor networks Rashad Eletreby and Osman Yağan Department of Electrical and Computer Engineering and CyLab, Carnegie Mellon University, Pittsburgh,
More informationNP-problems continued
NP-problems continued Page 1 Since SAT and INDEPENDENT SET can be reduced to each other we might think that there would be some similarities between the two problems. In fact, there is one such similarity.
More informationCS-E4320 Cryptography and Data Security Lecture 11: Key Management, Secret Sharing
Lecture 11: Key Management, Secret Sharing Céline Blondeau Email: celine.blondeau@aalto.fi Department of Computer Science Aalto University, School of Science Key Management Secret Sharing Shamir s Threshold
More informationChapter 6: Securing neighbor discovery
Securit and Cooperation in Wireless Networks http://secowinet.epfl.ch/ the wormhole attack; centralized and decentralized wormhole detection mechanisms; 007 Levente Buttán and Jean-Pierre Hubau Introduction
More informationFormal definition of P
Since SAT and INDEPENDENT SET can be reduced to each other we might think that there would be some similarities between the two problems. In fact, there is one such similarity. In SAT we want to know if
More informationTopics in Approximation Algorithms Solution for Homework 3
Topics in Approximation Algorithms Solution for Homework 3 Problem 1 We show that any solution {U t } can be modified to satisfy U τ L τ as follows. Suppose U τ L τ, so there is a vertex v U τ but v L
More informationDetecting Wormhole Attacks in Wireless Networks Using Local Neighborhood Information
Detecting Wormhole Attacks in Wireless Networks Using Local Neighborhood Information W. Znaidi M. Minier and JP. Babau Centre d'innovations en Télécommunication & Intégration de services wassim.znaidi@insa-lyon.fr
More informationNP-problems continued
NP-problems continued Page 1 Since SAT and INDEPENDENT SET can be reduced to each other we might think that there would be some similarities between the two problems. In fact, there is one such similarity.
More informationPatrol: Revealing Zero-day Attack Paths through Network-wide System Object Dependencies
Patrol: Revealing Zero-day Attack Paths through Network-wide System Object Dependencies Jun Dai, Xiaoyan Sun, and Peng Liu College of Information Sciences and Technology Pennsylvania State University,
More informationBounded Privacy: Formalising the Trade-Off Between Privacy and Quality of Service
H. Langweg, H. Langweg, M. Meier, M. Meier, B.C. B.C. Witt, Witt, D. Reinhardt D. Reinhardt et al. (Hrsg.): Sicherheit 2018, Lecture Notes in ininformatics (LNI), Gesellschaft für fürinformatik, Bonn 2018
More informationFlows. Chapter Circulations
Chapter 4 Flows For a directed graph D = (V,A), we define δ + (U) := {(u,v) A : u U,v / U} as the arcs leaving U and δ (U) := {(u,v) A u / U,v U} as the arcs entering U. 4. Circulations In a directed graph
More informationNotes for Lecture 17
U.C. Berkeley CS276: Cryptography Handout N17 Luca Trevisan March 17, 2009 Notes for Lecture 17 Scribed by Matt Finifter, posted April 8, 2009 Summary Today we begin to talk about public-key cryptography,
More informationCombinatorial Rigidity and the Molecular Conjecture
Page 1 of 65 Combinatorial Rigidity and the Molecular Conjecture Brigitte Servatius Worcester Polytechnic Institute The Proof of the Product Rule To derivate a product as defined The diff rence quotient
More information2.2 Asymptotic Order of Growth. definitions and notation (2.2) examples (2.4) properties (2.2)
2.2 Asymptotic Order of Growth definitions and notation (2.2) examples (2.4) properties (2.2) Asymptotic Order of Growth Upper bounds. T(n) is O(f(n)) if there exist constants c > 0 and n 0 0 such that
More informationShow that the following problems are NP-complete
Show that the following problems are NP-complete April 7, 2018 Below is a list of 30 exercises in which you are asked to prove that some problem is NP-complete. The goal is to better understand the theory
More informationNP-complete Problems
NP-complete Problems HP, TSP, 3COL, 0/1IP Dimitris Diamantis µπλ November 6, 2014 Dimitris Diamantis (µπλ ) NP-complete Problems November 6, 2014 1 / 34 HAMILTON PATH is NP-Complete Definition Given an
More informationCS 241 Analysis of Algorithms
CS 241 Analysis of Algorithms Professor Eric Aaron Lecture T Th 9:00am Lecture Meeting Location: OLB 205 Business Grading updates: HW5 back today HW7 due Dec. 10 Reading: Ch. 22.1-22.3, Ch. 25.1-2, Ch.
More informationCPSC 467: Cryptography and Computer Security
CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 16 October 30, 2017 CPSC 467, Lecture 16 1/52 Properties of Hash Functions Hash functions do not always look random Relations among
More informationValiant s Neuroidal Model
Valiant s Neuroidal Model Leslie Valiant CSE Department, UCSD Presented by: Max Hopkins November 13, 2018 Leslie Valiant (Harvard University) November 13, 2018 1 / 15 Roadmap 1 Modeling Memory and Association
More informationActive Measurement for Multiple Link Failures Diagnosis in IP Networks
Active Measurement for Multiple Link Failures Diagnosis in IP Networks Hung X. Nguyen and Patrick Thiran EPFL CH-1015 Lausanne, Switzerland Abstract. Simultaneous link failures are common in IP networks
More informationANALYTICAL MODEL OF A VIRTUAL BACKBONE STABILITY IN MOBILE ENVIRONMENT
(The 4th New York Metro Area Networking Workshop, New York City, Sept. 2004) ANALYTICAL MODEL OF A VIRTUAL BACKBONE STABILITY IN MOBILE ENVIRONMENT Ibrahim Hökelek 1, Mariusz A. Fecko 2, M. Ümit Uyar 1
More informationA Unified Approach to Combinatorial Key Predistribution Schemes for Sensor Networks
A Unified Approach to Combinatorial Key Predistribution Schemes for Sensor Networks Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo 3rd Biennial Canadian Discrete
More informationQuantum Wireless Sensor Networks
Quantum Wireless Sensor Networks School of Computing Queen s University Canada ntional Computation Vienna, August 2008 Main Result Quantum cryptography can solve the problem of security in sensor networks.
More informationThe Lopsided Lovász Local Lemma
Joint work with Linyuan Lu and László Székely Georgia Southern University April 27, 2013 The lopsided Lovász local lemma can establish the existence of objects satisfying several weakly correlated conditions
More informationDirectly Revocable Key-Policy Attribute- Based Encryption with Verifiable Ciphertext Delegation
Directly Revocable Key-Policy Attribute- Based Encryption with Verifiable Ciphertext Delegation Yanfeng Shi, Qingji Zheng, Jiqiang Liu, Zhen Han Beijing Jiaotong University Traditional Encrypted Filesystem
More informationProject in Computational Game Theory: Communities in Social Networks
Project in Computational Game Theory: Communities in Social Networks Eldad Rubinstein November 11, 2012 1 Presentation of the Original Paper 1.1 Introduction In this section I present the article [1].
More informationObservations on Linear Key Predistribution Schemes and Their Applications to Group Deployment of Nodes
Observations on Linear Key Predistribution Schemes and Their Applications to Group Deployment of Nodes Alexey Urivskiy JSC InfoTeCS ourivski@mail.ru, urivskiy@infotecs.ru June 20, 2012 Key Predistribution
More informationApproximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs Haim Kaplan Tel-Aviv University, Israel haimk@post.tau.ac.il Nira Shafrir Tel-Aviv University, Israel shafrirn@post.tau.ac.il
More informationCryptanalysis of Threshold-Multisignature Schemes
Cryptanalysis of Threshold-Multisignature Schemes Lifeng Guo Institute of Systems Science, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100080, P.R. China E-mail address:
More informationA Tight Rate Bound and Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures
1 A Tight Rate Bound and Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures arxiv:181050v1 [csit] 6 Dec 018 S B Balaji, Ganesh R Kini and
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore Title Multi-receiver authentication code for network coding( Accepted version ) Author(s) Oggier, Frederique;
More informationRobust Network Codes for Unicast Connections: A Case Study
Robust Network Codes for Unicast Connections: A Case Study Salim Y. El Rouayheb, Alex Sprintson, and Costas Georghiades Department of Electrical and Computer Engineering Texas A&M University College Station,
More informationThe Byzantine Generals Problem Leslie Lamport, Robert Shostak and Marshall Pease. Presenter: Jose Calvo-Villagran
+ The Byzantine Generals Problem Leslie Lamport, Robert Shostak and Marshall Pease Presenter: Jose Calvo-Villagran jcalvovi@uwaterloo.ca + Overview n The Byzantine Generals Problem n A solution: Oral Messages
More informationChapter 7 Network Flow Problems, I
Chapter 7 Network Flow Problems, I Network flow problems are the most frequently solved linear programming problems. They include as special cases, the assignment, transportation, maximum flow, and shortest
More informationReliability Analysis of Communication Networks
Reliability Analysis of Communication Networks Mathematical models and algorithms Peter Tittmann Hochschule Mittweida May 2007 Peter Tittmann (Hochschule Mittweida) Network Reliability 2007-05-30 1 / 64
More informationBranch-and-Bound for the Travelling Salesman Problem
Branch-and-Bound for the Travelling Salesman Problem Leo Liberti LIX, École Polytechnique, F-91128 Palaiseau, France Email:liberti@lix.polytechnique.fr March 15, 2011 Contents 1 The setting 1 1.1 Graphs...............................................
More informationAnalogies and discrepancies between the vertex cover number and the weakly connected domination number of a graph
Analogies and discrepancies between the vertex cover number and the weakly connected domination number of a graph M. Lemańska a, J. A. Rodríguez-Velázquez b, Rolando Trujillo-Rasua c, a Department of Technical
More informationAlgorithms: COMP3121/3821/9101/9801
NEW SOUTH WALES Algorithms: COMP3121/3821/9101/9801 Aleks Ignjatović School of Computer Science and Engineering University of New South Wales LECTURE 9: INTRACTABILITY COMP3121/3821/9101/9801 1 / 29 Feasibility
More informationClique Number vs. Chromatic Number in Wireless Interference Graphs: Simulation Results
The University of Kansas Technical Report Clique Number vs. Chromatic Number in Wireless Interference Graphs: Simulation Results Pradeepkumar Mani, David W. Petr ITTC-FY2007-TR-41420-01 March 2007 Project
More informationTopic: Balanced Cut, Sparsest Cut, and Metric Embeddings Date: 3/21/2007
CS880: Approximations Algorithms Scribe: Tom Watson Lecturer: Shuchi Chawla Topic: Balanced Cut, Sparsest Cut, and Metric Embeddings Date: 3/21/2007 In the last lecture, we described an O(log k log D)-approximation
More informationCPSC 467: Cryptography and Computer Security
CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 19 November 8, 2017 CPSC 467, Lecture 19 1/37 Zero Knowledge Interactive Proofs (ZKIP) ZKIP for graph isomorphism Feige-Fiat-Shamir
More informationMinimum spanning tree
Minimum spanning tree Jean Cousty MorphoGraph and Imagery 2011 J. Cousty : MorphoGraph and Imagery 1/17 Outline of the lecture 1 Minimum spanning tree 2 Cut theorem for MST 3 Kruskal algorithm J. Cousty
More informationModeling disruption and dynamic response of water networks. Sifat Ferdousi August 19, 2016
Modeling disruption and dynamic response of water networks Sifat Ferdousi August 19, 2016 Threat to water networks The main threats to water infrastructure systems can be classified in three different
More informationMetrics: Growth, dimension, expansion
Metrics: Growth, dimension, expansion Social and Technological Networks Rik Sarkar University of Edinburgh, 2017. Metric A distance measure d is a metric if: d(u,v) 0 d(u,v) = 0 iff u=v d(u,v) = d(u,v)
More informationChapter 34: NP-Completeness
Graph Algorithms - Spring 2011 Set 17. Lecturer: Huilan Chang Reference: Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms, 2nd Edition, The MIT Press. Chapter 34: NP-Completeness 2. Polynomial-time
More informationSecret sharing schemes
Secret sharing schemes Martin Stanek Department of Computer Science Comenius University stanek@dcs.fmph.uniba.sk Cryptology 1 (2017/18) Content Introduction Shamir s secret sharing scheme perfect secret
More informationDiscrete Wiskunde II. Lecture 5: Shortest Paths & Spanning Trees
, 2009 Lecture 5: Shortest Paths & Spanning Trees University of Twente m.uetz@utwente.nl wwwhome.math.utwente.nl/~uetzm/dw/ Shortest Path Problem "#$%&'%()*%"()$#+,&- Given directed "#$%&'()*+,%+('-*.#/'01234564'.*,'7+"-%/8',&'5"4'84%#3
More informationarxiv: v1 [cs.dc] 22 Oct 2018
FANTOM: A SCALABLE FRAMEWORK FOR ASYNCHRONOUS DISTRIBUTED SYSTEMS A PREPRINT Sang-Min Choi, Jiho Park, Quan Nguyen, and Andre Cronje arxiv:1810.10360v1 [cs.dc] 22 Oct 2018 FANTOM Lab FANTOM Foundation
More informationDisjoint paths in tournaments
Disjoint paths in tournaments Maria Chudnovsky 1 Columbia University, New York, NY 10027, USA Alex Scott Mathematical Institute, University of Oxford, 24-29 St Giles, Oxford OX1 3LB, UK Paul Seymour 2
More informationRunning Time. Assumption. All capacities are integers between 1 and C.
Running Time Assumption. All capacities are integers between and. Invariant. Every flow value f(e) and every residual capacities c f (e) remains an integer throughout the algorithm. Theorem. The algorithm
More informationInformation Disclosure in Identity Management
Information Disclosure in Identity Management all of us Abstract User Controlled Identity Management Systems have the goal to hinder the linkability between the different digital identities of a user.
More informationA location privacy metric for V2X communication systems
A location privacy metric for V2X communication systems Zhendong Ma, Frank Kargl, and Michael Weber Institute of Media Informatics, Ulm University, Germany {zhendong.ma frank.kargl michael.weber}@uni-ulm.de
More informationStructural Resilience of Cyberphysical Systems Under Attack
Structural Resilience of Cyberphysical Systems Under Attack Bhaskar Ramasubramanian 1, M.A. Rajan 2, M. Girish Chandra 2 1 Department of Electrical and Computer Engineering, and Institute for Systems Research,
More informationExact Algorithms for Dominating Induced Matching Based on Graph Partition
Exact Algorithms for Dominating Induced Matching Based on Graph Partition Mingyu Xiao School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731,
More informationGraph-theoretic Problems
Graph-theoretic Problems Parallel algorithms for fundamental graph-theoretic problems: We already used a parallelization of dynamic programming to solve the all-pairs-shortest-path problem. Here we are
More informationNotes on MapReduce Algorithms
Notes on MapReduce Algorithms Barna Saha 1 Finding Minimum Spanning Tree of a Dense Graph in MapReduce We are given a graph G = (V, E) on V = N vertices and E = m N 1+c edges for some constant c > 0. Our
More informationShortest Paths. CS 320, Fall Dr. Geri Georg, Instructor 320 ShortestPaths 3
Shortest Paths CS 320, Fall 2017 Dr. Geri Georg, Instructor georg@colostate.edu 320 ShortestPaths 3 Preliminaries Weighted, directed graphs Weight function: maps edges to real numbers Shortest path weight:
More informationP P P NP-Hard: L is NP-hard if for all L NP, L L. Thus, if we could solve L in polynomial. Cook's Theorem and Reductions
Summary of the previous lecture Recall that we mentioned the following topics: P: is the set of decision problems (or languages) that are solvable in polynomial time. NP: is the set of decision problems
More informationVertex colorings of graphs without short odd cycles
Vertex colorings of graphs without short odd cycles Andrzej Dudek and Reshma Ramadurai Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513, USA {adudek,rramadur}@andrew.cmu.edu
More informationOn Selfish Behavior in CSMA/CA Networks
On Selfish Behavior in CSMA/CA Networks Mario Čagalj1 Saurabh Ganeriwal 2 Imad Aad 1 Jean-Pierre Hubaux 1 1 LCA-IC-EPFL 2 NESL-EE-UCLA March 17, 2005 - IEEE Infocom 2005 - Introduction CSMA/CA is the most
More informationPublic Key Cryptography
Public Key Cryptography Introduction Public Key Cryptography Unlike symmetric key, there is no need for Alice and Bob to share a common secret Alice can convey her public key to Bob in a public communication:
More informationA Generalized Eigenmode Algorithm for Reducible Regular Matrices over the Max-Plus Algebra
International Mathematical Forum, 4, 2009, no. 24, 1157-1171 A Generalized Eigenmode Algorithm for Reducible Regular Matrices over the Max-Plus Algebra Zvi Retchkiman Königsberg Instituto Politécnico Nacional,
More informationOn Content Indexing for Off-Path Caching in Information-Centric Networks
On Content Indexing for Off-Path Caching in Information-Centric Networks Suzan Bayhan, Liang Wang, Jörg Ott, Jussi Kangasharju, Arjuna Sathiaseelan, Jon Crowcroft University of Helsinki (Finland), TU Munich
More informationPublic Key Exchange by Neural Networks
Public Key Exchange by Neural Networks Zahir Tezcan Computer Engineering, Bilkent University, 06532 Ankara zahir@cs.bilkent.edu.tr Abstract. This work is a survey on the concept of neural cryptography,
More informationCombinatorial Optimization
Combinatorial Optimization Problem set 8: solutions 1. Fix constants a R and b > 1. For n N, let f(n) = n a and g(n) = b n. Prove that f(n) = o ( g(n) ). Solution. First we observe that g(n) 0 for all
More informationChapter 3: Propositional Calculus: Deductive Systems. September 19, 2008
Chapter 3: Propositional Calculus: Deductive Systems September 19, 2008 Outline 1 3.1 Deductive (Proof) System 2 3.2 Gentzen System G 3 3.3 Hilbert System H 4 3.4 Soundness and Completeness; Consistency
More informationPerfect Omniscience, Perfect Secrecy and Steiner Tree Packing
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing S. Nitinawarat and P. Narayan Department of Electrical and Computer Engineering and Institute for Systems Research University of Maryland College
More informationTransitive Signatures Based on Non-adaptive Standard Signatures
Transitive Signatures Based on Non-adaptive Standard Signatures Zhou Sujing Nanyang Technological University, Singapore, zhousujing@pmail.ntu.edu.sg Abstract. Transitive signature, motivated by signing
More informationDominating Connectivity and Reliability of Heterogeneous Sensor Networks
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks Kenneth A. Berman Email: ken.berman@uc.edu Fred S. Annexstein Email: fred.annexstein@uc.edu Aravind Ranganathan Email: rangana@email.uc.edu
More informationShortest Link Scheduling with Power Control under Physical Interference Model
2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks Shortest Link Scheduling with Power Control under Physical Interference Model Peng-Jun Wan Xiaohua Xu Department of Computer Science
More informationeigenvalue bounds and metric uniformization Punya Biswal & James R. Lee University of Washington Satish Rao U. C. Berkeley
eigenvalue bounds and metric uniformization Punya Biswal & James R. Lee University of Washington Satish Rao U. C. Berkeley separators in planar graphs Lipton and Tarjan (1980) showed that every n-vertex
More informationWireless Network Security Spring 2016
Wireless Network Security Spring 2016 Patrick Tague Class #19 Vehicular Network Security & Privacy 2016 Patrick Tague 1 Class #19 Review of some vehicular network stuff How wireless attacks affect vehicle
More informationLecture 3: Decidability
Lecture 3: Decidability January 11, 2011 Lecture 3, Slide 1 ECS 235B, Foundations of Information and Computer Security January 11, 2011 1 Review 2 Decidability of security Mono-operational command case
More informationCS155: Probability and Computing: Randomized Algorithms and Probabilistic Analysis
CS155: Probability and Computing: Randomized Algorithms and Probabilistic Analysis Eli Upfal Eli Upfal@brown.edu Office: 319 TA s: Lorenzo De Stefani and Sorin Vatasoiu cs155tas@cs.brown.edu It is remarkable
More informationAlphabet Size Reduction for Secure Network Coding: A Graph Theoretic Approach
ALPHABET SIZE REDUCTION FOR SECURE NETWORK CODING: A GRAPH THEORETIC APPROACH 1 Alphabet Size Reduction for Secure Network Coding: A Graph Theoretic Approach Xuan Guang, Member, IEEE, and Raymond W. Yeung,
More informationLow Complexity Variants of the Arrow Distributed Directory 1
Journal of Computer and System Sciences 63, 474 485 (2001) doi:10.1006/jcss.2001.1787, available online at http://www.idealibrary.com on Low Complexity Variants of the Arrow Distributed Directory 1 David
More informationSpanning tree modulus for secure broadcast games
Spanning tree modulus for secure broadcast games Nathan Albin, Kapila Kottegoda and Pietro Poggi-Corradini Department of Mathematics, Kansas State University, Manhattan, KS April 9, 2019 arxiv:1904.03962v1
More informationApplications of the Lopsided Lovász Local Lemma Regarding Hypergraphs
Regarding Hypergraphs Ph.D. Dissertation Defense April 15, 2013 Overview The Local Lemmata 2-Coloring Hypergraphs with the Original Local Lemma Counting Derangements with the Lopsided Local Lemma Lopsided
More informationBOOLEAN MATRIX AND TENSOR DECOMPOSITIONS. Pauli Miettinen TML September 2013
BOOLEAN MATRIX AND TENSOR DECOMPOSITIONS Pauli Miettinen TML 2013 27 September 2013 BOOLEAN MATRIX AND TENSOR DECOMPOSITIONS Boolean decompositions are like normal decompositions, except that Input is
More informationMinimal enumerations of subsets of a nite set and the middle level problem
Discrete Applied Mathematics 114 (2001) 109 114 Minimal enumerations of subsets of a nite set and the middle level problem A.A. Evdokimov, A.L. Perezhogin 1 Sobolev Institute of Mathematics, Novosibirsk
More informationHASH FUNCTIONS 1 /62
HASH FUNCTIONS 1 /62 What is a hash function? By a hash function we usually mean a map h : D {0,1} n that is compressing, meaning D > 2 n. E.g. D = {0,1} 264 is the set of all strings of length at most
More informationRouting Algorithms. CS60002: Distributed Systems. Pallab Dasgupta Dept. of Computer Sc. & Engg., Indian Institute of Technology Kharagpur
Routing Algorithms CS60002: Distributed Systems Pallab Dasgupta Dept. of Computer Sc. & Engg., Indian Institute of Technology Kharagpur Main Features Table Computation The routing tables must be computed
More informationStochastic Analysis of A Randomized Detection Algorithm for Pollution Attack in P2P Live Streaming Systems
Stochastic Analysis of A Randomized Detection Algorithm for Pollution Attack in P2P Live Streaming Systems Yongkun Li John C.S. Lui The Chinese University of Hong Kong Abstract Pollution attack is known
More informationA Characterization of the Cactus Graphs with Equal Domination and Connected Domination Numbers
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 7, 275-281 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7932 A Characterization of the Cactus Graphs with
More informationk-symmetry Model: A General Framework To Achieve Identity Anonymization In Social Networks
k-symmetry Model: A General Framework To Achieve Identity Anonymization In Social Networks Wentao Wu School of Computer Science and Technology, Fudan University, Shanghai, China 1 Introduction Social networks
More informationAttack Graph Modeling and Generation
Attack Graph Modeling and Generation Ratnesh Kumar, Professor, IEEE Fellow Electrical and Computer Engineering, Iowa State University PhD Students: Mariam Ibrahim German Jordanian University Attack Graph:
More informationarxiv: v2 [cs.ni] 25 May 2009
An Algebraic Watchdog for Wireless Network Coding MinJi Kim, Muriel Médard, João Barros, and Ralf Kötter Research Laboratory of Electronics Massachusetts Institute of Technology Cambridge, MA 02139, USA
More informationRELIABLE BIOMETRIC AUTHENTICATION WITH PRIVACY PROTECTION
RELIABLE BIOMETRIC AUTHENTICATION WITH PRIVACY PROTECTION E. VERBITSKIY, P. TUYLS, D. DENTENEER, J.P. LINNARTZ PHILIPS RESEARCH LABORATORIES PROF. HOLSTLAAN 4, AA 5656 EINDHOVEN, THE NETHERLANDS {EVGENY.VERBITSKIY,PIM.TUYLS,DEE.DENTENEER,J.P.LINNARTZ@PHILIPS.COM}
More information1 Primals and Duals: Zero Sum Games
CS 124 Section #11 Zero Sum Games; NP Completeness 4/15/17 1 Primals and Duals: Zero Sum Games We can represent various situations of conflict in life in terms of matrix games. For example, the game shown
More informationProblem: Shortest Common Superstring. The Greedy Algorithm for Shortest Common Superstrings. Overlap graphs. Substring-freeness
Problem: Shortest Common Superstring The Greedy Algorithm for Shortest Common Superstrings Course Discrete Biological Models (Modelli Biologici Discreti) Zsuzsanna Lipták Laurea Triennale in Bioinformatica
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More informationAnalysis of Algorithms. Outline. Single Source Shortest Path. Andres Mendez-Vazquez. November 9, Notes. Notes
Analysis of Algorithms Single Source Shortest Path Andres Mendez-Vazquez November 9, 01 1 / 108 Outline 1 Introduction Introduction and Similar Problems General Results Optimal Substructure Properties
More information