1 / 13

An Efficient Group Key Generation in the Battlefield

An Efficient Group Key Generation in the Battlefield. Jin Wook Byun byunstar@korea.ac.kr CIST & GSIS, Korea University. Nov. 16. 2005. Contents. Multi-layer ad hoc Network (Battlefield) Password-based key exchange protocols An efficient Group Key Generation in Battlefield Conclusion.

rianna
Download Presentation

An Efficient Group Key Generation in the Battlefield

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. An Efficient Group Key Generation in the Battlefield Jin Wook Byun byunstar@korea.ac.kr CIST & GSIS, Korea University Nov. 16. 2005

  2. Contents • Multi-layer ad hoc Network (Battlefield) • Password-based key exchange protocols • An efficient Group Key Generation in Battlefield • Conclusion

  3. Multi-layer Ad-hoc Network • Multi-layer Ad-hoc Network • Ground MANET • Includes regular ground mobile nodes (GN) • GN is equipped with limited powers. • Ground mobile backbone network • Includes special fighting nodes such as tanks. • Tanks may carry a lot equipment than soldiers. • Unmanned aerial vehicles (UAV) • UAV maintains a station that at an altitude of 50 thousands feet by flying a circle.

  4. Motivation & Contributions • Motivations • Second and third layers > the first layer • Communicational and computational power !! • The first Ground MANET • Various physical attacks and bombs with dynamic changing network configuration • Lightweight, convenient, and secure cryptographic solutions should be applied to soldiers • N-Party EKE-D Protocol • Constant round - lightweight • Distinct Human-memorable passwords - convenient • Dynamic setting - MANET Battlefield !!

  5. Password-based Key Exchange • Goal • Confidentiality, Integrity • Application • Building secure communications in cryptographic protocols such as IPSec, SSL. • Password-based Key Exchange (PAKE) • Shared Password-Authenticated Model • Provides PAKE between a client and server using shared password • Different Password-based Authenticated Key Exchange (DPWA) • Provides PAKE between a client and a client using different passwords

  6. Password-based Key Exchange • Brief History in this area • Different Password- Authentication Model (DPWA) • Two party • 1995, Steiner et al. : 3-Party EKE • 1998, Lin et al. : LSSH-3PEKE • 2002, Byun et al. : C2C-PAKE • 2005, Byun et al. : efficient and provably secure C2C-PAKE • 2005, Abdalla et al. : Generic construction of a 3-party protocol • N-party • 2005, Byun et al. suggested N-party EKE protocols • 2005, Byun et al. suggested N-party EKE secure against insider attacks.

  7. Model and Definition • NEKE Security • Assumption • Computational Diffie-Hellman Assumption Asks queries Test Query Coin toss b If b=1, real skSK Else, random strSK SK Guess b’

  8. N-party EKE-D • Setup Algorithm

  9. N-party EKE-D • Leave Algorithm

  10. registration registration N-party EKE-D • Join Algorithm

  11. Security Results • N-party EKE-D • # of send, hash, enc/dec queries : • Forward Secrecy • Backward Secrecy

  12. Conclusion • N-Party EKE-D • Different passwords • Constant round • Provable security • Dynamic scenario • On Going works • We are now designing a general key management framework covering all layers of Multi-layer ad-hoc networks

  13. Thank you very much !!Q & AE-mail address : byunstar@korea.ac.kr

More Related