A Survey on Confidential Cloud Data under Secure Key Exposure
AbstractLatest records display a effective attacker which breaks facts confidentiality with the resource of obtaining cryptographic keys, by using the usage of way of coercion or backdoors in cryptographic software program. As soon as the encryption secrets uncovered, the only possible diploma to maintain information confidentiality is to restrict the attacker’s access to the ciphertext. This can be finished, as an instance, with the resource of spreading ciphertext blocks in the course of servers in a couple of administrative domain names, therefore assuming that the adversary cannot compromise them all. However, if data is encrypted with present schemes, an adversary prepared with the encryption key, can nevertheless compromise an unmarried server and decrypt the ciphertext blocks saved therein. On this paper, we observe records confidentiality in opposition to an adversary which knows the encryption key and has get admission to a massive fraction of the ciphertext blocks. To this quit, we advise Bastion, a singular and green scheme that ensures data confidentiality notwithstanding the reality that the encryption secrets leaked and the adversary has access to nearly all ciphertext blocks. We analyze the security of Bastion, and we examine its standard overall performance via manner of a prototype implementation. We also talk realistic insights with admire to the combination of Bastion in business dispersed garage structures. Our evaluation results endorse that Bastion is well-applicable for integration in existing structures since it incurs less than 5% overhead compared to existing semantically relaxed encryption modes.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 A. Beimel, “Secret-sharing schemes: A survey,” in International Workshop on Coding and Cryptology (IWCC), 2011, pp.11–46.
 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.
 G. R. Blakley and C. Meadows, “Security of ramp schemes,” in Advances in Cryptology (CRYPTO), 1984, pp. 242–268.
 V. Boyko, “On the Security Properties of OAEP as an Allor-nothing Transform,” in Advances in Cryptology (CRYPTO),1999, pp. 503–518.
 R. Canetti, C. Dwork, M. Naor, and R. Ostrovsky, “Deniable Encryption,” in Proceedings of CRYPTO, 1997.
 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.
This work is licensed under a Creative Commons Attribution 4.0 International License.