scholarly journals Symmetric-Key Based Proofs of Retrievability Supporting Public Verification

Author(s):  
Chaowen Guan ◽  
Kui Ren ◽  
Fangguo Zhang ◽  
Florian Kerschbaum ◽  
Jia Yu
2019 ◽  
Vol 7 (4) ◽  
pp. 220-224
Author(s):  
J.Lenin . ◽  
B. Sundaravadivazhagan ◽  
M. Sulthan Ibrahim
Keyword(s):  

Author(s):  
Kaldius Ndruru ◽  
Putri Ramadhani

Security of data stored on computers is now an absolute requirement, because every data has a high enough value for the user, reader and owner of the data itself. To prevent misuse of the data by other parties, data security is needed. Data security is the protection of data in a system against unauthorized authorization, modification, or destruction. The science that explains the ways of securing data is known as cryptography, while the steps in cryptography are called critical algorithms. At this time, there are many cryptographic algorithms whose keys are weak especially the symmetric key algorithm because they only have one key, the key for encryption is the same as the decryption key so it needs to be modified so that the cryptanalysts are confused in accessing important data. The cryptographic method of Word Auto Key Encryption (WAKE) is one method that has been used to secure data where in this case the writer wants to maximize the encryption key and description of the WAKE algorithm that has been processed through key formation. One way is to apply the algebraic pascal triangle method to maximize the encryption key and description of the WAKE algorithm, utilizing the numbers contained in the columns and rows of the pascal triangle to make shifts on the encryption key and the description of the WAKE algorithm.Keywords: Cryptography, WAKE, pascal


2019 ◽  
Author(s):  
Ira Nath ◽  
Renesha Ghosh ◽  
Sourav Ghosh ◽  
Pranati Rakshit ◽  
Dharmpal Singh

2019 ◽  
Author(s):  
Ira Nath ◽  
Pranati Rakshit ◽  
Renesha Ghosh ◽  
Sourav Ghosh ◽  
Dharmpal Singh

2020 ◽  
Vol 63 (8) ◽  
pp. 1216-1230 ◽  
Author(s):  
Wei Guo ◽  
Sujuan Qin ◽  
Jun Lu ◽  
Fei Gao ◽  
Zhengping Jin ◽  
...  

Abstract For a high level of data availability and reliability, a common strategy for cloud service providers is to rely on replication, i.e. storing several replicas onto different servers. To provide cloud users with a strong guarantee that all replicas required by them are actually stored, many multi-replica integrity auditing schemes were proposed. However, most existing solutions are not resource economical since users need to create and upload replicas of their files by themselves. A multi-replica solution called Mirror is presented to overcome the problems, but we find that it is vulnerable to storage saving attack, by which a dishonest provider can considerably save storage costs compared to the costs of storing all the replicas honestly—while still can pass any challenge successfully. In addition, we also find that Mirror is easily subject to substitution attack and forgery attack, which pose new security risks for cloud users. To address the problems, we propose some simple yet effective countermeasures and an improved proofs of retrievability and replication scheme, which can resist the aforesaid attacks and maintain the advantages of Mirror, such as economical bandwidth and efficient verification. Experimental results show that our scheme exhibits comparable performance with Mirror while achieving high security.


Sign in / Sign up

Export Citation Format

Share Document