Block Level Time Variant Dynamic Encryption Algorithm for Improved Cloud Security and Deduplication Using Block Level Topical Similarity

2021 ◽  
Vol 19 (1-2) ◽  
pp. 1
Author(s):  
N. Malarvizhi ◽  
S. Sabeetha Saraswathi
Keyword(s):  
Cloud Security ◽  
Encryption Algorithm ◽  
Block Level ◽  
Dynamic Encryption

Dynamic Encryption Algorithm Based on Rijndael

2012 ◽  
Vol 490-495 ◽  
pp. 339-342
Author(s):  
Zhi Qiang Liu ◽  
De Han
Keyword(s):  
Encryption Algorithm ◽  
Dynamic Encryption

By introducing dynamic keys in this paper, we present a new encryption algorithm ,which is called dynamic encryption algorithm. The algorithm allows a key to encrypt the plaintext twice, producing two ciphertexts, so that each of them is different if the time is not same. Thus chosen plaintext attacks and known plaintext attacks will become infeasible .

The Research of Dynamic Encryption Algorithm

2012 ◽  
Vol 542-543 ◽  
pp. 1447-1450
Author(s):  
Hong Wei Xue ◽  
Shi Qun Shen ◽  
Li Na Zhu ◽  
Zhi Guo
Keyword(s):  
Encryption Algorithm ◽  
Stochastic Algorithm ◽  
Dynamic Algorithm ◽  
Broad Application ◽  
Dynamic Encryption ◽  
Key Length

The dynamic encryption algorithm is based on the idea of carrying on encryption to the information using dynamic algorithm; it is one kind of algorithm which can produce the stochastic algorithm. The key length of dynamic encryption algorithm is random, is suitable to carry on the encryption to the random length plaintext, and the encryption speed is quick, the intensity is high, and therefore there is the broad application prospect. This article given one kind of dynamic encryption algorithm models based on the ergodic matrix and proves the algorithm security according to the analysis on massive empirical datum.

scholarly journals Enhancing Security in Cloud Computing using Playfair and Ceasar Cipher in Substitution Techniques

2020 ◽  
Vol 9 (4) ◽  
pp. 912-920
Keyword(s):  
Cloud Computing ◽  
Significant Role ◽  
Data Security ◽  
Research Work ◽  
Cloud Security ◽  
Encryption Algorithm ◽  
Data Confidentiality ◽  
Security Issues ◽  
Cloud Providers ◽  
Cloud Automation

Cloud Computing is playing the significant role in the existent submissions the humans life. Cloud computing is an extravagant set of conveniently and operative virtualized assets, like as hardware, evolution platforms and utility. Cloud computing is a exclusive generation of the parallel conception. The cloud computing extensibility is a concern of the allotment of revenue on mastery demand. Cloud computing accommodate the operation of uniting. The elevation of the cloud automation also raises the security controversy twice. So, there is a need to solve the security contention in the cloud automation. Reasons for maturity of cloud security for disparate inhabitants and disparate prospect depend upon the exaction. The main trouble correlate with cloud computing is data confidentiality, preservation, data stealing, data breaches etc. In this research work, it is proposed to use a new level of data security solution using Playfair cipher and Ceasar cipher algorithm. Both the algorithms are encrypted by the full set of 256 ASCII characters. A new encryption algorithm for security is implemented in this work. The main aim of this research work is to clarify the security issues in both cloud providers and cloud consumers using cryptography encryption methods.

Dynamic Encryption Algorithm Based on Ergodic Matrix

2012 ◽  
Vol 542-543 ◽  
pp. 1451-1454
Author(s):  
Quan Wang ◽  
Zhi Guo ◽  
Jun Ru Zhang ◽  
Qi Gui Zang
Keyword(s):  
Encryption Algorithm ◽  
Stochastic Algorithm ◽  
Dynamic Algorithm ◽  
Broad Application ◽  
Concrete Realization ◽  
Dynamic Encryption ◽  
Key Length

The dynamic encryption algorithm is based on the idea of carrying on encryption to the information using dynamic algorithm; it is one kind of algorithm which can produce the stochastic algorithm. The algorithm, may guarantee that the algorithm transforms dynamically using each time, like this caused that the security of the cryptogram system is relied on protection to cryptogram and also carry on the protection to the encryption algorithm. The key length of dynamic encryption algorithm is random, is suitable to carry on the encryption to the random length plaintext, and the encryption speed is quick, the intensity is high, and therefore there is the broad application prospect. This article given one kind of dynamic encryption algorithm models based on the ergodic matrix as well as the concrete realization method, and proves the algorithm security according to the analysis on massive empirical datum.

Achieving Efficient Purging in Transparent per-file Secure Wiping Extensions

2015 ◽  
pp. 345-357 ◽  
Author(s):  
Wasim Ahmad Bhat
Keyword(s):  
Cloud Security ◽  
Confidential Information ◽  
Low Level ◽  
The Third ◽  
Block Level ◽  
Secure Deletion ◽  
Efficiency And Reliability ◽  
Security Alliance

According to a recent Cloud Security Alliance Report, insider attacks are the third biggest threat in Cloud Security. A malicious-insider can access the low-level device, and recover the sensitive and confidential information which had been deleted by the customer with a belief that the data no more exists physically. Though proposals for secure deletion of data exist, specifically transparent per-file secure wiping extensions, however, they are not efficient and reliable. In this chapter, we propose an efficient and reliable transparent per-file-wiping filesystem extension called restfs. Instead of overwriting at file level which is found in existing wiping extensions, restfs overwrites at block level to exploit the behavior of filesystems for efficiency and reliability. We empirically evaluated the efficiency of restfs using Postmark benchmark and results indicate that restfs can save 28-98% of block overwrites which otherwise need necessarily to be performed in existing wiping extensions. In addition, it can also reduce the number of write commands issued to the disk by 88%.

Sign in / Sign up

Export Citation Format

Share Document