Symmetric-Key Based Proofs of Retrievability Supporting Public Verification
Lists
Only you see this
Abstract
Proofs-of-Retrievability enables a client to store his data on a cloud server so that he executes an efficient auditing protocol to check that the server possesses all of his data in the future. During an audit, the server must maintain full knowledge of the client’s data to pass, even though only a few blocks of the data need to be accessed. Since the first work by Juels and Kaliski, many PoR schemes have been proposed and some of them can support dynamic updates. However, all the existing works that achieve public verifiability are built upon traditional public-key cryptosystems which imposes a relatively high computational burden on low-power clients (e.g., mobile devices).
BibTeX
@inproceedings{guan2015symmetric,
author = {Chaowen Guan and Kui Ren and Fangguo Zhang and Florian Kerschbaum and Jia Yu},
title = {{Symmetric-Key Based Proofs of Retrievability Supporting Public Verification}},
booktitle = {ESORICS},
year = {2015},
doi = {10.1007/978-3-319-24174-6\_11},
}| Towards Efficient Provable Data Possession | IACR ePrint · 2011 |
| Practically Efficient Proof of Retrievability in Cloud Storage | IACR ePrint · 2011 |
| Enabling Public Verifiability and Data Dynamics for Storage Security | IACR ePrint · 2009 |
| Lightweight Certificate-Based Public/Private Auditing Scheme Based on Bilinear Pairing for Cloud Storage | IEEE Access · 2020 |
| Proofs of retrievability: theory and implementation | IACR ePrint · 2008 |
| Privacy-Preserving Public Auditing for Secure Cloud Storage | IACR ePrint · 2009 |