Mirror: Enabling Proofs of Data Replication and Retrievability in the Cloud
Frederik Armknecht, Ludovic Barman, Jens-Matthias Bohli, Ghassan O. Karame
摘要
Proofs of Retrievability (POR) and Data Possession (PDP) are cryptographic protocols that enable a cloud provider to prove that data is correctly stored in the cloud. PDP have been recently extended to enable users to check in a single protocol that additional file replicas are stored as well. To conduct multi-replica PDP, users are however required to process, construct, and upload their data replicas by themselves. This incurs additional bandwidth overhead on both the service provider and the user and also poses new security risks for the provider. Namely, since uploaded files are typically encrypted, the provider cannot recognize if the uploaded content are indeed replicas. This limits the business models available to the provider, since e.g., reduced costs for storing replicas can be abused by users who upload different files-while claiming that they are replicas. In this paper, we address this problem and propose a novel solution for proving data replication and retrievability in the cloud, Mirror, which allows to shift the burden of constructing replicas to the cloud provider itself-thus conforming with the current cloud model. We show that Mirror is secure against malicious users and a rational cloud provider. Finally, we implement a prototype based on Mirror, and evaluate its performance in a realistic cloud setting. Our evaluation results show that our proposal incurs tolerable overhead on the users and the cloud provider.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- Dynamic proofs of retrievability with low server storageGaspard Anthoine, Jean-Guillaume Dumas, Mélanie de Jonghe, Aude Maignan 等USENIX Security 2021 · 被引用 28 次
- Compact Key Storage - A Modern Approach to Key Backup and DelegationYevgeniy Dodis, Daniel Jost, Antonio MarcedoneCRYPTO 2024 · 被引用 2 次
- Proof of Storage-Time: Efficiently Checking Continuous Data AvailabilityGiuseppe Ateniese, Long Chen, Mohammad Etemad, Qiang TangNDSS 2020
相关 Paper
- Efficient Dynamic Proof of Retrievability for Cold StorageTung Le, Pengzhi Huang, Attila A. Yavuz, Elaine Shi 等NDSS 2023
- PhotoProof: Cryptographic Image Authentication for Any Set of Permissible TransformationsAssa Naveh, Eran TromerS&P 2016 · 被引用 97 次
- Efficient and Verifiable Proof of Replication with Fast Fault LocalizationHaoran Yuan, Xiaofeng Chen, Guowen Xu, Jianting Ning 等INFOCOM 2021 · 被引用 4 次
- Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial EvaluationGiuseppe Ateniese, Foteini Baldimtsi, Matteo Campanelli, Danilo Francati 等CRYPTO 2024 · 被引用 5 次
- Breaking and Fixing Content-Defined ChunkingKien Tuong Truong, Simon-Philipp Merz, Matteo Scarlata, Felix Günther 等CCS 2025
