Title: Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing Show Chinese title

Title: 动态可追溯存储：一种用于实时云存储审计的高效协议

Abstract: Ateniese, Goodrich, Lekakis, Papamanthou, Paraskevas, and Tamassia introduced the Accountable Storage protocol, which is a way for a client to outsource their data to a cloud storage provider while allowing the client to periodically perform accountability challenges. An accountability challenge efficiently recovers any pieces of data the server has lost or corrupted, allowing the client to extract the original copies of the damaged or lost data objects. A severe limitation of the prior accountable storage scheme of Ateniese et al., however, is that it is not fully dynamic. That is, it does not allow a client to freely insert and delete data from the outsourced data set after initializing the protocol, giving the protocol limited practical use in the real world. In this paper, we present Dynamic Accountable Storage, which is an efficient way for a client to periodically audit their cloud storage while also supporting insert and delete operations on the data set. To do so, we introduce a data structure, the IBLT tree, which allows either the server or the client to reconstruct data the server has lost or corrupted in a space-efficient way. Show Chinese abstract

Abstract: 阿特尼埃斯、古迪奇、莱卡基斯、帕帕曼图、帕拉斯基瓦斯和塔马西亚引入了可追责存储协议，这是一种客户端将数据外包给云存储提供商的方法，同时允许客户端定期执行可追责挑战。 可追责挑战可以高效地恢复服务器丢失或损坏的数据片段，使客户端能够提取损坏或丢失的数据对象的原始副本。 然而，阿特尼埃斯等人之前的可追责存储方案的一个严重限制是它并不完全动态。 也就是说，在初始化协议后，它不允许客户端自由地向外包的数据集中插入和删除数据，这使得该协议在现实世界中的实际应用受到限制。 在本文中，我们提出了动态可追责存储，这是一种客户端定期审计其云存储的高效方法，同时支持对数据集的插入和删除操作。 为此，我们引入了一种数据结构，即IBLT树，它允许服务器或客户端以空间高效的方式重建服务器丢失或损坏的数据。