A Security Protocol for Self-Organizing Data Storage

  • Nouha Oualha
  • Melek Önen
  • Yves Roudier
Part of the IFIP – The International Federation for Information Processing book series (IFIPAICT, volume 278)

Abstract

This paper describes a cryptographic protocol for securing self-organized data storage through periodic verifications. The proposed verification protocol, which goes beyond simple integrity checks and proves data conservation, is deterministic, efficient, and scalable. The security of this scheme relies both on the ECDLP intractability assumption and on the difficulty of finding the order of some specific elliptic curve over Zn. The protocol also makes it possible to personalize replicas and to delegate verification without revealing any secret information.

References

  1. 1.
    Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., Song, D.: Provable data possession at untrusted stores. In: CCS ’07: Proceedings of the 14th ACM conference on Computer and communications security, pp. 598–609. ACM, New York, NY, USA (2007)CrossRefGoogle Scholar
  2. 2.
    Deswarte, Y., Quisquater, J.J., Saidane, A.: Remote integrity checking. In: Conference on Integrity and Internal Control in Information Systems ’03 (2003)Google Scholar
  3. 3.
    Filho, D.L.G., Barreto, P.S.L.M.: Demonstrating data possession and uncheatable data transfer. Cryptology ePrint Archive, Report 2006/150 (2006). http://eprint.iacr.org/Google Scholar
  4. 4.
    Golle, P., Jarecki, S., Mironov, I.: Cryptographic primitives enforcing communication and storage complexity. In: Financial Crypto (2002)Google Scholar
  5. 5.
    Juels, A., Burton S. Kaliski, J.: PORs: proofs of retrievability for large files. In: CCS ’07: Proceedings of the 14th ACM conference on Computer and communications security, pp. 584–597. ACM, New York, NY, USA (2007)CrossRefGoogle Scholar
  6. 6.
    Koyama, K., Maurer, U., Okamoto, T., Vanstone, S.: New public key schemes based on elliptic curves over the ring zn. In: LNCS (ed.) Advances in Cryptology - CRYPTO’91, vol. 576, pp. 252–266 (1991)Google Scholar
  7. 7.
    Lillibridge, M., Elnikety, S., Birrel, A., Burrows, M., Isard, M.: a cooperative Internet Backup Scheme. In: Usenix Annual Technical Conference (General Track), pp. 29-41 (2003)Google Scholar
  8. 8.
    Oualha, N., Önen, M., Roudier, Y.: A Security Protocol for Self-Organizing Data Storage. Tech. Rep. EURECOM+2399, Institut Eurecom, France (2008)Google Scholar
  9. 9.
    Oualha, N., Roudier, Y.: A game theoretic model of a protocol for data possession verification. In: IEEE International Workshop on Trust, Security, and Privacy for Ubiquitous Computing (TSPUC’07). Helsinki, Finland (2007)Google Scholar
  10. 10.
    Oualha, N., Roudier, Y.: Securing ad hoc storage through probabilistic cooperation assessment. In: 3rdWorkshop on Cryptography for Ad hoc Networks (WCAN’07). Wroclaw, Poland (2007)Google Scholar
  11. 11.
    Schwarz, T.S.J., Miller, E.L.: Store, forget, and check: Using algebraic signatures to check remotely administered storage. In: ICDCS ’06: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems, p. 12. IEEE Computer Society, Washington, DC, USA (2006)Google Scholar
  12. 12.
    Sebe, F., Domingo-Ferrer, J., Martnez-Ballest, A., Deswarte, Y., Quisquater, J.J.: Efficient remote data possession checking in critical information infrastructures. In: IEEE Transactions on Knowledge and Data Engineering. IEEE Computer Society Digital Library (2007)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • Nouha Oualha
    • 1
  • Melek Önen
    • 1
  • Yves Roudier
    • 1
  1. 1.EURECOMFrance

Personalised recommendations