![Page 1: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/1.jpg)
J.-H. Cho, I.-R. Chen, M. Eltoweissy
ACM/Springer Wireless Networks, 2007
Presented by: Mwaffaq OtoomCS5214 – Spring © 2007
On optimal batch re-keying for secure group communications in
wireless networks
![Page 2: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/2.jpg)
Agenda
• Introduction• Contributions• System model and assumptions• Threshold-based batch re-keying.• Performance model.• Numerical results and analysis.• Conclusions• Future work.
![Page 3: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/3.jpg)
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
![Page 4: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/4.jpg)
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.
![Page 5: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/5.jpg)
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.
![Page 6: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/6.jpg)
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
![Page 7: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/7.jpg)
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)
![Page 8: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/8.jpg)
Threshold-based periodic batch rekeying
• Probability of trustworthiness (Pt) is given in all three schemes.
• Only untrusted leave requests need to be considered by the key server.
![Page 9: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/9.jpg)
Threshold-based periodic batch rekeying
• Application-specific constraints:– Pv: probability of (forward) secrecy violation
– D: delay occurred due to periodic batch rekeying
![Page 10: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/10.jpg)
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.
![Page 11: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/11.jpg)
Performance model
• Notation
![Page 12: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/12.jpg)
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
![Page 13: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/13.jpg)
Performance model (ULT)
• The total communication overhead bits (Cm) in ULT
• Average communication overhead delay for batch rekey (Scm)
![Page 14: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/14.jpg)
Performance model (ULT)
• Average communication overhead delay per join/leave (S) in ULT
• Average probability of secrecy violation (Pv) in ULT
• The delay per join/leave operation (D) in ULT
![Page 15: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/15.jpg)
Performance Model
• For TAUDT and JALDT, there are too many states, thus, SPN model is developed to measure performance metrics.
![Page 16: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/16.jpg)
Performance Model
![Page 17: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/17.jpg)
Performance Model
![Page 18: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/18.jpg)
Performance Model
• Average communication overhead delay per join/leave (S):
• Average probability of secrecy violation (Pv):
![Page 19: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/19.jpg)
Performance Model
• The delay per join/leave operation (D):
![Page 20: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/20.jpg)
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 (Tb) 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 (Pt)
![Page 21: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/21.jpg)
Numerical results and analysis
![Page 22: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/22.jpg)
Numerical results and analysis
![Page 23: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/23.jpg)
Numerical results and analysis
![Page 24: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/24.jpg)
Numerical results and analysis
![Page 25: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/25.jpg)
Numerical results and analysis
![Page 26: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/26.jpg)
Numerical results and analysis
![Page 27: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/27.jpg)
Numerical results and analysis
![Page 28: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/28.jpg)
Numerical results and analysis
![Page 29: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/29.jpg)
Numerical results and analysis
![Page 30: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/30.jpg)
Numerical results and analysis
![Page 31: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/31.jpg)
Numerical results and analysis
![Page 32: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/32.jpg)
Numerical results and analysis
![Page 33: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/33.jpg)
Numerical results and analysis
![Page 34: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/34.jpg)
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
![Page 35: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/35.jpg)
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.
![Page 36: 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](https://reader035.vdocuments.mx/reader035/viewer/2022062805/5697c0151a28abf838cce1ad/html5/thumbnails/36.jpg)
Questions
Thank you