论文标题
使用低服务器存储的动态可检索性证明
Dynamic proofs of retrievability with low server storage
论文作者
论文摘要
可检索性（PORS）的证明是协议，使客户可以远程存储数据，并通过审核有效地确保整个数据仍然完整。动态POR系统还支持有效检索和更新数据的任何一小部分数据。我们为动态POR提出了新的简单协议，该协议是为实用效率而设计的，交易减少了持续存储以增加服务器计算，并且实际上表明，这种权衡是通过任何POR方案的时间空间证明固有的。值得注意的是，我们的是第一个动态POR，它不需要对服务器上存储的数据进行任何特殊编码，这意味着它可以与任何数据库服务或现有技术进行加密或冗余技术琐碎地组成。我们在Google Cloud Platform上的实施和部署表明我们的解决方案是可扩展的：例如，审计1TB文件仅需少于5分钟，成本低于$ 0.08 USD。我们还提出了几个进一步的增强功能，减少了客户端存储的数量，通信带宽或允许公共验证性，其中任何不受信任的第三方都可以进行审核。
Proofs of Retrievability (PoRs) are protocols which allow a client to store data remotely and to efficiently ensure, via audits, that the entirety of that data is still intact. A dynamic PoR system also supports efficient retrieval and update of any small portion of the data. We propose new, simple protocols for dynamic PoR that are designed for practical efficiency, trading decreased persistent storage for increased server computation, and show in fact that this tradeoff is inherent via a lower bound proof of time-space for any PoR scheme. Notably, ours is the first dynamic PoR which does not require any special encoding of the data stored on the server, meaning it can be trivially composed with any database service or with existing techniques for encryption or redundancy. Our implementation and deployment on Google Cloud Platform demonstrates our solution is scalable: for example, auditing a 1TB file takes just less than 5 minutes and costs less than $0.08 USD. We also present several further enhancements, reducing the amount of client storage, or the communication bandwidth, or allowing public verifiability, wherein any untrusted third party may conduct an audit.
