A Study of Ubiquitous Access with Confidentiality and Availability

我们提出了一种数据归档方案，将输入数据分成许多小片段，并将每个片段分布在随机选择的多个存储器中。在这项研究中，我们已经证明，我们的计划产生的归档数据不能区分随机产生的数据从概率和统计的角度来看。此外，我们已经开发了一个原型的计划，并已验证该计划是有效的，足以为实际使用。我们期望该方案能为实现云计算中廉价的备份服务提供帮助。

We propose a data archive scheme that divides the input data into many tiny fragments and distributes each fragment across multiple storages chosen at random. In this research, we have proved that the archived data generated by our scheme can not be distinguished from randomly generated data from the probability and statistical point of view. Also, we have developed a prototype of the scheme, and have verified that the scheme is efficient sufficiently for the practical use. We expect that this sc heme is useful to realize inexpensive back-up services in the cloud computing.