Causative Broadcast Encryption for Short Cipher Text

D Reshma, A Subhadra


Encryption is used in a correspondence framework to secure data in the transmitted messages from sender to receiver. To execute the encryption in addition to decryption ye transmitter and receiver ought to have comparing encryption in addition to decryption keys. For transportation precautionary measure data to group required broadcast encryption (BE). BE sanctions a sender to securely broadcast to any subset of individuals and require a trusted gathering to disperse decryption keys. Group key Authority (GKA) protocol authorizes various clients to set up an unremarkable mystery channel by means of open systems. Praising that a noteworthy goal of GKA for dominant part applications is to incite a secret channel among group individuals, yet a sender can't discard any exceptional individual from unscrambling ye figure writings. By crossing over BE and GKA thought with a crossover primitive identified with as contributory broadcast encryption (CBE). With these primitives, a group of individuals travel through an unremarkable open encryption key while every part having there decryption key. A sender outwardly seeing general society group encryption key can delineate the decryption to subset of individuals from sender's winnow. A basic approach to induce these keys is to use the general population key appropriation framework concocted by Daffier and Hellman.. Key dispersion sets are adjusted to incite keys and Elliptic Curve Cryptography (ECC) is used for the encryption and decryption of records; and this going to give the security to the archives over group correspondence.


Cryptography, Key Management, Group Key Agreement, Broadcast Encryption.


Y. Amir, Y. Kim, C. Nita-Rotaru, and G. Tsudik, “On the performance of group key agreement protocols,” ACM Trans. Inf. Syst. Secur., vol. 7, no. 3, pp. 457–488, Aug. 2004.

D. Augot, R. Bhaskar, V. Issarny, and D. Sacchetti, “An efficient group key agreement protocol for ad hoc networks,” in Proc. 6th IEEE Int. Symp. World Wireless Mobile Multimedia Netw., 2005, pp. 576–580.

A. Beimel and B. Chor, “Communication in key distribution schemes,” in Proc. Adv. Cryptol., 1994, vol. 773, pp. 444–455.

R. Blom, “An optimal class of symmetric key generation systems,” in Proc. Adv. Cryptol., 1984, vol. 209, pp. 335–338.

D. Boneh and M. K. Franklin, “An efficient public-key traitor tracing scheme,” in Proc. Adv. Cryptol., 1999, vol. 1666, pp. 338–353.

D. Boneh, C. Gentry, and B. Waters, “Collusion resistant broadcast encryption with short ciphertexts and private keys,” in Proc. Adv. Cryptol ., 2005, vol. 3621, pp. 258–275.

D. Boneh, A. Sahai, and B. Waters, “Fully collusion resistant traitor tracing with short ciphertexts and private keys,” in Proc. 25th Int. Conf. Theory Appl. Cryptographic Tech., 2006, vol. 4004, pp. 573–592.

D. Boneh and M. Naor, “Traitor tracing with constant size Cipher text,” in Proc. 15th ACM Conf. Comput. Comm. Security, 2008, pp. 501–510.

D. Boneh and A. Silverberg, “Applications of multilinear forms to cryptography,” Contemporary Math., vol. 324, pp. 71–90, 2003.

C. Blundo, L. A. Mattos, and D. R. Stinson, “Generalized Beimel- Chor schemes for broadcast encryption and interactive key distribution,” Theor. Comp. Sci., vol. 200, no. 1–2, pp. 313–334, 1998.

Full Text: PDF [Full Text]


  • There are currently no refbacks.

Copyright © 2013, All rights reserved.|

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at