Fulfilling mutual nonrepudiation for cloud storage

Gwan Hwan Hwang*, Wei Sian Huang, Jenn Zjone Peng, Yu Wei Lin

*此作品的通信作者

研究成果: 雜誌貢獻期刊論文同行評審

2 引文 斯高帕斯(Scopus)

摘要

In this paper, we propose solution for obtaining mutual nonrepudiation between the user and service provider in cloud storage. One of the solutions for mutual nonrepudiation is based on logging attestations, which are signed messages. For supporting write-serializability and read freshness of files, an intuitive solution is to have attestations be chain hashed. However, it is inefficient when files in an account can be accessed by multiple client devices interchangeably because client devices must keep all the attestations or there must exist a way to broadcast the last attestation to all the client devices. We propose a scheme that can guarantee mutual nonrepudiation between the user and service provider without requiring the client devices to exchange any messages, and each client device only has to store the last attestation it received. Concurrent accesses of files should be forbidden if all attestations need to be chained together with one chain. We propose to use multiple chains to provide concurrent file accesses in a single account. In addition, we also propose how to apply the hash tree to remove accumulated attestations. The results from related experiments demonstrate the feasibility of the proposed scheme. A service provider of cloud storage can use the proposed scheme to provide a mutual nonrepudiation guarantee in their service-level agreement.

原文英語
頁(從 - 到)583-599
頁數17
期刊Concurrency Computation Practice and Experience
28
發行號3
DOIs
出版狀態已發佈 - 2016 3月 10

ASJC Scopus subject areas

  • 軟體
  • 理論電腦科學
  • 電腦網路與通信
  • 電腦科學應用
  • 計算機理論與數學

指紋

深入研究「Fulfilling mutual nonrepudiation for cloud storage」主題。共同形成了獨特的指紋。

引用此