Secure and Efficient Key Management in Mobile Ad Hoc Networks Bing Wu, Jie Wu, Eduardo B. Fernandez, Mohammad Ilyas, Spyros Magliveras Department of Computer.

Slides:



Advertisements
Similar presentations
An Alternative to Short Lived Certificates By Vipul Goyal Department of Computer Science & Engineering Institute of Technology Banaras Hindu University.
Advertisements

Chapter 14 – Authentication Applications
1 Efficient Self-Healing Group Key Distribution with Revocation Capability by Donggang Liu, Peng Ning, Kun Sun Presented by Haihui Huang
Authors: Yanchao Zhang, Member, IEEE, Wei Liu, Wenjing Lou,Member, IEEE, and Yuguang Fang, Senior Member, IEEE Source: IEEE TRANSACTIONS ON DEPENDABLE.
Group Protocols for Secure Wireless Ad hoc Networks Srikanth Nannapaneni Sreechandu Kamisetty Swethana pagadala Aparna kasturi.
Cryptography and Network Security
Efficient Public Key Infrastructure Implementation in Wireless Sensor Networks Wireless Communication and Sensor Computing, ICWCSC International.
A Survey of Secure Wireless Ad Hoc Routing
Sec-TEEN: Secure Threshold sensitive Energy Efficient sensor Network protocol Ibrahim Alkhori, Tamer Abukhalil & Abdel-shakour A. Abuznied Department of.
1 An Energy-Efficient Unequal Clustering Mechanism for Wireless Sensor Networks Chengfa Li, Mao Ye, Guihai Chen State Key Laboratory for Novel Software.
LOGO Multi-user Broadcast Authentication in Wireless Sensor Networks ICU Myunghan Yoo.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
PROVIDING ROBUST AND UBIQUITOUS SECURITY SUPPORT FOR MOBILE AD- HOC NETWORKS Georgios Georgiadis 6/5/2008.
IP Security IPSec 2 * Essential Network Security Book Slides. IT352 | Network Security |Najwa AlGhamdi 1.
Authentication Cristian Solano. Cryptography is the science of using mathematics to encrypt and decrypt data. Public Key Cryptography –Problems with key.
WAP Public Key Infrastructure CSCI – Independent Study Fall 2002 Jaleel Syed Presentation No 5.
Public-key based. Public-key Techniques based Protocols –may use either weak or strong passwords –high computation complexity (Slow) –high deployment.
Nov.6, 2002 Secure Routing Protocol for Ad Hoc Networks Li Xiaoqi.
Random Access MAC for Efficient Broadcast Support in Ad Hoc Networks Ken Tang, Mario Gerla Computer Science Department University of California, Los Angeles.
1 Key Management in Mobile Ad Hoc Networks Presented by Edith Ngai Spring 2003.
Wireless Security In wireless networks. Security and Assurance - Goals Integrity Modified only in acceptable ways Modified only by authorized people Modified.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
Trust Level Based Self-Organized Routing Protocol for Secure Ad Hoc Networks Li Xiaoqi, GiGi 12/3/2002.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
A Lightweight Hop-by-Hop Authentication Protocol For Ad- Hoc Networks Speaker: Hsien-Pang Tsai Teacher: Kai-Wei Ke Date:2005/01/20.
Chapter 8 Web Security.
1 Authentication Protocols Celia Li Computer Science and Engineering York University.
MOCA : Mobile Certificate Authority for Wireless Ad Hoc Networks The 2nd Annual PKI Research Workshop (PKI 2003) Seung Yi, Robin Kravets September. 25,
By Jyh-haw Yeh Boise State University ICIKM 2013.
Brian Padalino Sammy Lin Arnold Perez Helen Chen
1 Anonymous Roaming Authentication Protocol with ID-based Signatures Lih-Chyau Wuu Chi-Hsiang Hung Department of Electronic Engineering National Yunlin.
Key Distribution and Update for Secure Inter- group Multicast Communication Ki-Woong Park Computer Engineering Research Laboratory Korea Advanced Institute.
An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks Authors: A. Boukerche, K. El-Khatib, L. Xu, L. Korba.
GZ06 : Mobile and Adaptive Systems A Secure On-Demand Routing Protocol for Ad Hoc Networks Allan HUNT Wandao PUNYAPORN Yong CHENG Tingting OUYANG.
Security for the Optimized Link- State Routing Protocol for Wireless Ad Hoc Networks Stephen Asherson Computer Science MSc Student DNA Lab 1.
A Security-Aware Routing Protocol for Wireless Ad Hoc Networks
1 Section 10.9 Internet Security Association and Key Management Protocol ISAKMP.
02/22/2005 Joint Seminer Satoshi Koga Information Technology & Security Lab. Kyushu Univ. A Distributed Online Certificate Status Protocol with Low Communication.
SOS: Security Overlay Service Angelos D. Keromytis, Vishal Misra, Daniel Rubenstein- Columbia University ACM SIGCOMM 2002 CONFERENCE, PITTSBURGH PA, AUG.
Cryptography and Network Security (CS435) Part Fourteen (Web Security)
Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai 28 October 2003.
Key Management. Session and Interchange Keys  Key management – distribution of cryptographic keys, mechanisms used to bind an identity to a key, and.
sec1 IEEE MEDIA INDEPENDENT HANDOVER DCN: sec Title: TGa_Proposal_Antonio_Izquierdo (Protecting the Information Service.
15.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Key Management.
Merkle trees Introduced by Ralph Merkle, 1979 An authentication scheme
Secure and efficient key management in mobile ad hoc networks Authors: Bing Wu, Jie Wu, Eduardo B. Fernandez, Mohammad Ilyas, and Spyros Magliveras Sources:
K-Anycast Routing Schemes for Mobile Ad Hoc Networks 指導老師 : 黃鈴玲 教授 學生 : 李京釜.
1 Network Security Lecture 7 Overview of Authentication Systems Waleed Ejaz
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
Pairing Based Cryptography Standards Terence Spies VP Engineering Voltage Security
Establishing authenticated channels and secure identifiers in ad-hoc networks Authors: B. Sieka and A. D. Kshemkalyani (University of Illinois at Chicago)
Weichao Wang, Bharat Bhargava Youngjoo, Shin
Interleaving and Collusion Attacks on a Dynamic Group Key Agreement Scheme for Low-Power Mobile Devices * Junghyun Nam 1, Juryon Paik 2, Jeeyeon Kim 2,
1 An Ordered Multi-Proxy Multi-Signature Scheme Authors: Min-Shiang Hwang, Shiang-Feng Tzeng, Shu-Fen Chiou Speaker: Shu-Fen Chiou.
1 Self-Certified Group Key-Generation for Ad Hoc Clusters in Wireless Sensor Networks Ortal Arazi, Hairong Qi Dept. Electrical & Computer Engineering The.
Mobile Networks and Applications (January 2007) Presented by J.H. Su ( 蘇至浩 ) 2016/3/21 OPLab, IM, NTU 1 Joint Design of Routing and Medium Access Control.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai Supervised.
Computer Science Least Privilege and Privilege Deprivation: Towards Tolerating Mobile Sink Compromises in Wireless Sensor Network Presented by Jennifer.
Indian Institute Of Technology, Delhi Page 1 Enhancements in Security, Performance Modeling and Optimization in Vehicular Networks Ashwin Rao 2006SIY7513.
Key management issues in PGP
Presented by Edith Ngai MPhil Term 3 Presentation
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Golden Linear Group Key Agreement Protocol
Cryptography and Network Security
Information Security message M one-way hash fingerprint f = H(M)
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Path key establishment using multiple secured paths in wireless sensor networks CoNEXT’05 Guanfeng Li  University of Pittsburgh, Pittsburgh, PA Hui Ling.
Digital Certificates and X.509
Cryptography and Network Security
Presentation transcript:

Secure and Efficient Key Management in Mobile Ad Hoc Networks Bing Wu, Jie Wu, Eduardo B. Fernandez, Mohammad Ilyas, Spyros Magliveras Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431, USA Department of Mathematics, Florida Atlantic University, Boca Raton, FL 33431, USA Journal of Network and Computer Application Present: Jhoong-Wei Chen

Introduction The ad hoc networks security Introduce a secure and efficient key management scheme(SEKM) The basic idea is that server nodes form an underlying service group

Key Management in Ad Hoc Networks Trust models

Secure and Efficient Key Management (SEKM) Scheme Notation and assumption –that every node carries a valid certificate from off-line configuration before entering the network

Secure and Efficient Key Management (SEKM) Scheme The overview of SEKM –K ca -1 is distributed to m shareholders (server) –A quorum of k(1<k≤m) servers (server group) can produce a valid certificate –SEKM group maintenance phases share updating phases certificate renew/revocation phases handling new server nodes phases

Secure and Efficient Key Management (SEKM) Scheme Secure server group formation and maintenance –Use mesh structure –only server nodes initiate the group formation and become members of the group –A subset of non-server nodes could be forwarding nodes –the tree-based structure is easy to break in a high dynamic situation and incurs excessive control traffic –Soft state

Secure and Efficient Key Management (SEKM) Scheme Group Creation –When a secret shareholder enters the network, it broadcasts a JoinServeReq: {ID i, SEQ i, TTL} {[h(ID i, SEQ i )]K i -1 |(TTL)K i -1 } –When a node –receives a non-duplicate JoinServerReq packet, it needs to verify that the packet is from the authenticated source –The TTL value decreases by 1 as the packet leaves intermediate node. The change of TTL is signed by intermediate nodes

Secure and Efficient Key Management (SEKM) Scheme –If the server node receive JoinServerReq it will send a JoinServerReply packet as well as forwarding the request packet. –JoinServerReply packet is also protected by the replier’s signature

Secure and Efficient Key Management (SEKM) Scheme Group maintenance –for a mesh structure, there are multiple possible paths between pairs of servers –the periodical message JoinServerRequest and JoinServerReply are sent out

Secure and Efficient Key Management (SEKM) Scheme Secret share updating –k servers within the server group initiate the share update phase –At every round every server i generates a random number β i between 0 and 1 and a threshold value τ i. τ i is defined as

Secure and Efficient Key Management (SEKM) Scheme Secret share updating

Secure and Efficient Key Management (SEKM) Scheme Handling new servers –server group updates shares periodically, a new joining node could carry an outdated share from off-line configuration –A message could be –A message sent out to notify requesting node r by checking the version field in the certificate

Secure and Efficient Key Management (SEKM) Scheme Certificate updating

Secure and Efficient Key Management (SEKM) Scheme Certificate updating

Secure and Efficient Key Management (SEKM) Scheme Handling certificate expiration and revocation –A certificate will expire after a predetermined period of time –In this paper, for simplicity, a –node with an expired certificate needs some off-line or in-person reconfiguration –A node’s certificate could be revoked by the server group within its validity period for several reasons

Performance evaluation Assumption –100 X100 2-D free-space –from 40 to 100 nodes –transmission range r =25 –1024-bit RSA cryptographic key pairs –The coefficients of the polynomial are 512 bits long. –hashed using MD5 –implemented in Matlab.

Performance evaluation

Conclusion In this paper we propose a key management scheme, SEKM, which creates a PKI structure for this type of Ad Hoc Networks SEKM is that it is easier for a node to request service from a well maintained group rather than from multiple ‘‘independent’’ service providers which may be spread in a large area.

Appendix Key agreement protocol: A key agreement protocol or mechanism is a key establishment technique in which a shared secret is derived by two (or more) parties as a function of information contributed by, or associated with, each of these, (ideally) such that no party can predetermine the resulting value. Key management protocol: