Transparent, Distributed, and Replicated Dynamic Provable Data Possession

@article{Etemad2013TransparentDA,
  title={Transparent, Distributed, and Replicated Dynamic Provable Data Possession},
  author={Mohammad Etemad and Alptekin K{\"u}pç{\"u}},
  journal={IACR Cryptology ePrint Archive},
  year={2013},
  volume={2013},
  pages={225}
}
With the growing trend toward using outsourced storage, the problem of efficiently checking and proving data integrity needs more consideration. Starting with PDP and POR schemes in 2007, many cryptography and security researchers have addressed the problem. After the first solutions for static data, dynamic versions were developed (e.g., DPDP). Researchers also considered distributed versions of such schemes. Alas, in all such distributed schemes, the client needs to be aware of the structure… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 42 references

Provable data possession at untrusted stores

ACM Conference on Computer and Communications Security • 2007
View 7 Excerpts
Highly Influenced

How to tell if your cloud files are vulnerable to drive crashes

ACM Conference on Computer and Communications Security • 2010
View 3 Excerpts
Highly Influenced

Version Control by Example

E. Sink
Pyrenean Gold Press, 1st edition, • 2011
View 1 Excerpt

Efficient provable data possession for hybrid clouds

ACM Conference on Computer and Communications Security • 2010
View 2 Excerpts

Similar Papers

Loading similar papers…