A dynamic Proof of Retrievability (PoR) scheme with O(logn) complexity

IEEE International Conference on Communications

Volumn , Issue , 2012, Pages 912-916

  Mo, Zhen ^a   Zhou, Yian ^a   Chen, Shigang ^a  

^a J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

B+-TREES; COMMUNICATION COMPLEXITY; DATA INTEGRITY; DATA LOSS; ITS DATA; MERKLE HASH TREE; PAY-AS-YOU-GO; PRE-PROCESSED DATA; SECURITY CHALLENGES; STORAGE MODEL; STRUCTURE-BASED;

DATA STRUCTURES; ELASTICITY; FORESTRY;

DIGITAL STORAGE;

DATA; ELASTICITY; FORESTRY; STORAGE; STRUCTURES;

EID: 84871950907     PISSN: 15503607     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2012.6364056     Document Type: Conference Paper

References (14)

1. Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou, "Enabling public verifiability and data dynamics for storage security in cloud computing," Computer Security-ESORICS 2009, pp. 355-370, 2009.
2. H. Shacham and B. Waters, "Compact proofs of retrievability," Advances in Cryptology-ASIACRYPT 2008, pp. 90-107, 2008.
3. G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, "Provable data possession at untrusted stores," in Proceedings of the 14th ACM conference on Computer and communications security. ACM, 2007, pp. 598-609.
4. A. Juels and B.S. Kaliski Jr, "Pors: Proofs of retrievability for large files," in Proceedings of the 14th ACM conference on Computer and communications security. ACM, 2007, pp. 584-597.
5. C. Erway, A. Küpçü, C. Papamanthou, and R. Tamassia, "Dynamic provable data possession," in Proceedings of the 16th ACM conference on Computer and communications security. ACM, 2009, pp. 213-222.
6. K.D. Bowers, A. Juels, and A. Oprea, "Proofs of retrievability: Theory and implementation," in Proceedings of the 2009 ACM workshop on Cloud computing security. ACM, 2009, pp. 43-54.
7. G. Ateniese, R. Di Pietro, L.V. Mancini, and G. Tsudik, "Scalable and efficient provable data possession," in Proceedings of the 4th international conference on Security and privacy in communication netowrks. ACM, 2008, p. 9.
8. D. Boneh, B. Lynn, and H. Shacham, "Short signatures from the weil pairing," Advances in CryptologylASIACRYPT 2001, pp. 514-532, 2001.
9. R. Merkle, "A digital signature based on a conventional encryption function," in Advances in Cryptology CRYPTO87. Springer, 2006, pp. 369-378.
10. D. Williams and E.G. Sirer, "Optimal parameter selection for efficient memory integrity verification using merkle hash trees," in Network Computing and Applications, 2004.(NCA 2004). Proceedings. Third IEEE International Symposium on. IEEE, 2004, pp. 383-388.
11. B. Gassend, G.E. Suh, D. Clarke, M. Van Dijk, and S. Devadas, "Caches and hash trees for efficient memory integrity verification," in High-Performance Computer Architecture, 2003. HPCA-9 2003. Proceedings. The Ninth International Symposium on. IEEE, 2003, pp. 295-306.
12. H. Kikuchi, K. Abe, and S. Nakanishi, "Online certification status verification with a red-black hash tree," IPSJ Digital Courier, vol. 2, no. 0, pp. 513-523, 2006.
13. M. Naor and K. Nissim, "Certificate revocation and certificate update," Selected Areas in Communications, IEEE Journal on, vol. 18, no. 4, pp. 561-570, 2000.
14. E. Horowitz and S. Sahni, Fundamentals of data structures, Computer science press, 1983.