RSA based encryption approach for preserving confidentiality of big data

Sharma, Kanika; Agrawal, Alka; Pandey, Dhirendra; Khan, Raees Ahmad; Dinkar, Shail Kumar

doi:10.1016/j.jksuci.2019.10.006

Cited by 22 publications

(20 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, the adopted SM‐AO model was computed over extant optimization schemes such as AO, LA, ROA, SSO, and PRO schemes. In addition, the adopted SM‐AO model was computed over extant encryption schemes such as CP‐ABE, 35 NLCA, 36 AES, 37 blowfish, 38 ECC, 39 RSA, 40 and El‐gamal 41 . Further, analysis was done regarding time metrics and attacks like CPA, CCA, KPA and KCA.…”

Section: Resultsmentioning

confidence: 99%

“…Actually, the key sensitivity in terms of correlation should be minimal for better system performance. In that way, the adopted model is found to accomplish least key sensitivity outcomes over compared models like AO, LA, ROA, SSO, and PRO, CP-ABE, 35 NLCA, 36 AES, 37 blowfish, 38 ECC, 39 RSA, 40 and El-gamal. 41 On examining 1st dataset, the key Sensitivity values gained by SM-AO is much minimal than other models.…”

Section: Key Sensitivity Analysismentioning

confidence: 98%

See 1 more Smart Citation

Novel quantum key distribution and attribute based encryption for cloud data security

Verma

Kumar

2023

Concurrency and Computation

View full text Add to dashboard Cite

SummaryImprovement of privacy and security in data centers is challenging with proficient safety key managing. So as to resolve this issue, data centers require proficient quantum cryptographic techniques with authentication methods that are suitable to improve the privacy and security with lesser intricacy. In addition, quantum cryptography (QC) offers maximal security with lesser complication, which raises the security strength and storing capability of big data. This work intends to introduce a QC oriented data security model in cloud via electing the optimal private key. Here, attribute based encryption (ABE) is performed for ensuring better data transmission among the nodes in cloud. For key generation in ABE, improved QKD is adopted in this work. Depending upon this, the decryption and encryption is done. Moreover, for optimal secret key selection in ABE, self‐modified Aquila optimization (SM‐AO) scheme is deployed. Further, analysis is done depending upon varied metrics.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Key Sensitivity Analysismentioning

confidence: 98%

Novel quantum key distribution and attribute based encryption for cloud data security

Verma

Kumar

2023

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…The most common definition of information security is that information cannot be disclosed to anyone. It is a combination of three main components, i.e., security, privacy, and accessibility [3,4]. Sharing information nowadays can pose jeopardy to any organisation and any user's privacy.…”

Section: Introductionmentioning

confidence: 99%

Evaluating Security of Big Data Through Fuzzy Based Decision-Making Technique

Alassery¹,

Alzahrani²,

Khan³

et al. 2023

Computer Systems Science and Engineering

View full text Add to dashboard Cite

In recent years, it has been observed that the disclosure of information increases the risk of terrorism. Without restricting the accessibility of information, providing security is difficult. So, there is a demand for time to fill the gap between security and accessibility of information. In fact, security tools should be usable for improving the security as well as the accessibility of information. Though security and accessibility are not directly influenced, some of their factors are indirectly influenced by each other. Attributes play an important role in bridging the gap between security and accessibility. In this paper, we identify the key attributes of accessibility and security that impact directly and indirectly on each other, such as confidentiality, integrity, availability, and severity. The significance of every attribute on the basis of obtained weight is important for its effect on security during the big data security life cycle process. To calculate the proposed work, researchers utilised the Fuzzy Analytic Hierarchy Process (Fuzzy AHP). The findings show that the Fuzzy AHP is a very accurate mechanism for determining the best security solution in a real-time healthcare context. The study also looks at the rapidly evolving security technologies in healthcare that could help improve healthcare services and the future prospects in this area.

show abstract

“…RSA [2] is the best well-known public key cryptography. It is chosen to apply with a variety of applications to secure the information such as [3], [4], [5], [6], [7], [8]. However, to avoid intruder attacks, the modulus bit length (n) should be assigned at least 1024 bits.…”

Section: Introductionmentioning

confidence: 99%

The Improved Estimation of the Least Upper Bound to Search for RSA’s Private key

2022

KSII TIIS

View full text Add to dashboard Cite

RSA is known as one of the best techniques for securing secret information across an unsecured network. The private key which is one of private parameters is the aim for attackers. However, it is exceedingly impossible to derive this value without disclosing all unknown parameters. In fact, many methods to recover the private key were proposed, the performance of each algorithm is acceptable for the different cases. For example, Wiener's attack is extremely efficient when the private key is very small. On the other hand, Fermat's factoring can quickly break RSA when the difference between two large prime factors of the modulus is relatively small. In general, if all private parameters are not disclosed, attackers will be able to confirm that the private key is unquestionably inside the scope [3, n -2], where n is the modulus. However, this scope has already been reduced by increasing the greatest lower bound to [dil, n -2], where dil ≥ 3. The aim of this paper is to decrease the least upper bound to narrow the scope that the private key will remain within this boundary. After finishing the proposed method, the new scope of the private key can be allocated as [dil, dir], where dir ≤ n -2. In fact, if the private key is extremely close to the new greatest lower bound, it can be retrieved quickly by performing a brute force attack, in which dir is decreased until it is equal to the private key. The experimental results indicate that the proposed method is extremely effective when the difference between prime factors is close to each other and one of two following requirement holds: the first condition is that the multiplier of Euler totient function is very close to the public key's small value whereas the second condition is that the public key should be large whenever the multiplier is far enough.

show abstract

RSA based encryption approach for preserving confidentiality of big data

Cited by 22 publications

References 19 publications

Novel quantum key distribution and attribute based encryption for cloud data security

Novel quantum key distribution and attribute based encryption for cloud data security

Evaluating Security of Big Data Through Fuzzy Based Decision-Making Technique

The Improved Estimation of the Least Upper Bound to Search for RSA’s Private key

Contact Info

Product

Resources

About