Secure and constant cost public cloud storage auditing with deduplication

2013 IEEE Conference on Communications and Network Security, CNS 2013

Volumn , Issue , 2013, Pages 145-153

  Yuan, Jiawei ^a   Yu, Shucheng ^a  

^a University of Arkansas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; COMMUNICATION; COSTS; MANAGEMENT; NETWORK SECURITY; PROBLEM SOLVING;

AUTHENTICATION TAGS; COMMUNICATION COST; COMPUTATIONAL COSTS; COMPUTATIONAL DIFFIE-HELLMAN PROBLEMS; DIFFIE-HELLMAN PROBLEM; PROOF OF OWNERSHIP; PROOF OF RETRIEVABILITY; REAL-TIME COMMUNICATION;

DIGITAL STORAGE;

EID: 84893549172     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CNS.2013.6682702     Document Type: Conference Paper

References (24)

1. G. Timothy and M. M. Peter, "The nist definition of cloud computing," vol. NIST SP - 800-145, September 2011.
2. "Amazon forum. major outage for amazon s3 and ec2," https://forums.aws.amazon.com/thread.jspa?threadID=19714&start= 15&tstart=0.
3. "Business insider. amazon's cloud crash disaster permanently destroyed many customers' data," http://www.businessinsider.com/amazon- lost-data-2011-4.
4. J. Gantz and D. Reinsel, "The digital universe decade - are you ready?" http://www.emc.com/collateral/analyst-reports/idc-digital-universe- are-you-ready.pdf, May 2010.
5. J. Yuan and S. Yu, "Proofs of retrievability with public verifiability and constant communication cost in cloud," Proceedings of the ACM ASIACCS-SCC'13, 2013.
6. H. Shacham and B. Waters, "Compact proofs of retrievability," in Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security, ser. ASIACRYPT '08, Berlin, Heidelberg, May 2008, pp. 90-107.
7. 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, ser. CCS '07. New York, NY, USA: ACM, 2007, pp. 584-597.
8. Y. Dodis, S. Vadhan, and D. Wichs, "Proofs of retrievability via hardness amplification," in Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography, ser. TCC '09, Berlin, Heidelberg, 2009, pp. 109-127.
9. 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, ser. CCS '07. New York, NY, USA: ACM, 2007, pp. 598-609.
10. 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, ser. SecureComm '08. New York, NY, USA: ACM, 2008.
11. 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, ser. CCS '09. New York, NY, USA: ACM, 2009, pp. 213-222.
12. Q. Wang, C. Wang, K. Ren, W. Lou, and J. Li, "Enabling public auditability and data dynamics for storage security in cloud computing," IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 5, pp. 847-859, 2011.
13. S. Halevi, D. Harnik, B. Pinkas, and A. Shulman-Peleg, "Proofs of ownership in remote storage systems," in Proceedings of the 18th ACM conference on Computer and communications security, ser. CCS '11. New York, NY, USA: ACM, 2011, pp. 491-500.
14. R. Di Pietro and A. Sorniotti, "Boosting efficiency and security in proof of ownership for deduplication," in Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security, ser. ASIACCS '12. New York, NY, USA: ACM, 2012, pp. 81-82.
15. Q. Zheng and S. Xu, "Secure and efficient proof of storage with deduplication," in Proceedings of the second ACM conference on Data and Application Security and Privacy, ser. CODASPY '12. New York, NY, USA: ACM, 2012, pp. 1-12.
16. K. K. Youngjoo Shin, Junbeom Hur, "Security weakness in the proof of storage with deduplication," Cryptology ePrint Archive, Report 2012/554, 2012, http://eprint.iacr.org/.
17. D. Boneh and X. Boyen, "Short signatures without random oracles," in EUROCRYPT, 2004, pp. 56-73.
18. I. S. Reed and G. Solomon, "Polynomial Codes Over Certain Finite Fields," Journal of the Society for Industrial and Applied Mathematics, vol. 8, no. 2, pp. 300-304, 1960.
19. X. Jia and C. Ee-Chien, "Towards efficient provable data possession," in Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security, ser. ASIACCS '12, Seoul, Korea, 2012.
20. W. Diffie and M. Hellman, "New directions in cryptography," IEEE Trans. Inf. Theor., vol. 22, no. 6, pp. 644-654, Sep. 1976.
21. D. R. L. Brown and R. P. Gallant, "The static diffie-hellman problem," Cryptology ePrint Archive, Report 2004/306, 2004, http://eprint.iacr.org/.
22. A. Kate, G. M. Zaverucha, and I. Goldberg, "Constant-size commitments to polynomials and their applications," in ASIACRYPT, 2010, pp. 177-194.
23. V. Shoup, A computational introduction to number theory and algebra. New York, NY, USA: Cambridge University Press, 2005.
24. jPBC, "http://gas.dia.unisa.it/projects/jpbc/."