Entangled encodings and data entanglement

SCC 2015 - Proceedings of the 3rd ACM International Workshop on Security in Cloud Computing, part of ASIACCS 2015

Volumn , Issue , 2015, Pages 3-12

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

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b BRIDGINGIT GMBH   (Germany)

^c AARHUS UNIVERSITY   (Denmark)

Author keywords

Cloud storage; Data entanglement; Secure computation

Indexed keywords

CLOUD COMPUTING; CRYPTOGRAPHY; DIGITAL STORAGE;

CLOUD PROVIDERS; CLOUD STORAGES; DATA ENTANGLEMENT; ENCODING SCHEMES; POLYNOMIAL INTERPOLATION; SECURE CLOUD STORAGES; SECURE COMPUTATION; UNCONDITIONAL SECURITY;

ENCODING (SYMBOLS);

EID: 84959310213     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2732516.2732524     Document Type: Conference Paper

References (32)

1. J. Aspnes, J. Feigenbaum, A. Yampolskiy, and S. Zhong. Towards a theory of data entanglement. Theor. Comput. Sci., 389(1-2):26-43, 2007.
2. G. Ateniese, R. C. Burns, R. Curtmola, J. Herring, L. Kissner, Z. N. J. Peterson, and D. X. Song. Provable data possession at untrusted stores. In ACM CCS, pages 598-609, 2007.
3. G. Ateniese, O. Dagdelen, I. Damgård, and D. Venturi. Entangled cloud storage. Cryptology ePrint Archive, Report 2012/511, 2012. http://eprint.iacr.org/.
4. G. Ateniese, S. Kamara, and J. Katz. Proofs of storage from homomorphic identification protocols. In ASIACRYPT, pages 319-333, 2009.
5. G. Ateniese, R. D. 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, SecureComm'08, pages 9:1-9:10, 2008.
6. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In PODC, pages 201-209, 1989.
7. Z. Brakerski, C. Gentry, and V. Vaikuntanathan. (Leveled) Fully Homomorphic Encryption without Bootstrapping. In ITCS, page to appear, 2012.
8. Z. Brakerski and V. Vaikuntanathan. Efficient fully homomorphic encryption from (standard) LWE. In FOCS, pages 97-106, 2011.
9. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS, pages 136-145, 2001.
10. R. Canetti, Y. Dodis, S. Halevi, E. Kushilevitz, and A. Sahai. Exposure-resilient functions and all-or-nothing transforms. In EUROCRYPT, pages 453-469, 2000.
11. Ö. Dagdelen, P. Mohassel, and D. Venturi. Rate-limited secure function evaluation: Definitions and constructions. In PKC, pages 461-478, 2013.
12. Ö. Dagdelen and D. Venturi. A multi-party protocol for privacy-preserving cooperative linear systems of equations. In BalkancryptSec, 2014. To appear.
13. F. Davì, S. Dziembowski, and D. Venturi. Leakage-resilient storage. In SCN, pages 121-137, 2010.
14. Y. Dodis, S. P. Vadhan, and D. Wichs. Proofs of retrievability via hardness amplification. In TCC, pages 109-127, 2009.
15. P.-A. Fouque and D. Pointcheval. Threshold cryptosystems secure against chosen-ciphertext attacks. In ASIACRYPT, pages 351-368, 2001.
16. R. Gennaro, M. O. Rabin, and T. Rabin. Simplified VSS and fact-track multiparty computations with applications to threshold cryptography. In PODC, pages 101-111, 1998.
17. C. Gentry. Fully homomorphic encryption using ideal lattices. In STOC, pages 169-178, 2009.
18. O. Goldreich. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press, New York, NY, USA, 2004.
19. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In STOC, pages 218-229, 1987.
20. C. Hazay. Oblivious polynomial evaluation and secure set-intersection from algebraic prfs. IACR Cryptology ePrint Archive, 2015:4, 2015.
21. C. Hazay and Y. Lindell. Efficient oblivious polynomial evaluation with simulation-based security. IACR Cryptology ePrint Archive, 2009:459, 2009.
22. A. Juels and B. S. K. Jr. PoRs: proofs of retrievability for large files. In ACM CCS, pages 584-597, 2007.
23. P. Mohassel and M. K. Franklin. Efficient polynomial operations in the shared-coefficients setting. In PKC, pages 44-57, 2006.
24. M. Naor and G. N. Rothblum. The complexity of online memory checking. In FOCS, pages 573-584, 2005.
25. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In EUROCRYPT, pages 223-238, 1999.
26. R. L. Rivest. All-or-nothing encryption and the package transform. In FSE, pages 210-218, 1997.
27. H. Shacham and B. Waters. Compact proofs of retrievability. In ASIACRYPT, pages 90-107, 2008.
28. A. Shamir. How to share a secret. Commun. ACM, 22(11):612-613, 1979.
29. E. Stefanov, M. van Dijk, A. Juels, and A. Oprea. Iris: a scalable cloud file system with efficient integrity checks. In ACSAC, pages 229-238, 2012.
30. A. Stubblefield and D. Wallach. Dagster: Censorship-resistant publishing without replication. Technical Report TR01-380, Rice University, 2001.
31. M. Waldman and D. Mazières. Tangler: A censorship-resistant publishing system based on document entanglements. In ACM CCS, pages 126-135, 2001.
32. A. C.-C. Yao. How to generate and exchange secrets (extended abstract). In FOCS, pages 162-167, 1986.