Public Integrity Auditing for Shared Dynamic Cloud Data with Group User Revocation

IEEE Transactions on Computers

Volumn 65, Issue 8, 2016, Pages 2363-2373

  Jiang, Tao ^a   Chen, Xiaofeng ^a   Ma, Jianfeng ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

cloud computing; dynamic data; group signature; Public integrity auditing; victor commitment

Indexed keywords

CLOUD COMPUTING; NETWORK SECURITY;

CLOUD STORAGE SYSTEMS; DYNAMIC DATA; EXPERIMENTAL ANALYSIS; GROUP SIGNATURES; PUBLIC INTEGRITY AUDITING; STORAGE OUTSOURCINGS; VERIFIER-LOCAL REVOCATIONS; VICTOR COMMITMENT;

DIGITAL STORAGE;

EID: 84978654857     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2015.2389955     Document Type: Article

References (47)

1. Amazon. (2007). Amazon simple storage service (amazon s3). Amazon [Online]. Available: http://aws.amazon.com/s3/
2. Google. (2005). Google drive. Google [Online]. Available: http://drive.google.com/
3. Dropbox. (2007). A file-storage and sharing service. Dropbox [Online]. Available: http://www.dropbox.com/
4. Mozy. (2007). An online, data, and computer backup software. EMC [Online]. Available: http://www.dropbox.com/
5. Bitcasa. (2011). Inifinite storage. Bitcasa [Online]. Available: http://www.bitcasa.com/
6. Memopal. (2007). Online backup. Memopal [Online]. Available: http://www.memopal.com/
7. M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. H. Katz, A. Konwinski, G. Lee, D. A. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, "Above the clouds: A berkeley view of cloud computing," University of California at Berkeley, Berkeley, CA, USA, Tech. Rep. UCBEECS-2009-28, pp. 1-23, Feb. 2009.
8. M. Rabin, "Efficient dispersal of information for security," J. ACM, vol. 36, no. 2, pp. 335-348, Apr. 1989.
9. J. G. et al. (2006). The expanding digital universe: A forecast of worldwide information growth through 2010. IDC. [Online]. Available: Whitepaper
10. G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, "Provable data possession at untrusted stores," in Proc. 14th ACM Conf. Comput. Commun. Secur., Oct. 2007, pp. 598-609.
11. A. Juels and B. S. Kaliski, "PORS: Proofs of retrievability for large files," in Proc. 14th ACM Conf. Comput. Commun. Secur., Oct. 2007, pp. 584-597.
12. K. D. Bowers, A. Juels, and A. Oprea, "Proofs of retrievability: Theory and implementation," in Proc. ACM Workshop Cloud Comput. Secur., Nov. 2009, pp. 43-54.
13. Y. Dodis, S. Vadhan, and D. Wichs, "Proofs of retrievability via hardness amplification," in Proc. 6th Theory Cryptography Conf. Theory Cryptography, Mar. 2009, pp. 109-127.
14. Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou, "Proofs of retrievability via hardness amplification," in Proc. Eur. Symp. Res. Comput. Secur., Sep. 2009, pp. 355-370.
15. C. Erway, A. Kupcu, C. Papamanthou, and R. Tamassia, "Dynamic provable data possession," in Proc. 16th ACM Conf. Comput. Comm. Secur., Nov. 2009, pp. 213-222.
16. C. Wang, Q. Wang, K. Ren, and W. Lou, "Privacy-preserving public auditing for data storage security in cloud computing," in Proc. IEEE 29th Conf. Inform. Commun., Mar. 2010, pp. 525-533.
17. J. Yuan and S. Yu, "Proofs of retrievability with public verifiability and constant communication cost in cloud," in Proc. Int. Workshop Secur. Cloud Comput., May 2013, pp. 19-26.
18. E. Shi, E. Stefanov, and C. Papamanthou, "Practical dynamic proofs of retrievability," in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., Nov. 2013, pp. 325-336.
19. Cloud9. (2011). Your development environment, in the cloud. Cloud9 [Online]. Available: https://c9.io/
20. Codeanywhere. (2011). Online code editor. Codeanywhere [Online]. Available: https://codeanywhere.net/
21. eXo Cloud IDE. (2002). Online code editor. Cloud IDE [Online]. Available: https://codenvy.com/
22. B. Wang, B. Li, and H. Li, "Oruta: Privacy-preserving public auditing for shared data in the cloud," in Proc. IEEE 5th Int. Conf. Cloud Comput., Jun. 2012, pp. 295-302.
23. B. Wang, L. Baochun, and L. Hui, "Public auditing for shared data with efficient user revocation in the cloud," in Proc. IEEE INFOCOM, Apr. 2013, pp. 2904-2912.
24. J. Yuan and S. Yu, "Efficient public integrity checking for cloud data sharing with multi-user modification," in Proc. IEEE INFOCOM, Apr. 2014, pp. 2121-2129.
25. D. Catalano and D. Fiore, "Vector commitments and their applications," in Proc. Public-Key Cryptography, Mar. 2013, pp. 55-72.
26. Q. Wu, Y. Mu, W. Susilo, B. Qin, and J. Domingo-Ferrer, "Asymmetric group key agreement," in Proc. 28th Annu. Int. Conf. Theory Appl. Cryptographic Techn., Apr. 2009, pp. 153-170.
27. D. Boneh and H. Shacham, "Group signatures with verifier-local revocation," in Proc. 11th ACM Conf. Comput. Commun. Secur., Oct. 2004, pp. 168-177.
28. D. Boneh, B. Lynn, and H. Shacham, "Short signatures from the Weil pairing," in Proc. 7th Int. Conf. Theory Appl Cryptol. Inform. Secur.: Adv. Cryptol., Dec. 2001, pp. 514-532.
29. D. Boneh and X. Boyen, "Collision-free accumulators and fail-stop signature schemes without trees," in Proc. EUROCRYPT, May 2004, pp. 56-73.
30. N. Baric and B. Pfitzman, "Collision-free accumulators and failstop signature schemes without trees," in Proc. 16th Annu. Int. Conf. Theory Appl. Cryptographic Techn., May 1997, pp. 480-494.
31. D. Boneh, X. Boyen, and H. Shacham, "Short group signatures," in Proc. CRYPTO, Aug. 2004, pp. 41-55.
32. U. M. Maurer and S. Wolf, "Diffie-Hellman oracles," in Proc. CRYPTO, Aug. 1996, pp. 268-282.
33. F. Bao, R. Deng, and H. Zhu, "Variations of Diffie-Hellman proble," in Proc. Inform. Commun. Secur., Huhehaote, Oct. 2003, pp. 301-312.
34. X. Chen, J. Li, J. Weng, J. Ma, and W. Lou, "Verifiable computation over large database with incremental updates," in Proc. Eur. Symp. Res. Comput. Secur., Sep. 2014, pp. 148-162.
35. X. Chen, J. Li, X. Huang, J. Ma, and W. Lou, "New publicly verifiable databases with efficient updates," IEEE Trans. Depend. Secure Comput., 2014, doi: 10.1109/TDSC.2014.2366471.
36. B. Lynn. (2006). The pairing-based cryptography library [Online]. Available: http://crypto.stanford.edu/pbc/
37. R. Gennaro, C. Gentry, and B. Parno, "Non-interactive verifiable computing: Outsourcing computation to untrusted workers," in Proc. 30th Annu. Conf. Adv. Cryptol., Sep. 2010, pp. 465-482.
38. C. Gentry, "Fully homomorphic encryption using ideal lattices," in Proc. 41st Annu. ACM Symp. Theory Comput., May 2009, pp. 169-178.
39. C. Gentry and S. Halevi, "Implementing gentrys fully-homomorphic encryption scheme," in Proc. 30th Annu. Int. Conf. Theory Appl. Cryptographic Techn.: Adv. Cryptol., May 2011, pp. 129-148.
40. S. Benabbas, R. Gennaro, and Y. Vahlis, "Verifiable delegation of computation over large data sets," in Proc. 31st Annu. Conf. Adv. Cryptol., Aug. 2011, pp. 111-131.
41. M. Backes, D. Fiore, and R. M. Reischuk, "Verifiable delegation of computation on outsourced data," in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., Nov. 2013, pp. 863-874.
42. D. Chaum and E. van Heyst, "Group signatures," in Proc. EUROCRYPT, Apr. 1991, pp. 257-265.
43. E. Bresson and J. Stern, "Efficient revocation in group signatures," in Proc. Public-Key Cryptography, Feb. 2001, pp. 190-206.
44. J. Camenisch and A. Lysyanskaya, "Dynamic accumulators and application to efficient revocation of anonymous credentials," in Proc. 22nd Annu. Int. Cryptol. Conf. Adv. Cryptol., Aug. 2002, pp. 61-76.
45. G. Ateniese, D. Song, and G. Tsudik, "Quasi-efficient revocation in group signatures," in Proc. 6th Int. Conf. Financial Cryptography, Mar. 2002, pp. 183-197.
46. B. Libert, T. Peters, and M. Yung, "Scalable group signatures with revocation," in Proc. Annu. Int. Conf. Theory Appl. Cryptographic Techn., Aug. 2002, pp. 61-76.
47. B. Libert, T. Peters, and M. Yung, "Group signatures with almostfor-free revocation," in Proc. Annu. Int. Cryptol. Conf. Adv. Cryptol., Aug. 2012, pp. 571-589.