Transparent, distributed, and replicated dynamic provable data possession

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7954 LNCS, Issue , 2013, Pages 1-18

  Etemad, Mohammad ^a   Küpçü, Alptekin ^a  

^a KOÇ UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

BETTER PERFORMANCE; CLOUD STORAGES; DISTRIBUTED SCHEMES; INTERNAL STRUCTURE; OPTIMAL COMPLEXITY; ORDERS OF MAGNITUDE; PROVABLE DATA POSSESSIONS; VERSION CONTROL SYSTEM;

CRYPTOGRAPHY; NETWORK SECURITY;

DIGITAL STORAGE;

EID: 84879854325     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38980-1_1     Document Type: Conference Paper

References (27)

1. Anagnostopoulos, A., Goodrich, M., Tamassia, R.: Persistent authenticated dictionaries and their applications. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol. 2200, pp. 379-393. Springer, Heidelberg (2001) (Pubitemid 33354319)
2. Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., Song, D.: Provable data possession at untrusted stores. In: CCS 2007. ACM (2007)
3. Ateniese, G., Di Pietro, R., Mancini, L.V., Tsudik, G.: Scalable and efficient provable data possession. In: SecureComm 2008, pp. 9:1-9:10. ACM (2008)
4. Ateniese, G., Kamara, S., Katz, J.: Proofs of storage from homomorphic identification protocols. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 319-333. Springer, Heidelberg (2009)
5. Barsoum, A., Hasan, M.: Provable possession and replication of data over cloud servers. CACR, University of Waterloo 32 (2010)
6. Barsoum, A., Hasan, M.: Enabling data dynamic and indirect mutual trust for cloud computing storage systems (2011)
7. Barsoum, A., Hasan, M.: On verifying dynamic multiple data copies over cloud servers. Technical report, Cryptology ePrint Archive, Report 2011/447 (2011)
8. Blum, M., Evans, W., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. Algorithmica 12(2), 225-244 (1994)
9. Bowers, K., Juels, A., Oprea, A.: Hail: A high-availability and integrity layer for cloud storage. In: CCS 2009, pp. 187-198. ACM (2009)
10. Bowers, K.D., van Dijk, M., Juels, A., Oprea, A., Rivest, R.L.: How to tell if your cloud files are vulnerable to drive crashes. In: CCS 2011. ACM (2011)
11. Clarke, D., Devadas, S., van Dijk, M., Gassend, B., Suh, G.E.: Incremental multiset hash functions and their application to memory integrity checking. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 188-207. Springer, Heidelberg (2003)
12. Curtmola, R., Khan, O., Burns, R., Ateniese, G.: Mr-pdp: Multiple-replica provable data possession. In: ICDCS 2008, pp. 411-420. IEEE (2008)
13. Dodis, Y., Vadhan, S., Wichs, D.: Proofs of retrievability via hardness amplification. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 109-127. Springer, Heidelberg (2009)
14. Dwork, C., Naor, M., Rothblum, G.N., Vaikuntanathan, V.: How efficient can memory checking be? In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 503-520. Springer, Heidelberg (2009)
15. Erway, C., Küpçü, A., Papamanthou, C., Tamassia, R.: Dynamic provable data possession. In: CCS 2009, pp. 213-222. ACM (2009)
16. Etemad, M., Küpçü, A.: Transparent, distributed, and replicated dynamic provable data possession. Cryptology ePrint Archive, Report (2013)
17. Juels, A., Kaliski Jr., B.S.: Pors: proofs of retrievability for large files. In: CCS 2007, pp. 584-597. ACM, New York (2007)
18. Naor, M., Rotblum, G.: Complexity of online memory checking. In: FOCS (2005)
19. Sebé, F., Ferrer, J.D., Ballesté, A.M., Deswarte, Y., Quisquater, J.: Efficient remote data possession checking in critical information infrastructures. In: TKDE 2008 (2008)
20. Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 90-107. Springer, Heidelberg (2008)
21. Sink, E.: Version Control by Example, 1st edn. Pyrenean Gold Press (2011)
22. Wang, Q., Wang, C., Li, J., Ren, K., Lou, W.: Enabling public verifiability and data dynamics for storage security in cloud computing. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol. 5789, pp. 355-370. Springer, Heidelberg (2009)
23. Zeng, K.: Publicly verifiable remote data integrity. In: Chen, L., Ryan, M.D., Wang, G. (eds.) ICICS 2008. LNCS, vol. 5308, pp. 419-434. Springer, Heidelberg (2008)
24. Zhao, L., Ren, Y., Xiang, Y., Sakurai, K.: Fault-tolerant scheduling with dynamic number of replicas in heterogeneous systems. In: HPCC 2010, pp. 434-441 (2010)
25. Zheng, Q., Xu, S.: Fair and dynamic proofs of retrievability. In: Proc. of the First ACM Conf. on Data and App. Security and Privacy, pp. 237-248. ACM (2011)
26. Zhu, Y., Hu, H., Ahn, G.-J., Yu, M.: Cooperative provable data possession for integrity verification in multi-cloud storage. IEEE TPDS 99(PrePrints) (2012)
27. Zhu, Y., Wang, H., Hu, Z., Ahn, G.-J., Hu, H., Yau, S.S.: Efficient provable data possession for hybrid clouds. In: CCS 2010, pp. 756-758. ACM, New York (2010)