project orda secure key distribution over ad hoc networks n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Project Orda Secure Key Distribution Over Ad Hoc Networks PowerPoint Presentation
Download Presentation
Project Orda Secure Key Distribution Over Ad Hoc Networks

Loading in 2 Seconds...

play fullscreen
1 / 11

Project Orda Secure Key Distribution Over Ad Hoc Networks - PowerPoint PPT Presentation


  • 105 Views
  • Uploaded on

Project Orda Secure Key Distribution Over Ad Hoc Networks. Security in Ad Hoc Networks – Team A Lane Westlund, Roderic Campbell, Mark Allen, Dima Novikov, David Campbell. Agenda. Review of Iolus, Key Graph Theories Goals & Non-Goals Schedule Review Current Status System Overview

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 'Project Orda Secure Key Distribution Over Ad Hoc Networks' - jamese


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
project orda secure key distribution over ad hoc networks

Project OrdaSecure Key Distribution Over Ad Hoc Networks

Security in Ad Hoc Networks – Team A

Lane Westlund, Roderic Campbell, Mark Allen, Dima Novikov, David Campbell

agenda
Agenda
  • Review of Iolus, Key Graph Theories
  • Goals & Non-Goals
  • Schedule Review
  • Current Status
  • System Overview
  • Testing & Performance
  • Demonstration
review of iolus key graph theories
Review of Iolus, Key Graph Theories
  • Goal of the Papers: Scalable, secure strategy for securely distributing re-key messages
  • As previously explained, Group-Oriented Re-keying:
    • Takes advantage of multicasting to send re-key messages
    • Needs small number of messages on join/leave
    • Outperforms User- and Key-Oriented Re-key
review of iolus key graph theories cont d
Review of Iolus, Key Graph Theories (Cont’d)
  • Problems with paper:
    • Makes assumptions about server’s capabilities
    • Ignores common problems (mass drop-off, etc.)
    • Doesn’t map well to ad hoc setting
goals non goals
Goals & Non-Goals
  • Goals
    • Secure Key Distribution
    • Scalable Key Distribution
    • No Static Central Authority/Server
    • Dynamic Topology
    • Mass Drop-Off Tolerant
    • Unique Keys for Each Server
goals non goals1
Goals & Non-Goals
  • Non-Goals
    • User authentication
    • Access control
    • Malicious initial user
    • Preventing attacks by trusted members
    • Simultaneous joins
system overview
System Overview
  • Implemented our own rekeying algorithm, which uses ideas from the Iolus and Key Graph papers.
  • Minimizes necessary messages for secure key distribution
  • Algorithm example...
schedule
Week 5:

Implementation

Class testing

Limited integration

Code review

Week 6:

Implementation

Unit testing (contractual)

Unit integration

Code review

Week 7:

Full integration

Stress testing

Documentation finalization

Week 8:

Submit project

Schedule
current status
Current Status
  • Not Mass-Join Tolerant
  • Synchronization Issues
  • Demo Application Works with Orda
testing performance
Testing & Performance
  • Constant-time (roughly 12 seconds on CS machines) system updating after a user has left
  • Could not test scalability effectively
demonstration questions
Demonstration & Questions
  • Code, javadoc, paper on website: http://www.cs.rit.edu/~p590-01a/