A New Efficient and Secure POR Scheme Based on Network Coding
A New Efficient and Secure POR Scheme Based on Network Coding
复制标题
DOI：
10.1109/aina.2014.17
复制
发表时间：
2014-05
期刊：
影响因子：
--
通讯作者：
Kazumasa Omote;Tran Thao Phuong
中科院分区：
文献类型：
--
作者：
Kazumasa Omote;Tran Thao Phuong
信息迅速增长，数据库所有者倾向于将数据外包给称为云计算的外部服务提供商。使用云，客户可以远程存储数据，而不需要在本地存储和维护数据。然而，这样的服务提供商是不可信任的，因此在数据安全方面存在一些挑战：完整性、可用性和机密性。由于完整性和可用性是系统存在的先决条件，因此我们主要关注它们而不是机密性。为了确保完整性和可用性，研究人员提出了基于网络编码的POR(可检索性证明)方案，使服务器能够证明数据是否可检索。然而，大多数基于网络编码的POR方案在数据检测方面效率低下，并且不能防止POR中的一种常见攻击：小破坏攻击。本文提出了一种新的基于网络编码的POR方案，该方案使用分散码来降低检测阶段的成本，同时也防止了小的破坏攻击。
Information is increasing quickly, database owners have tendency to outsource their data to an external service provider called Cloud Computing. Using Cloud, clients can remotely store their data without burden of local data storage and maintenance. However, such service provider is untrusted, therefore there are some challenges in data security: integrity, availability and confidentiality. Since integrity and availability are prerequisite conditions of the existence of a system, we mainly focus on them rather than confidentiality. To ensure integrity and availability, researchers have proposed network coding-based POR (Proof of Retrievability) schemes that enable the servers to demonstrate whether the data is retrievable or not. However, most of network coding-based POR schemes are inefficient in data checking and also cannot prevent a common attack in POR: small corruption attack. In this paper, we propose a new network coding-based POR scheme using dispersal code in order to reduce cost in checking phase and also to prevent small corruption attack.