J.-H. Cho, I.-R. Chen, M. Eltoweissy ACM/Springer Wireless Networks, 2007 Presented by: Mwaffaq Otoom CS5214 – Spring © 2007 On optimal batch re-keying.

Slides:



Advertisements
Similar presentations
Hierarchical Trust Management for Wireless Sensor Networks and its Applications to Trust-Based Routing and Intrusion Detection Presented by: Vijay Kumar.
Advertisements

Mitigating Routing Misbehavior in Mobile Ad-Hoc Networks Reference: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks, Sergio Marti, T.J. Giuli,
MMOM: Efficient Mobile Multicast Support Based on the Mobility of Mobile Hosts YUNGOO HUH and CHEEHA KIM Presented by Kiran Kumar Bankupally.
A key agreement protocol using mutual Authentication for Ad-Hoc Networks IEEE 2005 Authors : Chichun Lo, Chunchieh Huang, Yongxin Huang Date : 2005_11_29.
A Survey of Key Management for Secure Group Communications Celia Li.
Hadi Goudarzi and Massoud Pedram
A hierarchical key management scheme for secure group communications in mobile ad hoc networks Authors: Nen-Chung Wang and Shian-Zhang Fang Sources: The.
Smart Routers for Cross-Layer Integrated Mobility and Service Management in Mobile IPv6 Systems Authors: Ding-Chau Wang. Weiping He. Ing-Ray Chen Presented.
Group Protocols for Secure Wireless Ad hoc Networks Srikanth Nannapaneni Sreechandu Kamisetty Swethana pagadala Aparna kasturi.
1 Performance Char’ of Region- Based Group Key Management --- in Mobile Ad Hoc Networks --- by Ing-Ray Chen, Jin-Hee Cho and Ding-Chau Wang Presented by.
URSA: Providing Ubiquitous and Robust Security Support for MANET
LOGO Multi-user Broadcast Authentication in Wireless Sensor Networks ICU Myunghan Yoo.
Load Balancing of Elastic Traffic in Heterogeneous Wireless Networks Abdulfetah Khalid, Samuli Aalto and Pasi Lassila
KAIS T Distributed Collaborative Key Agreement and Authentication Protocols for Dynamic Peer Groups IEEE/ACM Trans. on Netw., Vol. 14, No. 2, April 2006.
1 Stochastic Event Capture Using Mobile Sensors Subject to a Quality Metric Nabhendra Bisnik, Alhussein A. Abouzeid, and Volkan Isler Rensselaer Polytechnic.
Secure Multicast (II) Xun Kang. Content Batch Update of Key Trees Reliable Group Rekeying Tree-based Group Diffie-Hellman Recent progress in Wired and.
ZIGZAG A Peer-to-Peer Architecture for Media Streaming By Duc A. Tran, Kien A. Hua and Tai T. Do Appear on “Journal On Selected Areas in Communications,
Secure Multicast Xun Kang. Content Why need secure Multicast? Secure Group Communications Using Key Graphs Batch Update of Key Trees Reliable Group Rekeying.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
Detecting Network Intrusions via Sampling : A Game Theoretic Approach Presented By: Matt Vidal Murali Kodialam T.V. Lakshman July 22, 2003 Bell Labs, Lucent.
Secure Group Communications Using Key Graphs Chung Kei Wong, Member, IEEE, Mohamed Gouda Simon S. Lam, Fellow, IEEE Evgenia Gorelik Yuksel Ucar.
Distributed Collaborative Key Agreement Protocols for Dynamic Peer Groups Patrick P. C. Lee, John C. S. Lui and David K. Y. Yau IEEE ICNP 2002.
Providing Smoother Quality Layered Video Stream Shirhari Nelakuditi Raja R Harinath Ewa Kusmierek Zhi-Li Zhang Proceedings of NOSSDAV 2000.
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
Group Key Distribution Chih-Hao Huang
Slide 1 Comparison of Inter-Area Rekeying Algorithms for Secure Mobile Group Communication C. Zhang*, B. DeCleene +, J. Kurose*, D. Towsley* * Dept. Computer.
Effect Of Intrusion Detection on Reliability of Mission-Oriented Mobile Group Systems in Mobile Ad Hoc Networks Author: J.H. Cho, I.R. Chen and P.G. Feng.
Effect of Intrusion Detection on Reliability Jin-Hee Cho, Member, IEEE, Ing-Ray Chen, Member, IEEE, and Phu-Gui Feng IEEE TRANSACTIONS ON RELIABILITY,
Integrated Social and Quality of Service Trust Management of Mobile Groups in Ad Hoc Networks Ing-Ray Chen, Jia Guo, Fenye Bao, Jin-Hee Cho Communications.
1 On Failure Recoverability of Client-Server Applications in Mobile Wireless Environments Ing-Ray Chen, Baoshan Gu, Sapna E. George and Sheng- Tzong Cheng.
Trust-based Multi-Objective Optimization for Node-to-Task Assignment in Coalition Networks 1 Jin-Hee Cho, Ing-Ray Chen, Yating Wang, and Kevin S. Chan.
Network Aware Resource Allocation in Distributed Clouds.
Hierarchical agent-based secure and reliable multicast in wireless mesh networks Yinan LI, Ing-Ray Chen Robert Weikel, Virginia Sistrunk, Hung-Yuan Chung.
On QoS Guarantees with Reward Optimization for Servicing Multiple Priority Class in Wireless Networks YaoChing Peng Eunyoung Chang.
Overlay Network Physical LayerR : router Overlay Layer N R R R R R N.
Dynamic agent-based hierarchical multicast for wireless mesh networks Yinan Li, Ing Ray Chen Presented by Kruthika Rathinavel.
Secure Group Communication: Key Management by Robert Chirwa.
Chapter 3 System Performance and Models. 2 Systems and Models The concept of modeling in the study of the dynamic behavior of simple system is be able.
Utilizing Call Admission Control for Pricing Optimization of Multiple Service Classes in Wireless Cellular Networks Authors : Okan Yilmaz, Ing-Ray Chen.
Project guide Dr. G. Sudha Sadhasivam Asst Professor, Dept of CSE Presented by C. Geetha Jini (07MW03)
Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai 28 October 2003.
Fall, Privacy&Security - Virginia Tech – Computer Science Click to edit Master title style Collusion-Resistant Group Key Management Using Attribute-
Improving MBMS Security in 3G Wenyuan Xu Rutgers University.
Mobility Management in Wireless Mesh Networks Utilizing Location Routing and Pointer Forwarding Bing Wang.
SIA: Secure Information Aggregation in Sensor Networks B. Przydatek, D. Song, and A. Perrig. In Proc. of ACM SenSys 2003 Natalia Stakhanova cs610.
1 Distributed and Collaborative Key Agreement Protocols with Authentication and Implementation for Dynamic Peer Groups Patrick P. C. Lee.
A secure re-keying scheme Introduction Background Re-keying scheme User revocation User join Conclusion.
Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
K-Anycast Routing Schemes for Mobile Ad Hoc Networks 指導老師 : 黃鈴玲 教授 學生 : 李京釜.
Scalable and Reliable Key Distribution 1/ Ryuzou NISHI † † Institute of Systems & Information Technologies (ISIT)
Optimal Batch Rekeying for Secure Group Communications in Wireless Networks Authors: Jin-Hee Cho, Ing-ray Chen, Mohamed Eltoweissy Presented by Niharika.
On Reducing Mesh Delay for Peer- to-Peer Live Streaming Dongni Ren, Y.-T. Hillman Li, S.-H. Gary Chan Department of Computer Science and Engineering The.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Weichao Wang, Bharat Bhargava Youngjoo, Shin
Security for Broadcast Network
Efficient Group Key Management in Wireless LANs Celia Li and Uyen Trang Nguyen Computer Science and Engineering York University.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
MITRE 7 April 2009 CS 5214 Presenter: Phu-Gui Feng Performance Analysis of Distributed IDS Protocols for Mobile GCS Dr. Jin-Hee Cho, Dr. Ing-Ray Chen MITRE.
Hierarchical Trust Management for Wireless Sensor Networks and Its Applications to Trust-Based Routing and Intrusion Detection Wenhai Sun & Ruide Zhang.
Authors: Ing-Ray Chen and Ding-Chau Wang Presented by Chaitanya,Geetanjali and Bavani Modeling and Analysis of Regional Registration Based Mobile Service.
Design and Implementation of Secure Layer over UPnP Networks Speaker: Chai-Wei Hsu Advisor: Dr. Chin-Laung Lei.
1 Using Network Coding for Dependent Data Broadcasting in a Mobile Environment Chung-Hua Chu, De-Nian Yang and Ming-Syan Chen IEEE GLOBECOM 2007 Reporter.
1 Minimum Interference Algorithm for Integrated Topology Control and Routing in Wireless Optical Backbone Networks Fangting Sun Mark Shayman University.
Presented by Rukmini and Diksha Chauhan Virginia Tech 2 nd May, 2007 Movement-Based Checkpointing and Logging for Recovery in Mobile Computing Systems.
A New Class of Mobility Models for Ad Hoc Wireless Networks Rahul Amin Advisor: Dr. Carl Baum Clemson University SURE 2006.
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
OPERATING SYSTEMS CS 3502 Fall 2017
Source: Computers & Security, vol.23, pp , 2004 Author: Heba K. Aslan
Presentation transcript:

J.-H. Cho, I.-R. Chen, M. Eltoweissy ACM/Springer Wireless Networks, 2007 Presented by: Mwaffaq Otoom CS5214 – Spring © 2007 On optimal batch re-keying for secure group communications in wireless networks

Agenda Introduction Contributions System model and assumptions Threshold-based batch re-keying. Performance model. Numerical results and analysis. Conclusions Future work.

Introduction Cost-effective secure group communication –Symmetric key - group key Dynamic group –Forward secrecy –Backward secrecy Re-keying –Individual re-keying –Periodic batch re-keying

Contributions Develops new threshold-based batch rekeying schemes. Identifies an optimal rekey interval for each scheme that would minimize the communication cost per join/leave operation while satisfying secrecy and delay constraints. Measures performance metrics for finding an optimal batch rekey interval using SPN models.

System Model & Assumptions Central key distribution server. –Key tree based on LKH, why? Inter-arrival times of join and leave requests are exponentially distributed with rates λ and µ, respectively, why? A user can not join the group unless it is authorized by the server. –Trusted/un-trusted join/leave.

Threshold-based periodic batch rekeying The behavior of periodic batch rekeying schemes can be described by a state machine with 3-component state representation (a, b, c) –a: number of trusted join requests –b: number of trusted leave requests –c: number of untrusted leave requests

Threshold-based periodic batch rekeying Threshold-based batch rekeying schemes: –Untrusted Leave Threshold-based (ULT) –Trusted and Untrusted Double Threshold- based (TAUDT) –Join and Leave Double Threshold-based (JALDT)

Threshold-based periodic batch rekeying Probability of trustworthiness (P t ) is given in all three schemes. Only untrusted leave requests need to be considered by the key server.

Threshold-based periodic batch rekeying Application-specific constraints: –P v : probability of (forward) secrecy violation –D: delay occurred due to periodic batch rekeying

Threshold-based periodic batch rekeying The key server applies the following procedure when performing a rekeying operation at the end of each batch interval: –if a > b+c, then the server will process b+c join-leave request pairs before processing a – (b+c) join requests; –if a = b+c, then the server will process b+c join-leave request pairs; –if a < b+c, then the server will process a join-leave A new join member can take the place of a leave member in the key tree. –The server only needs to generate new keys along the paths of the leave members and give the new keys to the new join member.

Performance model Notation

Performance model (ULT) The average batch rekey interval in ULT (T) For ULT, the state of the system representation at the end of each batch rekeying interval

Performance model (ULT) The total communication overhead bits (C m ) in ULT Average communication overhead delay for batch rekey (S cm )

Performance model (ULT) Average communication overhead delay per join/leave (S) in ULT Average probability of secrecy violation (P v ) in ULT The delay per join/leave operation (D) in ULT

Performance Model For TAUDT and JALDT, there are too many states, thus, SPN model is developed to measure performance metrics.

Performance Model

Average communication overhead delay per join/leave (S): Average probability of secrecy violation (P v ):

Performance Model The delay per join/leave operation (D):

Numerical results and analysis Constants: –Number of members in the group (N) is set to 1024 –The length of each key (J) is 64 bits –Average overhead for broadcasting (T b ) is 5msec –Network bandwidth (BW) is 1 Mbps Variables: –Ratio arrival rate of join requests to the arrival rates of leave request (λ : µ) –Probability of trustworthiness (P t )

Numerical results and analysis

Conclusions An optimal rekeying interval (T) exists under each of these schemes By varying the Pv and (λ : µ), TAUDT is able to produce the minimum S and the maximum T. As Pt increases, minimum S decreases and T increases. As µ increases, minimum S increases and optimal T decreases

Future work Analyzing the effects of insider attacks and intrusion detection system design on the security and performance prosperities of group communications in wireless systems. Add reliability and availability to the SPN model. Investing the issue of optimal batch rekeying for the case in which a group consists of multiple subgroups.

Questions Thank you