Data security in cloud environment using cryptographic mechanism

Fairosebanu, Abdul Azis; Jebaseeli, Antony Cruz Nisha

doi:10.11591/eei.v12i1.4590

Cited by 5 publications

(2 citation statements)

References 20 publications

(22 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We used property-based encryption to outline NHACSM. Java and NetBeans build up the latest cloud environment using the latest CloudSim connectors [18] and [19]. Each host has 2.4 Hz, 4-8 GB RAM, and 1 TB storage for this execution.…”

Section: Experimental Evaluationmentioning

confidence: 99%

Hierarchal attribute based cryptographic model to handle security services in cloud environment: a new model

Rajarao,

Sreenivasulu

2024

IJECE

View full text Add to dashboard Cite

The sharing of information in the cloud is a unique element of the environment, but there is a risk that the information may land with the wrong people. To counterattack this problem, security-associated methodologies were used to secure the information that was readily available to clients. Despite the lack of benefits, this provides productive/adaptability and dependability in access control strategies between clients in the sharing of information. The novel hierarchal attribute-based cryptographic security model (NHACSM) is being proposed to provide adaptability, versatility, and access control in sharing information in the appropriate climate. This model allows clients to share information in a hierarchal way, allowing for a productive assessment of access control strategy and improved security. The NHACSM method is used to reduce the total time values for different user instances compared to conventional approaches, for example, attribute-set-based encryption (ASBE), key-policy attribute-based encryption (KP-ABE), and ciphertext-policy attribute-based encryption (CP-ABE). With respect to 10 instances existing methods achieve 2.7, 2.5, and 2.3 respectively, and also compared to 20, 30, 40, and 50 instances, our proposed method is low. The encryption and decryption time evaluation values and performance evaluation of different approaches, ASBE, CP-ABE, were taken into account when increasing the user instance.

show abstract

Section: Experimental Evaluationmentioning

confidence: 99%

Hierarchal attribute based cryptographic model to handle security services in cloud environment: a new model

Rajarao,

Sreenivasulu

2024

IJECE

View full text Add to dashboard Cite

show abstract

“…Recently, many international companies have ranked security [45][46][47] as the most difficult parameter to achieve in the cloud and the first challenge for cloud developers and users. In the literature, several heuristics and meta-heuristics have been developed to optimize cost, processing time, and distribute workflows and tasks [48][49][50]. Heuristics and algorithms for planning workflow in a cloud environment, taking into account security parameters, are not extensively developed.…”

Section: Study Backgroundmentioning

confidence: 99%

Intelligent Solution System for Cloud Security Based on Equity Distribution: Model and Algorithms

Eljack,

Jemmali,

Denden

et al. 2024

CMC

View full text Add to dashboard Cite

In the cloud environment, ensuring a high level of data security is in high demand. Data planning storage optimization is part of the whole security process in the cloud environment. It enables data security by avoiding the risk of data loss and data overlapping. The development of data flow scheduling approaches in the cloud environment taking security parameters into account is insufficient. In our work, we propose a data scheduling model for the cloud environment. The model is made up of three parts that together help dispatch user data flow to the appropriate cloud VMs. The first component is the Collector Agent which must periodically collect information on the state of the network links. The second one is the monitoring agent which must then analyze, classify, and make a decision on the state of the link and finally transmit this information to the scheduler. The third one is the scheduler who must consider previous information to transfer user data, including fair distribution and reliable paths. It should be noted that each part of the proposed model requires the development of its algorithms. In this article, we are interested in the development of data transfer algorithms, including fairness distribution with the consideration of a stable link state. These algorithms are based on the grouping of transmitted files and the iterative method. The proposed algorithms show the performances to obtain an approximate solution to the studied problem which is an NP-hard (Non-Polynomial solution) problem. The experimental results show that the best algorithm is the half-grouped minimum excluding (HME), with a percentage of 91.3%, an average deviation of 0.042, and an execution time of 0.001 s.

show abstract