Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/23020
Title: | Adaptive secure key establishment for multicast communications in dynamic networks |
Researcher: | John prakash A |
Guide(s): | Rhymend Uthariaraj V |
Keywords: | Information and communication engineering Multicast Communication Networks Secure key |
Upload Date: | 20-Aug-2014 |
University: | Anna University |
Completed Date: | 01/11/2013 |
Abstract: | Multicast is an efficient way to deliver a message to a group of receivers and has become the basis of many applications Securing multicast communication has been a challenge and hence key establishment always had trade off between efficiency and the level of security This research work s contributions are within the scope of key establishment for secure multicast communication Secure key establishment schemes for multicast communication have been investigated intensively in past two decades All works can be newlineclassified into centralised, decentralised and key agreement schemes The centralised approaches can be classified into pairwise keys broadcast secrets and keys hierarchy Decentralised approaches can be classified into membership driven and time driven rekeying The key agreement approaches can be classified into ring based hierarchical and broadcast cooperation All of these approaches try to increase the efficiency of the key management protocol The motivations of this research work are of manifold Firstly a cryptosystem used for multicast security influences the protocol s performance A cryptosystem which is lightweight can improve the performance but most of the existing key establishment protocols try to customise the cryptosystems designed for point to point communication Secondly computation and communicational overhead can be reduced by minimising the number of rekey packets sent frequency of rekeying and newlinenumber of key translations per multicast packet The number of rekey packets sent per rekeying can be minimised by decoupling rekeying and member dynamism There is hardly any existing protocol that efficiently reduces the frequency of rekeying and also decouples rekeying and member dynamism newline newline |
Pagination: | xiv, 186p. |
URI: | http://hdl.handle.net/10603/23020 |
Appears in Departments: | Faculty of Information and Communication Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title.pdf | Attached File | 33.03 kB | Adobe PDF | View/Open |
02_certificate.pdf | 2.1 MB | Adobe PDF | View/Open | |
03_abstract.pdf | 10.21 kB | Adobe PDF | View/Open | |
04_acknowledgement.pdf | 5.87 kB | Adobe PDF | View/Open | |
05_contents.pdf | 23.83 kB | Adobe PDF | View/Open | |
06_chapter1.pdf | 33 kB | Adobe PDF | View/Open | |
07_chapter2.pdf | 430.39 kB | Adobe PDF | View/Open | |
08_chapter3.pdf | 1.6 MB | Adobe PDF | View/Open | |
09_chapter4.pdf | 812.81 kB | Adobe PDF | View/Open | |
10_chapter5.pdf | 1.46 MB | Adobe PDF | View/Open | |
11_chapter6.pdf | 1.1 MB | Adobe PDF | View/Open | |
12_chapter7.pdf | 20.73 kB | Adobe PDF | View/Open | |
13_references.pdf | 32.79 kB | Adobe PDF | View/Open | |
14_publications.pdf | 6.16 kB | Adobe PDF | View/Open | |
15_vitae.pdf | 5.31 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial 4.0 International (CC BY-NC 4.0).