1 / 11

Project Orda Secure Key Distribution Over Ad Hoc Networks

Explore the secure distribution of re-key messages in ad hoc networks. This project aims to develop a scalable and secure strategy by leveraging group-oriented re-keying and dynamic topology. Follow our progress and system overview for testing and performance insights.

pavone
Download Presentation

Project Orda Secure Key Distribution Over Ad Hoc Networks

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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

  2. Agenda • Review of Iolus, Key Graph Theories • Goals & Non-Goals • Schedule Review • Current Status • System Overview • Testing & Performance • Demonstration

  3. 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

  4. 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

  5. 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

  6. Goals & Non-Goals • Non-Goals • User authentication • Access control • Malicious initial user • Preventing attacks by trusted members • Simultaneous joins

  7. 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...

  8. 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

  9. Current Status • Not Mass-Join Tolerant • Synchronization Issues • Demo Application Works with Orda

  10. Testing & Performance • Constant-time (roughly 12 seconds on CS machines) system updating after a user has left • Could not test scalability effectively

  11. Demonstration & Questions • Code, javadoc, paper on website: http://www.cs.rit.edu/~p590-01a/

More Related