ENHANCING CLOUD SECURITY: STRATEGIES AND TECHNOLOGIES FOR PROTECTING DATA IN CLOUD ENVIRONMENTS
Keywords:
Cloud, Cryptography, Data protection, Security.Abstract
With the rapid adoption of cloud computing, ensuring the security of data has become a paramount concern for organizations of all sizes. This paper explores various strategies and technologies for protecting data in cloud environments. Encryption emerges as a fundamental technique for safeguarding data both at rest and in transit, with block ciphers and stream ciphers offering robust encryption methods. Additionally, hash functions play a critical role in verifying data integrity and ensuring secure data storage. We delve into the implementation of these techniques in cloud environments, highlighting best practices for encryption, key management, and data integrity verification. Moreover, we address common cloud vulnerabilities, such as lack of appropriate governance, isolation failure, and malicious attacks, and discuss mitigation strategies to strengthen cloud security posture. By leveraging encryption, block ciphers, stream ciphers, and hash functions, organizations can enhance data protection in the cloud and mitigate the risks associated with unauthorized access, data breaches, and tampering. This paper serves as a comprehensive guide for organizations seeking to enhance their cloud security and maintain trust in cloud-based services.
Downloads
References
Victor S. Miller. Use of elliptic curves in cryptography. Crypto 1985, LNCS 218, pp. 417-426, 1985.
Neal Koblitz. Elliptic curve cryptosystems. Mathematics of Computa- tion, Vol. 48, No. 177, pp. 203-209, 1987.
R.L. Rivest, A. Shamir, and L.M. Adleman. A method for obtaining digital signatures and publickey cryptosystems. Commun. ACM, Vol. 21, No. 2, pp. 120-126, 1978.
Whelan, C., Scott, M.: The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 225-246. Springer, Heidelberg (2007).
Nadia El Mrabet, Nicolas Guillermin, and Sorina Ionica. A study of pairing computation for curves with embedding degree 15. DBLP volume 2009.
Nadia El Mrabet and Marc Joye. GUIDE TO PAIRING-BASED CRYP- TOGRAPHY. Chapman and Hall/CRC CRYPTOGRAPHY AND NET- WORK SECURITY, 2018.
Emmanuel Fouotsa, Nadia El Mrabet and Aminatou Pecha. Optimal Ate Pairing on Elliptic Curves with Embedding Degree 9; 15 and 27. journal of Groups, Complexity, Cryptology, Volume 12, issue 1 (April 17, 2020)
Narcisse Bang Mbiang, Diego De Freitas Aranha, Emmanuel Fouotsa. Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level. Int. J. Applied Cryptog- raphy, Vol. 4, No. 1, 2020.
Md. Al-Amin Khandaker, Taehwan Park, Yasuyuki Nogami, and Howon Kim, Member, KIICE. A Comparative Study of Twist Property in KSS Curves of Embedding Degree 16 and 18 from the Implementation Perspective. J. lnf. Commun. Converg. Eng. 15(2): 97-103, Jun. 2017.
Md. Al-Amin Khandaker, Yasuyuki NOGAMI. Isomorphic Mapping for Ate-based Pairing over KSS Curve of Embedding Degree 18. 10.1109/CANDAR.2016.0113 November 2016.
Rahat Afreen, S.C. Mehrotra. A REVIEW ON ELLIPTIC CURVE CRYPTOGRAPHY FOR EMBEDDED SYSTEMS. International Jour-
nal of Computer Science & Information Technology (IJCSIT), Vol 3.
Md. Al-Amin Khandaker, Yasuyuki NOGAMI. A Consideration of Tow-
ering Scheme for Efficient Arithmetic Operation over Extension Field of Degree 18. 19th International Conference on Computer and Information Technology, December 18-20, 2016, North South University, Dhaka, Bangladesh.
