2014
DOI: 10.1155/2014/293214
|View full text |Cite
|
Sign up to set email alerts
|

An Enhanced Erasure Code-Based Security Mechanism for Cloud Storage

Abstract: Cloud computing offers a wide range of luxuries, such as high performance, rapid elasticity, on-demand self-service, and low cost. However, data security continues to be a significant impediment in the promotion and popularization of cloud computing. To address the problem of data leakage caused by unreliable service providers and external cyber attacks, an enhanced erasure code-based security mechanism is proposed and elaborated in terms of four aspects: data encoding, data transmission, data placement, and d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 14 publications
0
1
0
Order By: Relevance
“…Since Z and L have exactly one common divisor, we may calculate N as the residual after dividing by L, and then find the multiplicative inverse of N modulo L, denoted by d. Therefore, N and X stand for the public keys, and d for the private one. If Z and M have the same greatest common divisor, then the process is repeated to find d, the multiplicative inverse of N modulo M. This is done in the same way as when Z and M have different greatest common divisors [12]. As a result, we set up the public keys as N and Y and keep the secret key as d. Due to the uncertainty of L and M, attempts to compromise the private key will include breaking the public key cryptosystem.…”
Section: International Journal On Recent and Innovation Trends In Com...mentioning
confidence: 99%
“…Since Z and L have exactly one common divisor, we may calculate N as the residual after dividing by L, and then find the multiplicative inverse of N modulo L, denoted by d. Therefore, N and X stand for the public keys, and d for the private one. If Z and M have the same greatest common divisor, then the process is repeated to find d, the multiplicative inverse of N modulo M. This is done in the same way as when Z and M have different greatest common divisors [12]. As a result, we set up the public keys as N and Y and keep the secret key as d. Due to the uncertainty of L and M, attempts to compromise the private key will include breaking the public key cryptosystem.…”
Section: International Journal On Recent and Innovation Trends In Com...mentioning
confidence: 99%
“…But, security of the cloud data storage against the pollution attacks was not considered. An enhanced security mechanism based on erasure code was developed in [21] to attain higher data availability, security in cloud data storage.…”
Section: Introductionmentioning
confidence: 99%