an adaptive protocol for efficient secure multicasting in wireless lans
Download
Skip this Video
Download Presentation
An Adaptive Protocol for Efficient & Secure Multicasting in Wireless LANS

Loading in 2 Seconds...

play fullscreen
1 / 18

An Adaptive Protocol for Efficient & Secure Multicasting in Wireless LANS - PowerPoint PPT Presentation


  • 54 Views
  • Uploaded on

An Adaptive Protocol for Efficient & Secure Multicasting in Wireless LANS. Sandeep Gupta & Sriram Cherukuri Arizona State University [email protected] Overview. Introduction & Background Problem Statement Related Work System Model Proposed Solution Simulation & Results References.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' An Adaptive Protocol for Efficient & Secure Multicasting in Wireless LANS ' - kim-sparks


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
an adaptive protocol for efficient secure multicasting in wireless lans

An Adaptive Protocol for Efficient & Secure Multicasting in Wireless LANS

Sandeep Gupta & Sriram Cherukuri

Arizona State University

[email protected]

overview
Overview
  • Introduction & Background
  • Problem Statement
  • Related Work
  • System Model
  • Proposed Solution
  • Simulation & Results
  • References
introduction background
Introduction & Background
  • Multicasting in wireless LANS
      • Energy and Bandwidth Constraints
      • Advantages of Multicasting
  • Security Primitives
      • Location Based Access
      • Confidentiality, Integrity, Authenticity,&

Non-repudiation.

  • Applications of Secure Multicast
problem statement
Problem Statement

To build multicast scheme satisfying

  • Basic security primitives.
  • Forward and Backward message secrecy conditions.
  • Performs the above energy efficiently.
related work
Related Work
  • Little work in Secure multicast in wireless networks
  • Kuri proposed protocols for reliable multicast.
  • Bhargavan proposed a scheme based on unicast and public key cryptosystem.
system model
System Model

Group member outside the coverage area

Group member inside the coverage area

Base station

Shared Wireless Channel

Coverage area of base station

Range of base station

Malicious node outside coverage area but inside the range of base station

key establishment
Key Establishment

The key establishment algorithm

  • X => Y: X Hi I am X
  • Y => X: R Prove it
  • X => Y: Ep(hash(R),Sx)
  • Y=>X: Ep(hash(Sx), Sy)
  • K = F(Sx,Sy)
proposed solutions
Proposed Solutions
  • Three solutions presented
      • DSK- Different Session Key

Session Key is unique for each of the multicast group receivers.

      • SSK- Single Session Key

Session Key is common for all the multicast group receivers.

      • Hybrid Scheme

Session Key is common for a subset of the multicast group receivers and unique keys are used for the remainder members.

proposed solutions cont
Proposed Solutions (Cont\')

DSK Algorithm

  • The base station establishes individual session keys with each member node using the protocol explained earlier.
  • When a member leaves the cell, no key exchange is required. The key the base station shared with the departed member is invalidated.
  • When a new member attaches to a base station, the base station establishes a new session key with it.
proposed solutions cont1
Proposed Solutions (Cont\')

SSK Algorithm

  • The base station establishes the same session key with all the members in the cell.
  • When a receiver node leaves the cell, the base station establishes a new session key with the remaining members in the cell. This ensures forward message secrecy.
  • When a new receiver node attaches to a base station, the base station establishes a new session key with all the members of the cell. This ensures backward message secrecy. Here multicasting may be used as explained in the previous section.
proposed solutions cont2
Proposed Solutions (Cont\')

Hybrid Algorithm

  • Nodes classified as stable and unstable nodes based on duration of stay(>ts or not).
  • Common key with stable nodes, unique keys with unstable nodes.
  • The re-keying action varies for stable and unstable node movement.
    • Stable node moves out => re-key stable set.
    • Unstable node moves out => key discarded.
    • New( hence unstable) node enters => new key

established

    • Unstable node stabilizes => re-key stable set.
simulations results
Simulations & Results
  • Simulations performed NS with mobility patterns generated by random way point movement.
  • Metrics: Communicating cost, Mobility
  • Results summarized in table.
optimization primitives
Optimization Primitives
  • Batch Re-Keying

The requests for re-keying are aggregated over a period of time and then processed. The batch interval is parameter

optimizations and results
Optimizations and results
  • Group Communication for Key Distribution

When a node new node enters we use the old key to multicast the new key to the older members

references
References
  • ANSI/IEEE Standard 802.11, In 1999 Edition,
  • J.Kuri and S.K.Kasera, Reliable Multicast in Multi access Wireless LANs, In IEEE INFOCOM ’99, 1999,
  • L.R.Dondeti, S.Mukherjee, A.Samal, Scalable secure one to many communication using dual encryption, In Computer Communications, Volume 23,Issue 17, Pages 1581-1723 (November 2000)
  • V.Bharghavan, Secure Wireless LANs, In ACM Conference on Computers and Communications Security ’94,; Fairfax, VA.
  • D. Bruschi and E. Rosti, Secure Multicast in Wireless Networks of Mobile Hosts:Protocols and Issues http://citeseer.nj.nec.com/295645.html.
slide17
B.Schneier Applied Cryptography,Protocols,Algorithms and source code in C Second Edition.John Wiley & Sons
  • X.S.Li, Y.R.Yang, M.G.Gouda,S.S.Lam Batch Rekeying for Secure Group Communications Tenth international World Wide Web Conference,Hong Kong,China May 2001
  • http://www.isi.edu/nsnam/ns
  • J.B. Lacy, D. P. Mitchell, and W. M. Schell CryptoLib:Cryptography in software Proc USEN1X4th UN1XSecurity Symp., Oct. 1993.
  • Marc Langheinrich Privacy by Design - Principles of Privacy-Aware UbiquitousSystems Proceedings of Ubicomp 2001, September 30 - October 2, 2001, Atlanta, GA.
ad