Shamir's key based confidentiality on cloud data storage

Confidentiality is used on accessing the set of cloud database information with high security level. The conventional encryption and decryption mechanism for the privacy maintenance in cloud zone acquire additional processing time. Hence, the cloud service did not explore effective confidentiality on information retrieval process. A new key distribution scheme for efficient privacy preserving query plans on the cloud data achieves a higher percentage of confidentiality by residing the cloud data with polynomial interpolation. To ensure high confidentiality and providing privacy to the cloud users the Shamir's Key Distribution based Confidentiality (SKDC) scheme is employed. SKDC scheme generates a polynomial of degree with the secret as the first coefficient and the remaining coefficients picked up at random to improve the privacy preserving level on the cloud infrastructure. Shamir's Key Distribution supports batch auditing where multiple user requests for data auditing is held concurrently at a higher confidentiality rate. SKDC scheme handles query processing using the matrix-structure form. An Experimental evaluation is performed with Amazon Simple Storage Service dataset to evaluate the confidentiality and privacy performance with Shamir's Key Distribution based Confidentiality (SKDC) scheme is compared with two well-known privacy schemes such as Trusted Third Party Model (TTPM) and Trusted Hardware Based Database. As a result, the SKDC scheme increases confidentiality level of the user by 22 % as compared to existing TTPM method.

[1]  Shareeful Islam,et al.  using Fragmentation in Cloud Computing , 2012 .

[2]  Arumugam Sakthivel,et al.  Enhancing cloud security based on group signature , 2017, Int. Arab J. Inf. Technol..

[3]  Sushil Jajodia,et al.  Combining fragmentation and encryption to protect privacy in data storage , 2010, TSEC.

[4]  Dimitrios Zissis,et al.  Addressing cloud computing security issues , 2012, Future Gener. Comput. Syst..

[5]  Reza Curtmola,et al.  Provable data possession at untrusted stores , 2007, CCS '07.

[6]  Shouhuai Xu,et al.  Efficient query integrity for outsourced dynamic databases , 2012, CCSW '12.

[7]  Salve Bhagyashri Salve Bhagyashri,et al.  Privacy-Preserving Public Auditing For Secure Cloud Storage , 2014 .

[8]  Eduardo B. Fernández,et al.  An analysis of security issues for cloud computing , 2013, Journal of Internet Services and Applications.

[9]  2015 International Conference on Advances in Computing, Communications and Informatics, ICACCI 2015, Kochi, India, August 10-13, 2015 , 2015, ICACCI.

[10]  Beng Chin Ooi,et al.  Query optimization for massively parallel data processing , 2011, SoCC.

[11]  Jeffrey D. Ullman,et al.  Map-reduce extensions and recursive queries , 2011, EDBT/ICDT '11.

[12]  M. Sugumaran,et al.  An Architecture for Data Security in Cloud Computing , 2014, 2014 World Congress on Computing and Communication Technologies.

[13]  Cong Wang,et al.  Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data , 2012, IEEE Transactions on Parallel and Distributed Systems.

[14]  Hovav Shacham,et al.  Compact Proofs of Retrievability , 2008, Journal of Cryptology.

[15]  Imad M. Abbadi,et al.  Towards Trustworthy Resource Scheduling in Clouds , 2013, IEEE Transactions on Information Forensics and Security.

[16]  Sushil Jajodia,et al.  Balancing confidentiality and efficiency in untrusted relational DBMSs , 2003, CCS '03.

[17]  Radu Sion,et al.  TrustedDB: A Trusted Hardware-Based Database with Privacy and Data Confidentiality , 2011, IEEE Transactions on Knowledge and Data Engineering.

[18]  M. Mrinalni Vaknishadh,et al.  Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing , 2012 .