Efficient cloud storage security scheme and data sharing in cloud

Veera Veni Chinta, K.V.V.L Madhuri

Abstract


We propose the Secure Data Sharing in Clouds (SeDaSC) approach that gives: 1) information privacy and integrity; 2) get to control; 3) information sharing (sending) without utilizing register concentrated reencryption; 4) insider threat security; and 5) forward and in reverse access control. The SeDaSC strategy encodes a file with a solitary encryption key. Two distinctive key offers for every one of the clients are created, with the client just getting one offer. The ownership of a solitary offer of a key enables the SeDaSC system to counter the insider dangers. The other key offer is put away by a confided in outsider, which is known as the cryptographic server. The SeDaSC strategy is appropriate to traditional and portable cloud computing situations.


References


A. Abbas and S. U. Khan, “A review on the State-of-the-art privacy preserving approaches in e-health clouds,” IEEE J. Biomed. Health Informat., vol. 18, no. 1, pp. 1431–1441, Jul. 2014.

K. Alhamazani et al., “An overview of the commercial cloud monitoring tools: Research dimensions, design issues, state-of-the-art,” Computing, DOI: 10.1007/s00607-014-0398-5, 2014, to be published.

A. N. Khan, M. L. M. Kiah, S. U. Khan, and S. A. Madani, “Towards secure mobile cloud computing: A survey,” Future Gen. Comput. Syst., vol. 29, no. 5, pp. 1278–1299, Jul. 2013.

L. Wei, H. Zhu, Z. Cao, Y. Chen, and A. V. Vasilakos, “Security and privacy for storage and computation in cloud computing,” Inf. Sci., vol. 258, pp. 371–386, Feb. 2014.

Cloud security Alliance, “Security guidelines for critical areas of focus in cloud computing v3.0,” 2011.

D. Chen et al., “Fast and scalable multi-way analysis of massive neural data,” IEEE Trans. Comput., DOI: 10.1109/TC.2013.2295806, 2014, to be published.

A. N. Khan, M. M. Kiah, S. A. Madani, M. Ali, and S. Shamshir-band, “Incremental proxy re-encryption scheme for mobile cloud computing environment,” J. Supercomput., vol. 68, no. 2, pp. 624–651, May 2014.

Y. Chen and W. Tzeng, “Efficient and provably-secure group key management scheme using key derivation,” in Proc. IEEE 11th Int. Conf. TrustCom, 2012, pp. 295–302.

L. Xu, X. Wu, and X. Zhang, “CL-PRE: A certificateless proxy reencryption scheme for secure data sharing with public cloud,” in Proc. 7th ACM Symp. Inf. , Comput. Commun. Security, 2012, pp. 87–88.

P. Gutmann, “Secure deletion of data from magnetic and solid-state memory,” in Proc. 6th USENIX Security Symp. Focusing Appl. Cryptography, 1996, p. 8.

S. Seo, M. Nabeel, X. Ding, and E. Bertino, “An Efficient Certificateless Encryption for Secure Data Sharing in Public Clouds,” IEEE Trans. Knowl. Data Eng., vol. 26, no. 9, pp. 2107–2119, Sep. 2013.

Y. Chen, J. D. Tygar, andW. Tzeng, “Secure group key management using uni-directional proxy re-encryption schemes,” in Proc. IEEE INFOCOM, pp. 1952–1960.

T. Murata, “Petri Nets: Properties, analysis and applications,” Proc. IEEE, vol. 77, no. 4, pp. 541–580, Apr. 1989.

L. Moura and N. Bjrner, “Satisfiability modulo theories: An appetizer,” in Proc. Formal Methods, Found. Appl., vol. 5902, Lecture Notes in Computer Science, 2009, pp. 23–36.

S. U. R. Malik, S. K. Srinivasan, S. U. Khan, and L. Wang, “A methodology for OSPF routing protocol verification,” in Proc. 12th Int. Conf. ScalCom, Changzhou, China, Dec. 2012, pp. 1–5.


Full Text: PDF [Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

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 http://creativecommons.org/licenses/by/3.0/deed.en_GB.