Fulfilling mutual nonrepudiation for cloud storage

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

研究成果: 雜誌貢獻文章

1 引文 (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
28
發行號3
DOIs
出版狀態已發佈 - 2016 三月 10

指紋

Non-repudiation
Concurrent
Service Level Agreement
Signed
Experiments
Broadcast
Intuitive
Demonstrate
Experiment

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Computer Science Applications
  • Computer Networks and Communications
  • Computational Theory and Mathematics

引用此文

Fulfilling mutual nonrepudiation for cloud storage. / Hwang, Gwan-Hwan; Huang, Wei Sian; Peng, Jenn Zjone; Lin, Yu Wei.

於: Concurrency Computation, 卷 28, 編號 3, 10.03.2016, p. 583-599.

研究成果: 雜誌貢獻文章

Hwang, Gwan-Hwan ; Huang, Wei Sian ; Peng, Jenn Zjone ; Lin, Yu Wei. / Fulfilling mutual nonrepudiation for cloud storage. 於: Concurrency Computation. 2016 ; 卷 28, 編號 3. 頁 583-599.
@article{17e235e3e01a4ec792964e14aad599c2,
title = "Fulfilling mutual nonrepudiation for cloud storage",
abstract = "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.",
keywords = "SLA, cloud security, cloud storage, hash tree, nonrepudiation, service-level agreement",
author = "Gwan-Hwan Hwang and Huang, {Wei Sian} and Peng, {Jenn Zjone} and Lin, {Yu Wei}",
year = "2016",
month = "3",
day = "10",
doi = "10.1002/cpe.3315",
language = "English",
volume = "28",
pages = "583--599",
journal = "Concurrency Computation Practice and Experience",
issn = "1532-0626",
publisher = "John Wiley and Sons Ltd",
number = "3",

}

TY - JOUR

T1 - Fulfilling mutual nonrepudiation for cloud storage

AU - Hwang, Gwan-Hwan

AU - Huang, Wei Sian

AU - Peng, Jenn Zjone

AU - Lin, Yu Wei

PY - 2016/3/10

Y1 - 2016/3/10

N2 - 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.

AB - 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.

KW - SLA

KW - cloud security

KW - cloud storage

KW - hash tree

KW - nonrepudiation

KW - service-level agreement

UR - http://www.scopus.com/inward/record.url?scp=84956646382&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84956646382&partnerID=8YFLogxK

U2 - 10.1002/cpe.3315

DO - 10.1002/cpe.3315

M3 - Article

AN - SCOPUS:84956646382

VL - 28

SP - 583

EP - 599

JO - Concurrency Computation Practice and Experience

JF - Concurrency Computation Practice and Experience

SN - 1532-0626

IS - 3

ER -