A Study of Public Batch Auditing in Cloud Storage

碩士 === 淡江大學 === 資訊工程學系碩士班 === 103 === The cloud storage services increase gradually, and the storage service is adopted by many companies and individuals. There are many new security issues in this hosted model. How to ensure the correctness of data stored is a very important issue in this applicati...

Full description

Bibliographic Details
Main Authors: Yu-Hsuan Yeh, 葉羽軒
Other Authors: Ren-Junn Hwang
Format: Others
Language:zh-TW
Published: 2015
Online Access:http://ndltd.ncl.edu.tw/handle/h82f5b
Description
Summary:碩士 === 淡江大學 === 資訊工程學系碩士班 === 103 === The cloud storage services increase gradually, and the storage service is adopted by many companies and individuals. There are many new security issues in this hosted model. How to ensure the correctness of data stored is a very important issue in this application. One of more accepted solution is to authorize a third party auditor to audit the data of owner in cloud storage with privacy preserving. The batch auditing tries to enhance the efficiency of third party verification. Most of the batch auditing schemes still spend a lot of communication cost and computation for the verification process. Besides, once some wrong messages show in the batch auditing results, the past related researches need to audit each audited file again to find the error ones. It is not an efficient strategy in this case. This paper proposes a new batch audit techniques to enhance the efficiency of bath auditing. The cloud server computes a proof value for the third party auditor based on the proposed audit tree structure. At the same time, the server also uses the audit tree to store the file information temporarily on the batch audit process. If a wrong message show in the batch auditing results, the cloud server retrieves and sends auditing information from the audit tree to the third party auditor without regenerating auditing information again. Third-party auditor can efficiently and quickly audit error file through secondary information by the proposed scheme. The communication and computing costs of the proposed are more efficient than the current related researches.