A Concerted Key Management Procedure for Eminence Based data sharing in cloud using Ciphertext Policy Attribute-Based Encryption

Authors

  • S. Palani  Assistant Professor, Department of computer Applications, SVCET, Chittoor, Andhra Pradesh, India
  • A. Punyavathi  PG scholar, Department of computer Applications, SVCET, Chittoor, Andhra Pradesh, India
  • S. C. Samyouktha  PG scholar, Department of computer Applications, SVCET, Chittoor, Andhra Pradesh, India

Keywords:

Data Sharing, Attribute-Based Encryption, Revocation, Access Control, Removing Escrow

Abstract

In present system, there's in addition a cheap file hierarchy attribute-centered encoding theme in cloud computing. The bedded access structures unit of measurement constitutional into one access constitution, therefore the ranked documents unit of measurement encrypted with the constitutional access structure. The ciphertext components involving attributes would be shared by technique of the records. Consequently, each ciphertext storage and time rate of encoding is saved. To boot, the planned theme is tested to be comfortable below the thought. Experimental simulation indicates that the planned theme is unbelievably effective in terms of encoding and cryptography. With the quantity of the files growing, the advantages of our theme grow to be more and additional conspicuous. We’ve got an inclination to tend to advocate a really distinctive CP-ABE theme for knowledge sharing technique by victimization exploiting the characteristic of the strategy structure. The planned theme points resultant achievements: (1) the key instrument crisis would be resolved by escrow-free key issue protocol, that's developed utilizing the secure two-social gathering computation between the mandatory issue new undo core and along the data storing center, high-quality-grained user revocation per each and every attribute would be completed with the assistance of proxy cryptography that takes competencies of the selective attribute crew key distribution on high of the ABE. The efficiency and protection analyses indicate that the planned theme is effective to soundly manage the data allotted at intervals the data sharing procedure.

References

  1. L. N. Bhuyan and D. P. Agrawal, “Generalized hypercube and hyperbus structures for a computer network,” IEEE Trans. Comput., vol. C-33, no. 4, pp. 323-333, Apr. 1984.
  2. J. M. Gonzalez, V. Paxson, and N. Weaver, “Shunting: A hardware/ software architecture for flexible, high-performance network intrusion prevention,” in Proc. 14th ACM Conf. Comput. Commun. Secur., 2007, pp. 139-149.
  3. A. Singla, C.-Y. Hong, L. Popa, and P. B. Godfrey, “Jellyfish: Networking data centers randomly,” in Proc. 9th USENIX Conf. NSDI, 2012, p. 17.
  4. C. Guo et al., “DCell: A scalable and fault-tolerant network structure for data centers,” in Proc. ACM SIGCOMM, Aug. 2008, pp. 75-86.
  5. C. Guo et al., “BCube: A high performance, server-centric network architecture for modular data centers,” in Proc. ACM SIGCOMM, Aug. 2009, pp. 63-74.
  6. Z. Li, Z. Guo, and Y. Yang, “BCCC: An expandable network for data centers,” in Proc. 10th ACM/IEEE Symp. ANCS, Oct. 2014, pp. 77-88.
  7. D. Guo, “Expandable and cost-effective network structures for data centers using dual-port servers,” IEEE Trans. Comput., vol. 62, no. 7, pp. 1303-1317, Jul. 2013.
  8. D. Li, “FiConn: Using backup port for server interconnection in data centers,” in Proc. IEEE INFOCOM, Apr. 2009, pp. 2276-2285.
  9. D. Li and J. Wu, “On the design and analysis of data center network architectures for interconnecting dual-port servers,” in Proc. IEEE INFOCOM, Apr-May 2014, pp. 1851-1859.
  10. L. Kou, G. Markowsky, and L. Berman, “A fast algorithm for Steiner trees,” Acta Inf., vol. 15, no. 2, pp. 141-145, 1981.
  11. D. Li, Y. Li, J. Wu, S. Su, and J. Yu, “ESM: Efficient and scalable data center multicast routing,” IEEE/ACM Trans. Netw., vol. 20, no. 3, pp. 944-955, Jun. 2012.
  12. G. Lu, C. Guo, Y. Li, and Z. Zhou, “ServerSwitch: A programmable and high performance platform for data center networks,” in Proc. 8th USENIX Conf. Netw. Syst. Design Implement. (NSDI), 2011, pp. 15-28.
  13. G. Lu, Y. Shi, C. Guo, and Y. Zhang, “CAFE: A configurable packet forwarding engine for data center networks,” in Proc. 2nd ACM SIGCOMM Workshop Program. Routers Extensible Services Tomorrow (PRESTO), 2009, pp. 25-30.
  14. Y. Yang and G. M. Masson, “Nonblocking broadcast switching networks,” IEEE Trans. Comput., vol. 40, no. 9, pp. 1005-1015, Sep. 1991.
  15. Y. Yang and G. M. Masson, “The necessary conditions for Clos-type nonblocking multicast networks,” IEEE Trans. Comput., vol. 48, no. 11, pp. 1214-1227, Nov. 1999.
  16. Y. Yang, “A class of interconnection networks for multicasting,” IEEE Trans. Comput., vol. 47, no. 8, pp. 899-906, Aug. 1998.
  17. Y. Yang and J. Wang, “Wide-sense nonblocking Clos networks under packing strategy,” IEEE Trans. Comput., vol. 48, no. 3, pp. 265-284, Mar. 1999.
  18. Y. Yang and G. M. Masson, “Broadcast ring sandwich networks,” IEEE Trans. Comput., vol. 44, no. 10, pp. 1169-1180, Oct. 1995.
  19. M. Al-Fares, A. Loukissas, and A. Vahdat, “A scalable, commodity data center network architecture,” in Proc. ACM SIGCOMM, 2008, pp. 63-74.
  20. Z. Guo and Y. Yang, “On nonblocking multicast fat-tree data center networks with server redundancy,” IEEE Trans. Comput., vol. 64, no. 4, pp. 1058-1073, Apr. 2015.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2018-03-30

Issue

Volume 4, Issue 7, March-April-2018

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
S. Palani, A. Punyavathi, S. C. Samyouktha, " A Concerted Key Management Procedure for Eminence Based data sharing in cloud using Ciphertext Policy Attribute-Based Encryption, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 4, Issue 7, pp.144-150, March-April-2018.