Broadcast Encryption with Short Cipher Texts using Adhoc on Demand Distance Vector (AODV)
R. Rameswari
R. Rameswari, PG scholar, Department of Computer Science and Engineering, SRM University, Kattankulathur (Chennai). India.
Manuscript received on March 12, 2016. | Revised Manuscript received on March 27, 2016. | Manuscript published on May 05, 2016. | PP: 18-22 | Volume-6 Issue-2, May 2016. | Retrieval Number: B2822056216
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Traditional broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of members but require a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the ciphertexts encrypted under the shared encryption key, but a sender cannot exclude any particular member from decrypting the ciphertexts. It proposes Adhoc on demand Distance Vector (AODV).here we want to form a group in a particular distance using distance vector. AODV protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the ciphertexts encrypted under the shared encryption key. But here no require a trusted party to distribute decryption keys. Some features added to DVR algorithm is known as Destination sequence distance vector (DSDV) routing algorithm. This algorithm provides good level of security and performance.
Keywords: Broadcast encryption (BE), group key agreement (GKA),contributory broadcast encryption (ConBE), Adhoc on demand Distance Vector (AODV), Destination sequence distance vector (DSDV)