Secure Data Retrieval using Cipher Text Policy-Attribute Based Encryption in Hybrid Networks

G.L. Pavani¹ , Ch.Ramesh ²

1. Dept. of CNIS, G. Narayanamma Institute of Technology and Sciences, Hyderabad, India.
2. Dept. of CNIS, G. Narayanamma Institute of Technology and Sciences, Hyderabad, India.

Correspondence should be addressed to: pavani.gara1@gmail.com.

Section:Review Paper, Product Type: Isroset-Journal
Vol.5 , Issue.4 , pp.45-48, Aug-2017

Online published on Aug 30, 2017

Copyright © G.L. Pavani, Ch.Ramesh . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

346 Views    440 Downloads    161 Downloads

Abstract :
Encrypted information of broadcast is the scheme that a sender encrypts messages for a designated group of receivers, and sends the cipher texts by broadcast over the networks. Many research papers have done it using elliptic curve cryptography. In this paper, we propose the broadcast encryption scheme based on braid groups cryptography which is an alternative method in the public key cryptography and can reduce the computational cost. Here new ancient, a gathering of individuals arrange a typical open encryption key while every part holds an unscrambling key. A sender seeing people in general gathering encryption key can confine the unscrambling to a subset of individuals from his decision. We present a new BE scheme that is aggregately. The aggregatability property is shown to be useful to construct advanced protocols.

Key-Words / Index Term :
Broadcast encryption, Braid groups, Asymmetric group key Agreement, Contributory Broadcast Encryption, and Provable Security

References :
[1] Qianhong Wu, Member, IEEE, Bo Qin, Lei Zhang, Member, IEEE, Josep Domingo-Ferrer, Fellow, IEEE Oriol Farr`as, and Jes´us A. Manj´on, “Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts”, IEEE Transactions On Computers, Vol. Xxx, No. Xxx, Xxx 2015.
[2] A. Fiat and M. Naor, “Broadcast Encryption,” in Proc. Crypto 1993, 1993, vol. LNCS 773, Lecture Notes in Computer Science, pp. 480-491.
[3] I. Ingemarsson, D.T. Tang and C.K. Wong, “A Conference Key Distribution System,” IEEE Transactions on Information Theory, vol. 28, no. 5, pp. 714-720, 1982.
[4] Q. Wu, Y. Mu, W. Susilo, B. Qin and J. Domingo-Ferrer, “Asymmetric Group Key Agreement,” in Proc. Eurocrypt 2009, 2009, vol. LNCS 5479, Lecture Notes in Computer Science, pp. 153-170.
[5] http://en.wikipedia.org/wiki/PRISM surveillance program, 2014.
[6] Q. Wu, B. Qin, L. Zhang, J. Domingo-Ferrer and O. Farr`as, “Bridging Broadcast Encryption and Group Key Agreement,” in Proc. Asiacrypt 2011, 2011, vol. LNCS 7073, Lecture Notes in Computer Science, pp. 143-160.
[7] D. H. Phan, D. Pointcheval and M. Strefler, “Decentralized Dynamic Broadcast Encryption,” in Proc. SCN 2012, 2011, vol. LNCS 7485, Lecture Notes in Computer Science, pp. 166-183.
[8] M. Steiner, G. Tsudik and M. Waidner, “Key Agreement in Dynamic Peer Groups,” IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 8, pp. 769-780, 2000.
[9] A. Sherman and D. McGrew, “Key Establishment in Large Dynamic Groups Using One-way Function Trees,” IEEE Transactions on Software Engineering, vol. 29, no. 5, pp. 444-458, 2003.
[10] Y. Kim, A. Perrig and G. Tsudik, “Tree-Based Group Key Agreement,” ACM Transactions on Information System Security, vol. 7, no. 1, pp. 60-96, 2004.
[11] Y. Mao, Y. Sun, M. Wu and K.J.R. Liu, “JET: Dynamic Join-Exit-Tree Amortization and Scheduling for Contributory Key Management,” IEEE/ACM Transactions on Networking, vol. 14, no. 5, pp. 1128-1140, 2006.
[12] W.-G. Tzeng, “A Secure Fault-Tolerant Conference-Key Agreement Protocol,” IEEE
Transactions on Computers, vol. 51, no.4, pp. 373- 379, 2002.
[13] X. Yi, “Identity-Based Fault-Tolerant Conference Key Agreement,” IEEE Transactions Dependable Secure Computing vol. 1, no. 3, 170- 178, 2004.
[14] M. Burmester and Y. Desmedt, “A Secure and Efficient Conference Key Distribution System,” in Proc. Eurocrypt 1994, 1994, vol. LNCS 950, Lecture Notes in Computer Science, pp. 275-286.
[15] A. Joux, “A One Round Protocol for Tripartite Diffie-Hellman,” Journal of Cryptology, vol. 17, no. 4, pp. 263-276, 2004.
[16] D. Boneh and A. Silverberg, “Applications of Multilinear Forms to Crytography,” Contemporary Mathematics, vol. 324, pp.71-90, 2003.