Mirror: Enabling Proofs of Data Replication and Retrievability in the Cloud
summary
Mirror lets a cloud prove it actually creates and stores replicas while preserving retrievability, shifting replica construction to the provider and avoiding users re-uploading copies. It combines RSA time-lock puzzles with a novel multiplicative LFSR to derive blinding factors, defines storage-allocation and extractability guarantees, and ships a prototype. With a 2000-bit modulus, private LFSR length 2, public length 15 and 40-challenge audits, stored replicas answer in ~2s versus ≥3s when recreated.
AI-written summary · about
chapters (18)
- 0:00Intro
- 0:37Cloud Storage
- 1:54Proofs of Retrievability
- 2:39Proof of Retrievability - Setup
- 3:05Proof of Retrievability - Verify
- 5:04POR - Attacker Model
- 6:06Drawbacks of POR
- 8:00Replicas?
- 9:51Drawbacks of user-generated replicas
- 12:37Generic Model
- 13:42Security Definitions
- 16:02Mirror: Replicas and Puzzles
- 18:06Cryptographic Puzzles
- 19:57Secret vs. Public LFSR
- 23:57Parameter Choices
- 25:12Performance
- 25:44Conclusions
- 28:06Format of the Replicas
related talks
31mSecure Distributed Storage
15mReflection, Rewinding, and Coin-Toss in EasyCrypt
57mThe Cryptographic Lens: Visions of our Past and Future
25mSplitting Secrets for Encrypted Backups
39mWhen Is a Proof Actually Not?
59mDelegating Computation I
27mMetadata-private data transfer
18mRevolutionizing Privacy: Luke, Sarang, Aram & Reuben on Full Membership Proofs