A security protocol for self-organizing data storage

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 ℤn. The protocol also makes it possible to personalize replicas and to delegate verification without revealing any secret information. © 2008 Springer Science+Business Media, LLC.