Paper 2011/362
Practically Efficient Proof of Retrievability in Cloud Storage
Jia XU and Ee-Chien CHANG
Abstract
Proofs of Retrievability ({\POR}) is a cryptographic method for remotely auditing the integrity of files stored in the cloud,
without keeping a copy of the original files in local storage. In a {\POR} scheme, a user Alice backups her data file together with some authentication data to a potentially dishonest cloud storage server Bob. Later, Alice can periodically and remotely verify the integrity of her data stored with Bob using the authentication data, without retrieving back the data file during a verification. Besides security, performances in communication, storage overhead and computaton are major considerations. Shacham and Waters~\cite{CompactPOR} gave a fast scheme with
Note: An efficient variant version of Ateniese's PDP scheme (CCS '07: Provable data possession at untrusted stores) is in the appendix, which requires no exponentiations in setup.
Metadata
- Available format(s)
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Cloud StorageProofs of RetrievabilityRemote Data Integrity CheckHomomorphic Authentication TagPolynomial CommitmentProvable Data Possession
- Contact author(s)
- jiaxu2001 @ gmail com
- History
- 2011-10-15: last of 8 revisions
- 2011-07-10: received
- See all versions
- Short URL
- https://ia.cr/2011/362
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2011/362, author = {Jia XU and Ee-Chien CHANG}, title = {Practically Efficient Proof of Retrievability in Cloud Storage}, howpublished = {Cryptology {ePrint} Archive, Paper 2011/362}, year = {2011}, url = {https://eprint.iacr.org/2011/362} }