Dynamic Proofs of Retrievability from Chameleon-Hashes

Stefan Rass

Abstract

Proofs of retrievability (POR) are interactive protocols that allow a verifier to check the consistent existence and availability of data residing at a potentially untrusted storage provider, e.g., a cloud. While most POR protocols strictly refer to static files, i.e., content that is read-only, dynamic PORs shall achieve the same security guarantees (existence, consistency and the possibility to retrieve the data) for content that is subject to an unlimited number of (legitimate) modifications. This work discusses how to construct such a dynamic proof of retrievability from chameleon hashes (trapdoor commitments). Like standard POR constructions, the presented scheme is sentinel-based and does audit queries via spot checking mechanism. Unlike previous schemes, however, a-posteriori insertions of new sentinels throughout the lifetime of the file is supported. This novel feature is apparently absent in any other POR scheme in the literature. Moreover, the system is designed for compatibility with XML structured data files.

References

  1. Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., and Song, D. (2007). Provable data possession at untrusted stores. In Proceedings of the 14th ACM conference on Computer and communications security, CCS 7807, pages 598-609, New York, NY, USA. ACM.
  2. Ateniese, G. and de Medeiros, B. (2005). On the key exposure problem in chameleon hashes. In Proceedings of the 4th international conference on Security in Communication Networks, SCN'04, pages 165-179, Berlin, Heidelberg. Springer.
  3. Ateniese, G., Di Pietro, R., Mancini, L. V., and Tsudik, G. (2008). Scalable and efficient provable data possession. In Proceedings of the 4th international conference on Security and privacy in communication netowrks, SecureComm 7808, pages 9:1-9:10, New York, NY, USA. ACM.
  4. Ateniese, G., Kamara, S., and Katz, J. (2009). Proofs of storage from homomorphic identification protocols. In Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, ASIACRYPT 7809, pages 319-333, Berlin, Heidelberg. Springer-Verlag.
  5. Bowers, K. D., Juels, A., and Oprea, A. (2009a). HAIL: a high-availability and integrity layer for cloud storage. In ACM Conference on Computer and Communications Security, pages 187-198.
  6. Bowers, K. D., Juels, A., and Oprea, A. (2009b). Proofs of retrievability: theory and implementation. In Proceedings of the 2009 ACM workshop on Cloud computing security, CCSW 7809, pages 43-54, New York, NY, USA. ACM. full version available from ePrint, report 2008/175; http://eprint.iacr.org.
  7. Cash, D., Küpc¸ ü, A., and Wichs, D. (2012). Dynamic proofs of retrievability via oblivious RAM. In IACR Cryptology ePrint Archive. Report 2012/550.
  8. Chen, B. and Curtmola, R. (2012). Robust dynamic provable data possession. In ICDCS Workshops, pages 515-525. IEEE Computer Society.
  9. Dodis, Y., Vadhan, S., and Wichs, D. (2009). Proofs of retrievability via hardness amplification. In Proceedings of the 6th Conference on Theory of CryptograErway, C., Küpc¸ ü, A., Papamanthou, C., and Tamassia, R. (2009). Dynamic provable data possession. In Proceedings of the 16th ACM conference on Computer and communications security, CCS 7809, pages 213- 222, New York, NY, USA. ACM.
  10. Gasarch, W. (2004). A survey on private information retrieval. Bulletin of the EATCS, 82:72-107.
  11. Halevi, S., Harnik, D., Pinkas, B., and Shulman-Peleg, A. (2011). Proofs of ownership in remote storage systems. In Proceedings of the 18th ACM conference on Computer and communications security, CCS 7811, pages 491-500, New York, NY, USA. ACM.
  12. Juels, A. and Kaliski, B. S. J. (2007). PORs: Proofs of Retrievability for Large Files. In ACM Conference on Computer and Communications Security, CCS 2007, pages 584-597. ACM.
  13. Lillibridge, M., Elnikety, S., Birrell, A., Burrows, M., and Isard, M. (2003). A cooperative internet backup scheme. In Proceedings of the USENIX Annual Technical Conference, ATEC 7803, pages 29-41, Berkeley, CA, USA. USENIX Association.
  14. Liu, S. and Chen, K. (2011). Homomorphic linear authentication schemes for proofs of retrievability. In Proceedings of the 2011 Third International Conference on Intelligent Networking and Collaborative Systems, INCOS 7811, pages 258-262, Washington, DC, USA. IEEE Computer Society.
  15. Menezes, A., van Oorschot, P. C., and Vanstone, S. (1997). Handbook of applied Cryptography. CRC Press LLC.
  16. Paterson, M. B., Stinson, D. R., and Upadhyay, J. (2012). A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage. CoRR, abs/1210.7756.
  17. Resch, J. K. and Plank, J. S. (2011). AONT-RS: blending security and performance in dispersed storage systems. In Proceedings of the 9th USENIX conference on File and storage technologies, FAST'11, pages 14- 14, Berkeley, CA, USA. USENIX Association.
  18. Shacham, H. and Waters, B. (2008). Compact Proofs of Retrievability. In Advances in Cryptology - ASIACRYPT 2008, volume 5350 of LNCS, pages 90-107. Springer.
  19. Stefanov, E., van Dijk, M., Juels, A., and Oprea, A. (2012). Iris: a scalable cloud file system with efficient integrity checks. In Proceedings of the 28th Annual Computer Security Applications Conference, ACSAC 7812, pages 229-238, New York, NY, USA. ACM.
  20. Wang, Q., Wang, C., Ren, K., Lou, W., and Li, J. (2011). Enabling public auditability and data dynamics for storage security in cloud computing. IEEE Transactions on Parallel and Distributed Systems, 22(5):847- 859.
  21. Xu, J. and Chang, E.-C. (2012). Towards efficient proofs of retrievability. In Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security, ASIACCS 7812, pages 79-80, New York, NY, USA. ACM.
  22. Zheng, Q. and Xu, S. (2011). Fair and dynamic proofs of retrievability. In Proceedings of the first ACM conference on Data and application security and privacy,
Download


Paper Citation


in Harvard Style

Rass S. (2013). Dynamic Proofs of Retrievability from Chameleon-Hashes . In Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013) ISBN 978-989-8565-73-0, pages 296-304. DOI: 10.5220/0004505102960304


in Bibtex Style

@conference{secrypt13,
author={Stefan Rass},
title={Dynamic Proofs of Retrievability from Chameleon-Hashes},
booktitle={Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)},
year={2013},
pages={296-304},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004505102960304},
isbn={978-989-8565-73-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)
TI - Dynamic Proofs of Retrievability from Chameleon-Hashes
SN - 978-989-8565-73-0
AU - Rass S.
PY - 2013
SP - 296
EP - 304
DO - 10.5220/0004505102960304