Entangled cloud storage

Future Generation Computer Systems

Volumn 62, Issue , 2016, Pages 104-118

  Ateniese, Giuseppe ^a   Dagdelen, Özgür ^b   Damgård, Ivan ^c   Venturi, Daniele ^d  

^a Stevens Institute of Technology   (United States)

^b BRIDGINGIT GMBH   (Germany)

^c AARHUS UNIVERSITY   (Denmark)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Cloud storage; Data entanglement; Simulation based security; Universal composability

Indexed keywords

DATA PRIVACY; ENCODING (SYMBOLS);

CLOUD STORAGES; DATA ENTANGLEMENT; POLYNOMIAL INTERPOLATION; PROOF OF RETRIEVABILITY; PROVABLE DATA POSSESSIONS; SECURITY DEFINITIONS; SIMULATION-BASED SECURITY; UNIVERSAL COMPOSABILITY;

DIGITAL STORAGE;

EID: 84957684104     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2016.01.008     Document Type: Article

References (42)

1. [1] G. Ateniese, R.C. Burns, R. Curtmola, J. Herring, L. Kissner, Z.N.J. Peterson, D.X. Song, Provable data possession at untrusted stores, in: ACM CCS, 2007, pp. 598–609.
2. [2] A. Juels, B.S.K. Jr, PoRs: proofs of retrievability for large files, in: ACM CCS, 2007, pp. 584–597.
3. [3] M. Naor, G.N. Rothblum, The complexity of online memory checking, in: FOCS, 2005, pp. 573–584.
4. [4] H. Shacham, B. Waters, Compact proofs of retrievability, in: ASIACRYPT, 2008, pp. 90–107.
5. [5] G. Ateniese, R.D. Pietro, L.V. Mancini, G. Tsudik, Scalable and efficient provable data possession, in: Proceedings of the 4th International Conference on Security and Privacy in Communication Netowrks, SecureComm’08, 2008, pp. 9:1–9:10.
6. [6] Y. Dodis, S.P. Vadhan, D. Wichs, Proofs of retrievability via hardness amplification, in: TCC, 2009, pp. 109–127.
7. [7] G. Ateniese, S. Kamara, J. Katz, Proofs of storage from homomorphic identification protocols, in: ASIACRYPT, 2009, pp. 319–333.
8. [8] J. Xu, E. Chang, Towards efficient proofs of retrievability, in: ASIACCS, 2012, pp. 79–80.
9. [9] D. Cash, A. Küpçü, D. Wichs, Dynamic proofs of retrievability via oblivious RAM, in: EUROCRYPT, 2013, pp. 279–295.
10. [10] E. Shi, E. Stefanov, C. Papamanthou, Practical dynamic proofs of retrievability, in: ACM CCS, 2013, pp. 325–336.
11. [11] Erway, C.C., Küpçü, A., Papamanthou, C., Tamassia, R., Dynamic provable data possession. ACM Trans. Inf. Syst. Secur., 17(4), 2015, 15.
12. [12] Aspnes, J., Feigenbaum, J., Yampolskiy, A., Zhong, S., Towards a theory of data entanglement. Theoret. Comput. Sci. 389:1–2 (2007), 26–43.
13. [13] R. Canetti, Universally composable security: A new paradigm for cryptographic protocols, in: FOCS, 2001, pp. 136–145.
14. [14] Yang, K., Jia, X., Data storage auditing service in cloud computing: challenges, methods and opportunities. World Wide Web 15:4 (2012), 409–428.
15. [15] Shin, S., Kwon, T., Remote data checking using provable data possession. J. Internet Serv. Inform. Secur. 5:3 (2015), 37–47.
16. [16] Barsoum, A., Provable data possession in single cloud server: A survey, classification and comparative study. Int. J. Comput. Appl. 9:123 (2015), 1–10.
17. [17] Stubblefield, A., Wallach, D., Dagster: Censorship-resistant Publishing Without Replication, Tech. Rep. TR01-380., 2001, Rice University.
18. [18] M. Waldman, D. Mazières, Tangler: A censorship-resistant publishing system based on document entanglements, in: ACM CCS, 2001, pp. 126–135.
19. [19] R.L. Rivest, All-or-nothing encryption and the package transform, in: FSE, 1997, pp. 210–218.
20. [20] F. Davì, S. Dziembowski, D. Venturi, Leakage-resilient storage, in: SCN, 2010, pp. 121–137.
21. [21] G. Ateniese, Ö. Dagdelen, I. Damgård, D. Venturi, Entangled encodings and data entanglement, in: Proceedings of the Third International Workshop on Security in Cloud Computing, SCC@ASIACCS, 2015, pp. 3–12.
22. [22] H. Wee, On round-efficient argument systems, in: ICALP, 2005, pp. 140–152.
23. [23] N. Bitansky, R. Canetti, A. Chiesa, E. Tromer, From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again, in: ITCS, 2012, pp. 326–349.
24. [24] J. Kilian, A note on efficient zero-knowledge proofs and arguments (extended abstract), in: STOC, 1992, pp. 723–732.
25. [25] C. Gentry, D. Wichs, Separating succinct non-interactive arguments from all falsifiable assumptions, in: STOC, 2011, pp. 99–108.
26. [26] Micali, S., Computationally sound proofs. SIAM J. Comput. 30:4 (2000), 1253–1298.
27. [27] C. Gentry, Fully homomorphic encryption using ideal lattices, in: STOC, 2009, pp. 169–178.
28. [28] Z. Brakerski, V. Vaikuntanathan, Efficient fully homomorphic encryption from (standard) LWE, in: FOCS, 2011, pp. 97–106.
29. [29] Brakerski, Z., Gentry, C., Vaikuntanathan, V., (Leveled) Fully homomorphic encryption without bootstrapping. TOCT 6:3 (2014), 13:1–13:36.
30. [30] E. Stefanov, M. van Dijk, A. Juels, A. Oprea, Iris: a scalable cloud file system with efficient integrity checks, in: ACSAC, 2012, pp. 229–238.
31. [31] Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M., Private information retrieval. J. ACM 45:6 (1998), 965–981.
32. [32] P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, in: EUROCRYPT, 1999, pp. 223–238.
33. [33] P.-A. Fouque, D. Pointcheval, Threshold cryptosystems secure against chosen-ciphertext attacks, in: ASIACRYPT, 2001, pp. 351–368.
34. [34] Shamir, A., How to share a secret. Commun. ACM 22:11 (1979), 612–613.
35. [35] Gennaro, R., Rabin, M.O., Rabin, T., PODC, 1998, 101–111.
36. [36] J. Bar-Ilan, D. Beaver, Non-cryptographic fault-tolerant computing in constant number of rounds of interaction, in: PODC, 1989, pp. 201–209.
37. [37] Mohassel, P., Franklin, M.K., Efficient polynomial operations in the shared-coefficients setting. Public Key Cryptography, 2006, 44–57.
38. [38] R. Cramer, I. Damgård, Secure distributed linear algebra in a constant number of rounds, in: CRYPTO, 2001, pp. 119–136.
39. [39] R. Cramer, E. Kiltz, C. Padró, A note on secure computation of the Moore-Penrose pseudoinverse and its application to secure linear algebra, in: CRYPTO, 2007, pp. 613–630.
40. [40] Ö Dagdelen, D. Venturi, A multi-party protocol for privacy-preserving cooperative linear systems of equations, in: BalkanCryptSec, 2014, pp. 161–172.
41. [41] Hazay, C., Lindell, Y., Efficient oblivious polynomial evaluation with simulation-based security. IACR Crypt. ePrint Archive, 2009, 2009, 459.
42. [42] Dagdelen, Ö, Mohassel, P., Venturi, D., Rate-limited secure function evaluation: Definitions and constructions. Public Key Cryptography, 2013, 461–478.