A Survey on Confidential Cloud Data under Secure Key Exposure

ISSN: 2348-7860 (O) | 2348-7852 (P) | Vol. 5 No. 4 | April 2018 | PP.

355-359

Digital Object Identifier DOI

®

http://dx.doi.org/10.21276/ijre.2018.5.4.3

Copyright © 2018 by authors and International Journal of Research and Engineering

This work is licensed under the Creative Commons Attribution International License (CC BY).

creativecommons.org/licenses/by/4.0

|

|

ORIGINAL ARTICLE

A Survey on Confidential Cloud Data under Secure Key Exposure

Author(s):

*Pooja Vijay Bankar,

Yashanjali Sisodiya

Affiliation(s):

Department of Computer Engineering,

Savitribai Phule University of Pune, India

2

G. H. Raisoni College of Engineering, Ahmednagar, India

*Corresponding author: [email protected]

Abstract:

Keywords: Ciphertext, encryption, adversary

I. INTRODUCTION

Storage systems are rapidly developing in measure using increasingly and greater disks, and through distribution over a system. With bigger frameworks, the shot of segment disappointment additionally expands, so methods to secure information turn out to be more important. New plans are

expected to secure information against various disappointments in a dispersed stockpiling framework. A general test of appropriated scheme is to give information consistency while permitting failures and concurrent access. In the meantime, one might want to get sensible execution, to scale with number of customers, and to permit extension of capacity limit with ease. These troubles are all around perceived, comprehended, and sensibly tended to for replication-based capacity. For deletion coded capacity, be that as it may, diverse plans are as yet being proposed, as analysts investigate better approaches to manage the extra complexity made by erasure codes. Generally, this many-sided quality is caused by a characteristic coupling of information in erasure codes, as we clarify further in the paper.

The arena currently witnessed a large surveillance program aimed toward breaking users’ privacy. Perpetrators have been not hindered by using the various security measures deployed within the centered services. As an instance, although those services trusted encryption mechanisms to assure facts confidentiality, the essential keying material was received via backdoors, bribe, or coercion. If the encryption secret is exposed, the handiest viable manner to guarantee confidentiality is to restrict the adversary’s access to the ciphertext, e.g., with the aid of spreading it throughout more than one administrative domain names, inside the hope that the adversary cannot compromise all of them. However, even if the records is encrypted and dispersed throughout unique administrative domain names, an adversary geared up with the suitable keying fabric can compromise a server in a single domain and decrypt ciphertext blocks saved therein. In this paper, we have a look at statistics confidentiality in opposition to an adversary which knows the encryption key and has get right of entry to a massive fraction of the ciphertext blocks.

The adversary can gather the crucial component either via exploiting flaws or backdoors within the key-technology software [31], or by using compromising the devices that

preserve the keys (e.g., on the person-side or inside the cloud). As far as we are conscious, this adversary invalidates the safety of maximum cryptographic solutions, along with those that shield encryption keys by means of secret-sharing (when you consider that these keys can be leaked as quickly as they're generated). To counter such an adversary, we advise Bastion, a novel and green scheme which ensures that plaintext records can't be recovered so long as the adversary has get admission to at maximum all but two ciphertext blocks, even when the encryption key is exposed. Bastion achieves this by means of combining the usage of popular encryption capabilities with a green linear rework. In this feel, Bastion shares similarities with the notion of all-or-nothing transform. An AONT is not an encryption with the aid of itself, but may be used as a pre-processing step before encrypting the records with a block cipher.

We evaluate the performance of Bastion in comparison with a number of present encryption schemes which guarantees that plaintext data cannot be recovered so long as the adversary has get permission at maximum all but ciphertext blocks, even if the encryption secrets uncovered. Bastion achieves this through combining using trendy encryption capabilities with a green linear transform. On this sense, Bastion stocks similarities with the belief of all-or-nothing transform. Our results show that Bastion handiest incurs a negligible overall performance deterioration (much less than 5%) when in comparison to symmetric encryption schemes, and considerably improves the overall performance of present AON encryption schemes. We also talk practical insights with appreciate to the feasible integration of Bastion in commercial dispersed garage systems. Our contributions on this paper may be summarized as follows:

•We advocate Bastion, a green scheme which ensures data confidentiality towards an adversary that is aware of the encryption key and has get right of entry to a massive fraction of the ciphertext blocks.

•We examine the safety of Bastion, and we display that it prevents leakage of any plaintext block as long because the adversary has get right of entry to the encryption key and to all however two ciphertext blocks.

• We compare the overall performance of Bastion analytically and empirically in contrast to a number of existing encryption strategies. Our outcomes show that Bastion extensively improves (by more than 50%) the performance of existing AON encryption schemes, and handiest incurs a negligible overhead while as compared to current semantically relaxed encryption modes (e.g., the CTR encryption mode).

• We speak sensible insights with appreciate to the deployment of Bastion inside present garage structures, together with the HYDR Astor grid garage device.

II. RELATED WORK

Ghassan O. Karame, Claudio Soriente, Krzysztof Lichota, Srdjan Capkunet. et al. [1] studied facts in confidentiality against an adversary which knows the encryption key and has get admission to a large fraction of the ciphertext blocks. To this end, they have proposed Bastion, a novel and green scheme that ensures facts confidentiality even supposing the encryption secret is leaked and the adversary has access to nearly all ciphertext blocks. They examine the safety of Bastion, and we examine its overall performance by a prototype implementation, they also speak practical insights with appreciate to the combination of Bastion in industrial dispersed garage structures. This assessment results endorse that Bastion is nicely-acceptable for integration in current structures since it incurs much less than 5% overhead in comparison to current semantically cozy encryption modes.

Sneha Singha, S. D. Satavet et al. [2] introduces a concept of lessening the purchaser’s mystery key disclosure. This paper shows a system wherein de-duplication method of information is followed and it will test the duplicity of facts and take away the redundant one using MD5 hashing. SHA1 is the latest version of MD5 hashing algorithm. SHA-1 has 160 bit size while MD5 has 128 bits as well as numbers of rounds are more in SHA-1.So SHA-1 has better performance than MD5 and that is why, we used SHA-1 in proposed system. Additionally, it makes use of tile bitmap approach in which it's going to check the previous and the contemporary versions of the statistics to ease the auditor’s workload and to make the device greater efficient.

Rongmao Chen, Yi Mu, Fuchun Guo and Xiao fen Wang et al. [6] investigated the security of a 9aaf3f374c58e8c9dcdd1ebf10256fa5 cryptographic primitive, specifically Public Key Encryption with key-word search (PEKS) and advocate a new PEKS framework named twin-Server Public Key Encryption with key-word search (DS-PEKS). As some other primary contribution, they define a brand new version of the clean Projective Hash capabilities (SPHFs) referred to as linear and homo-morphic SPHF (LH-SPHF) and display a standard construction of cozy DS-PEKS from LH-SPHF.

Hao Jin, Hong Jiang and Ke Zhou et al. [7] proposed a public auditing scheme with records dynamics aid and equity arbitration of capability disputes. Particularly, authors designed an index switcher to dispose of the problem of index utilization in tag computation in current schemes and attain efficient handling of statistics dynamics. To address the fairness hassle so that no birthday party can misbehave without being detected, they similarly amplify existing risk models and adopt signature alternate idea to layoutfair

arbitration protocols, so that any possible dispute may be fairly settled. The safety evaluation shows this scheme is provably cozy, and the performance evaluation demonstrates the overhead of facts dynamics and dispute arbitration is affordable.

Ayad F. Barsoum and M. Anwar Hasan et al.[8] proposed a map-based provable multi copy dynamic data possession (MB-PMDDP) scheme that has the subsequent functions: 1) it affords an proof to the clients that the CSP isn't always dishonest by way of storing fewer copies; 2) it helps outsourcing of dynamic statistics, i.e., it helps block-stage operations, together with block modification, insertion, deletion, and append; and three) it lets in authorized customers to seamlessly get entry to the document copies saved by way of the CSP. We supply a comparative evaluation of the proposed MB-PMDDP scheme with a reference version received through the usage of extending existing provable ownership of dynamic single-replica schemes.

Jiguo Li, Xiaonan Lin, Yichen Zhang and Jinguang Han et al. [9] outsourced ABE (OABE) with satisfactory - grained get entry to control machine can in large part reduce the computation fee for customers who want to get entry to encrypted records saved in cloud by using outsourcing the heavy computation to cloud provider company (CSP). However, as the amount of encrypted files saved in cloud is becoming very big, a good way to avert efficient query processing. To cope with above problem, authors present a brand new cryptographic primitive called characteristic - based encryption scheme without sourcing key-issuing and outsourcing decryption, which can implement keyword search characteristic (KSF - OABE). The proposed KSF - OABE scheme is proved at ease in opposition to chosen plaintext attack (CPA). CSP plays partial decryption venture delegated with the aid of records consumer without understanding anything approximately the plaintext. Furthermore, the CSP can perform encrypted keyword search without understanding anything approximately the keywords embedded in trapdoor.

Xun Yi, Fang-Yu Rao, Zahir Tari, Feng Hao, Elisa Bertino, Ibrahim Khalil and Albert Y. Zomaya et al. [10] provided two compilers that rework any birthday celebration PAKE protocol to a server PAKE protocol on the basis of the identification based totally cryptography, called ID2S PAKE protocol. By using the compilers, we can construct ID2S PAKE protocols which gain implicit authentication. So long as the underlying birthday party PAKE protocol and identification-based encryption or signature scheme have provable protection without random oracles, the ID2S PAKE protocols built through the compilers may be confirmed to be comfortable without random oracles. Compared with the Katz et al.’s server PAKE protocol with provable protection without random oracles, our ID2S

PAKE protocol can store from 22% to 66% of computation in each server.

III. PROPOSED ALGORITHM

1: procedure Enc (K, x = x[1] . . . x[m]) 2: n = m + 1

3: y′[n] {0, 1}l ⊲ y’[n] is the IV for CTR 4: for i = 1 . . . n − 1 do

5: y′[i] = x[i] _ FK(y′[n] + i) 6: end for 7: t = 0l 8: for i = 1 . . . n do 9: t = t _ y′[i] 10: end for 11: for i = 1 . . . n do 12: y[i] = y′[i] _ t 13: end for

14: return y ⊲ y = y[1] . . . y[n] 15: end procedure

Decryption in Bastion:

1: procedure Dec (K, y = y[1] . . . y[n]) 2: t = 0l 3: for i = 1 . . . n do 4: t = t _ y[i] 5: end for 6: for i = 1 . . . n do 7: y′[i] = y[i] _ t 8: end for 9: for i = 1 . . . n − 1 do 10: x[i] = y′[i] _ F−1 K (y′[n] + i) 11: end for 12: return x ⊲ x = x [1] . . . x[n − 1] 13: end procedure

IV. SYSTEM MODEL

Fig.1 - Our attacker model. We assume an adversary that may gather all of the cryptographic mystery material, and might compromise a big fraction (up to all but one) of the storage servers.

We remembered a multi-cloud storage system which could leverage a number of commodity cloud companies (e.g., Amazon, Google) with the aim of distributing agree with across unique administrative domains. This “cloud of clouds” model is receiving growing interest now-a-days with cloud storage vendors consisting of EMC, IBM, and Microsoft, offering merchandise for multi-cloud structures.

Particularly, we take into account a gadget of s storage servers S1, . . . ,Ss, and a set of customers. We anticipate that every server appropriately authenticates customers. For simplicity and without loss of generality, we attention on the read/write garage abstraction of [21] which exports two operations:

• write(v) This habitual splits v into s pieces {v1, . . . , vs} and sends hvji to server Sj , for j ∈ [1 . . . s].

• read(•) The study recurring fetches the stored cost v from the servers. For every j ∈ [1 . . . s], piece vj is downloaded from server Sj and all pieces are mixed into v. We anticipate that the preliminary price of the storage is a unique price ⊥, which isn't always a legitimate enter cost for a write operation.

V.

CONCLUSION AND FUTURE WORK

On this paper, we addressed the problem of securing facts outsourced to the cloud in opposition to an adversary which has get admission to the encryption key. For that purpose, we delivered a singular protection definition that captures information confidentiality towards the new adversary. We then proposed Bastion, a scheme which ensures the confidentiality of encrypted statistics even when the adversary has the encryption key, and all however ciphertext blocks. Bastion is maximum suitable for settings wherein the ciphertext blocks are stored in multi-cloud garage structures. In these settings, the adversary would need to gather the encryption key, and to compromise all servers, so one can get better any unmarried block of plaintext. We analyzed the security of Bastion and evaluated its

performance in practical settings. Bastion significantly improves (through greater than 50%) the performance of current primitives which offer similar safety underneath key exposure, and most effective incurs a negligible overhead (much less than 5%) while compared to existing semantically relaxed encryption modes (e.g., the CTR encryption mode). sooner or later, we confirmed how Bastion may be almost integrated inside current dispersed garage structures.

VI. DECLARATION

All authors have disclosed no conflicts of interest.

REFERENCE

[1] Sneha Singha, S. D. Satav, “A Survey Paper on Cloud Storage Auditing with Key Exposure Resistance”, International Journal of Science and Research (IJSR) ISSN (Online): 2319-7064 Index Copernicus Value (2013): 6.14 | Impact Factor (2014): 5.611.

[2] L. JagajeevanRao, “Key Exposure in Cloud Data Services”, International Journal of Big Data Security Intelligence Vol. 4, No. 1 (2017) pp.15-20 http://dx.doi.org/10.21742/ijbdsi.2017.4.1.03. [3] Prerna Yadav, Mrunal Badade, Swati Patil, “TEES:

An Efficient Search Scheme over Encrypted Data on Mobile Cloud TEES (Traffic and Energy saving Encrypted Search)”, International Journal of Advanced Research in Computer and Communication Engineering ISO 3297:2007 Certified Vol. 5, Issue 10, October 2016.

[4] Huaqun Wang, Debiao He, Shaohua Tang, “Identity-Based Proxy-Oriented Data Uploading and Remote Data Integrity Checking in Public Cloud”, IEEE Transactions on Information Forensics and Security, DOI 10.1109/TIFS.2016.

[5] Rongmao Chen, Yi Mu, Fuchun Guo and Xiaofen Wang,“Dual-Server Public-Key Encryption with Keyword Search for Secure Cloud Storage”, IEEE Transactions on Information Forensics and Security, DOI 10.1109/TIFS.2015.

[6] Hao Jin, Hong Jiang and Ke Zhou, “Dynamic and Public Auditing with Fair Arbitration for Cloud Data”, IEEE TRANSACTIONS ON CLOUD COMPUTING, VOL. 13, NO. 9, SEPTEMBER 2014.

[7] Ayad F. Barsoum and M. Anwar Hasan, “Provable Multicopy Dynamic Data Possession in Cloud Computing Systems”, IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 10, NO. 3, MARCH 2015.

[8] Jiguo Li, Xiaonan Lin, Yichen Zhang and Jinguang Han, “KSF-OABE: Outsourced Attribute – Based Encryption with Keyword Search Function for Cloud

Storage”, IEEE Transactions on Services Computing, Volume: PP, Issue: 99,16 March 2016. [9] Xun Yi, Fang-Yu Rao, Zahir Tari, Feng Hao, Elisa

Bertino, Ibrahim Khalil and Albert Y. Zomaya, “ID2S Password-Authenticated Key Exchange Protocols”, IEEE Transactions on Computers, DOI 10.1109/TC.2016.

[10] M. Abd-El-Malek, G. R. Ganger, G. R. Goodson, M. K. Reiter, and J. J. Wylie, “Fault-Scalable Byzantine Fault-Tolerant Services,” in ACM Symposium on Operating Systems Principles (SOSP), 2005, pp. 59– 74.

[11] M. K. Aguilera, R. Janakiraman, and L. Xu, “Using Erasure Codes Efficiently for Storage in a Distributed System,” in International Conference on Dependable Systems and Networks (DSN), 2005, pp. 336–345.

[12] W. Aiello, M. Bellare, G. D. Crescenzo, and R. Venkatesan, “Security amplification by composition: The case of doublyiterated, ideal ciphers,” in Advances in Cryptology (CRYPTO), 1998, pp. 390– 407.

[13] C. Basescu, C. Cachin, I. Eyal, R. Haas, and M. Vukolic, “Robust Data Sharing with Key-value Stores,” in ACM SIGACT- SIGOPS Symposium on Principles of Distributed Computing (PODC), 2011, pp. 221–222.

[14] A. Beimel, “Secret-sharing schemes: A survey,” in International Workshop on Coding and Cryptology (IWCC), 2011, pp.11–46.

[15] A. Bessani, M. Correia, B. Quaresma, F. André, and P. Sousa, “DepSky: Dependable and Secure Storage in a Cloud-ofclouds,” in Sixth Conference on Computer Systems (EuroSys), 2011, pp. 31–46. [16] G. R. Blakley and C. Meadows, “Security of ramp

schemes,” in Advances in Cryptology (CRYPTO), 1984, pp. 242–268.

[17] V. Boyko, “On the Security Properties of OAEP as an Allor-nothing Transform,” in Advances in Cryptology (CRYPTO),1999, pp. 503–518.

[18] R. Canetti, C. Dwork, M. Naor, and R. Ostrovsky, “Deniable Encryption,” in Proceedings of CRYPTO, 1997.

[19] C. Charnes, J. Pieprzyk, and R. Safavi-Naini, “Conditionally secure secret sharing schemes with disenrollment capability,” in ACM Conference on Computer and Communications Security (CCS), 1994, pp. 89–95.