Multi-user dynamic proofs of data possession using trusted hardware

CODASPY 2013 - Proceedings of the 3rd ACM Conference on Data and Application Security and Privacy

Volumn , Issue , 2013, Pages 353-364

  Tate, Stephen R ^a   Vishwanathan, Roopa ^a   Everhart, Lance ^a  

^a UNIVERSITY OF NORTH CAROLINA AT GREENSBORO   (United States)

Author keywords

Cloud storage; Data outsourcing; Trusted hardware

Indexed keywords

CLOUD STORAGES; COMPUTATIONAL POWER; DATA AUTHENTICATION; DATA OUTSOURCING; PROVABLE DATA POSSESSIONS; STORAGE OUTSOURCINGS; TRUSTED COMPUTING TECHNOLOGY; TRUSTED HARDWARES;

AUTHENTICATION; COMPUTER PRIVACY; COSTS; DIGITAL STORAGE; HARDWARE; OUTSOURCING;

COMPUTER HARDWARE;

EID: 84874832699     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2435349.2435400     Document Type: Conference Paper

References (35)

1. 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.
2. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition resistant group signature scheme. In CRYPTO, pages 255-270, 2000.
3. G. Ateniese, R. D. Pietro, L. V. Mancini, and G. Tsudik. Scalable and efficient provable data possession. In SecureComm, 2008. Article 9.
4. K. D. Bowers, A. Juels, and A. Oprea. Hail: a high-availability and integrity layer for cloud storage. In ACM CCS, pages 187-198, 2009.
5. C. Cachin. Integrity and consistency for untrusted services. In SOFSEM, pages 1-14, 2011.
6. C. Cachin, I. Keidar, and A. Shraer. Fail-aware untrusted storage. In DSN, pages 494-503, 2009.
7. B.-G. Chun, P. Maniatis, S. Shenker, and J. Kubiatowicz. Attested append-only memory: making adversaries stick to their word. In SOSP, pages 189-204, 2007.
8. C. C. Erway, A. Küpçu ̈, C. Papamanthou, and R. Tamassia. Dynamic provable data possession. In ACM CCS, pages 213-222, 2009.
9. A. J. Feldman, W. P. Zeller, M. J. Freedman, and E. W. Felten. SPORC: Group collaboration using untrusted cloud resources. In OSDI, pages 337-350, 2010.
10. J. Feng, Y. Chen, D. Summerville, W.-S. Ku, and Z. Su. Enhancing cloud storage security against roll-back attacks with a new fair multi-party non-repudiation protocol. In Proc. IEEE Consumer Communications and Networking Conference (CCNC), pages 521-522, 2011.
11. M. T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia. Practical oblivious storage. In ACM CODASPY, pages 13-24, 2012.
12. V. Gunupudi and S. R. Tate. Timing-accurate TPM simulation for what-if explorations in trusted computing. In Proceedings of the International Symposium on Performance Evaluation of Computer and Telecommunicatoin Systems (SPECTS), pages 171-178, 2010.
13. A. Juels and B. S. Kaliski, Jr. PORs: Proofs of retrievability for large files. In ACM CCS, pages 584-597, 2007.
14. H. Kaplan. Persistent data structures. In Handbook on Data Structures and Applications. CRC Press, 2001.
15. D. Levin, J. R. Douceur, J. R. Lorch, and T. Moscibroda. TrInc: Small trusted hardware for large distributed systems. In NSDI, pages 1-14, 2009.
16. J. Li, M. N. Krohn, D. Mazières, and D. Shasha. Secure untrusted data repository (SUNDR). In OSDI, pages 121-136, 2004.
17. J. Li and D. Mazières. Beyond one-third faulty replicas in Byzantine fault tolerant systems. In NSDI, 2007.
18. P. Mahajan, S. T. V. Setty, S. Lee, A. Clement, L. Alvisi, M. Dahlin, and M. Walfish. Depot: Cloud storage with minimal trust. In OSDI, pages 307-322, 2010.
19. D. Mazieres and D. Shasha. Don't trust your file server. In Workshop on Hot Topics in Operating Systems, pages 113-118, 2001.
20. D. Mazières and D. Shasha. Building secure file systems out of Byzantine storage. In ACM PODC, pages 108-117, 2002.
21. J. M. McCune, Y. Li, N. Qu, Z. Zhou, A. Datta, V. D. Gligor, and A. Perrig. TrustVisor: Efficient TCB reduction and attestation. In IEEE Symposium on Security and Privacy, pages 143-158, 2010.
22. J. M. McCune, B. Parno, A. Perrig, M. K. Reiter, and H. Isozaki. Flicker: An execution infrastructure for TCB minimization. In EuroSys, pages 315-328, 2008.
23. R. C. Merkle. A digital signature based on a conventional encryption function. In CRYPTO, pages 369-378, 1987.
24. T. Moyer, K. Butler, J. Schiffman, P. McDaniel, and T. Jaeger. Scalable web content attestation. In ACSAC, pages 95-104, 2009.
25. L. F. G. Sarmenta, M. v. Dijk, C. W. O'Donnell, J. Rhodes, and S. Devadas. Virtual monotonic counters and count-limited objects using a TPM without a trusted OS. In Proceedings of the First ACM Workshop on Scalable Trusted Computing, pages 27-42, 2006.
26. H. Shacham and B. Waters. Compact proofs of retrievability. In ASIACRYPT, pages 90-107, 2008.
27. A. Shraer, C. Cachin, A. Cidon, I. Keidar, Y. Michalevsky, and D. Shaket. Venus: verification for untrusted cloud storage. In CCSW, pages 19-30, 2010.
28. E. Stefanov, M. van Dijk, A. Oprea, and A. Juels. Iris: A scalable cloud file system with efficient integrity checks. IACR Cryptology ePrint Archive, 2011, 2011.
29. S. R. Tate and R. Vishwanathan. Performance evaluation of TPM-based digital wallets. In International Symposium on Performance Evaluation of Computer and Telecommunication Systems, pages 179-186, 2010.
30. S. R. Tate, R. Vishwanathan, and L. Everhart. Multi-user dynamic proofs of data possession using trusted hardware - expanded version. Available at http://span.uncg.edu/pubs, 2012.
31. Trusted Computing Group. Trusted Platform Module Specifications - Parts 1-3. Available at https://www.trustedcomputinggroup.org/specs/TPM/.
32. M. van Dijk, J. Rhodes, L. F. G. Sarmenta, and S. Devadas. Offline untrusted storage with immediate detection of forking and replay attacks. In Workshop on Scalable Trusted Computing, pages 41-48, 2007.
33. M. van Dijk, L. Sarmenta, C. O'Donnell, and S. Devadas. Proof of freshness: How to efficiently use an online single secure clock to secure shared untrusted memory. Technical Report CSG Memo 496, MIT, 2006.
34. H. Xiong, X. Zhang, D. Yao, X. Wu, and Y. Wen. Towards end-to-end secure content storage and delivery with public cloud. In ACM CODASPY, pages 257-266, 2012.
35. Q. Zheng and S. Xu. Fair and dynamic proofs of retrievability. In ACM CODASPY, pages 237-248, 2011.