首页> 外文会议>2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications >A Mutual Nonrepudiation Protocol for Cloud Storage with Interchangeable Accesses of a Single Account from Multiple Devices
【24h】

A Mutual Nonrepudiation Protocol for Cloud Storage with Interchangeable Accesses of a Single Account from Multiple Devices

机译:一种用于云存储的相互不可否认协议,可从多个设备对单个帐户进行可互换访问

获取原文
获取原文并翻译 | 示例

摘要

Obtaining mutual nonrepudiation between the user and service provider is crucial in cloud storage. One of the solutions for mutual nonrepudiation is based on logging attestations, which are signed messages. For every request, clients and service provider exchange attestations. These attestations will be used in an auditing protocol to verify their behavior. The chain-hashing scheme chains attestations and stores them in service provider for supporting write serializability and read freshness of files. However, the chain-hashing scheme is inefficient when files in an account can be accessed by multiple client devices interchangeably. In this paper we first show that the chain-hashing scheme cannot resist roll-back attack from service provider unless client devices keep all the attestations or there exists 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. 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.
机译:在云存储中,获取用户和服务提供商之间的不可否认性至关重要。相互不可否认性的解决方案之一是基于日志证明,即签名消息。对于每个请求,客户和服务提供商都会交换证明。这些证明将用于审核协议中以验证其行为。链哈希方案将证明链接起来,并将其存储在服务提供者中,以支持写入可序列化性和文件的读取新鲜度。但是,当一个帐户中的文件可以由多个客户端设备互换访问时,链式哈希方案效率很低。在本文中,我们首先表明,除非客户端设备保留所有证明,或者存在一种向所有客户端设备广播最后一个证明的方法,否则,链哈希方案无法抵抗来自服务提供商的回滚攻击。我们提出了一种方案,该方案可以保证用户和服务提供商之间的相互不可否认性,而无需客户端设备交换任何消息,并且每个客户端设备只需要存储收到的最后一个证明即可。我们还提出了如何应用哈希树来删除累积的证明。相关实验的结果证明了该方案的可行性。云存储服务提供商可以使用建议的方案在其服务级别协议中提供相互不可否认的保证。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号