Fair and dynamic proofs of retrievability

CODASPY'11 - Proceedings of the 1st ACM Conference on Data and Application Security and Privacy

Volumn , Issue , 2011, Pages 237-248

  Zheng, Qingji ^a   Xu, Shouhuai ^a  

^a University of Texas at San Antonio   (United States)

Author keywords

2 3 tree; Authenticated data structures; Cloud computing; Cloud security; Cloud storage; Integrity checking; Outsourced storage; Proof of retrievability; Ranged based 2 3 tree; Verifiable data integrity

Indexed keywords

2-3 TREE; AUTHENTICATED DATA STRUCTURES; DATA INTEGRITY; INTEGRITY CHECKING; OUTSOURCED STORAGE; PROOF OF RETRIEVABILITY; RANGED-BASED 2-3 TREE;

CLOUD COMPUTING; COMPUTER SYSTEMS; DATA PRIVACY; DATA STRUCTURES; SERVERS;

TREES (MATHEMATICS);

EID: 79952791500     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1943513.1943546     Document Type: Conference Paper

References (20)

1. J. D. U. Alfred, V.Aho, John E. Hopcroft. The Design and Analysis of Computer Algorithms. Addison Wesley, 1974.
2. G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song. Provable data possession at untrusted stores. In CCS'07: Proceedings of the 14th ACM conference on Computer and communications security, pages 598-609, 2007.
3. G. Ateniese, R. Di Pietro, L. V. Mancini, and G. Tsudik. Scalable and efficient provable data possession. In SecureComm'08: Proceedings of the 4th international conference on Security and privacy in communication netowrks, pages 1-10, 2008.
4. M. Bellare and O. Goldreich. On defining proofs of knowledge. In CRYPTO, pages 390-420, 1992.
5. M. Bellare, O. Goldreich, and S. Goldwasser. Incremental cryptography: The case of hashing and signing. In CRYPTO'94: Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, pages 216-233, 1994.
6. M. Bellare, O. Goldreich, and S. Goldwasser. Incremental cryptography and application to virus protection. In STOC'95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, pages 45-56, 1995.
7. M. Bellare and D. Micciancio. A new paradigm for collision-free hashing: incrementality at reduced cost. In EUROCRYPT'97: Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques, pages 163-192, 1997. (Pubitemid 127067801)
8. K. D. Bowers, A. Juels, and A. Oprea. Hail: a high-availability and integrity layer for cloud storage. In ACM Conference on Computer and Communications Security, pages 187-198, 2009.
9. K. D. Bowers, A. Juels, and A. Oprea. Proofs of retrievability: theory and implementation. In CCSW'09: Proceedings of the 2009 ACM workshop on Cloud computing security, pages 43-54, 2009.
10. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics, 23(4):493-507, 1952.
11. Y. Dodis, S. Vadhan, and D. Wichs. Proofs of retrievability via hardness amplification. In TCC'09: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography, pages109-127, 2009.
12. C. Dwork, M. Naor, G. N. Rothblum, and V. Vaikuntanathan. How efficient can memory checking be? In Theory of Cryptography (TCC'09), pages 503-520, 2009.
13. C. Erway, A. Küpçü, C. Papamanthou, and R. Tamassia. Dynamic provable data possession. In CCS'09: Proceedings of the 16th ACM conference on Computer and communications security, pages 213-222, 2009.
14. O. Goldreich. The Foundations of Cryptography, volume 1. Cambridge University Press, 2001.
15. A. Juels and B. S. Kaliski, Jr. Pors: proofs of retrievability for large files. In CCS'07: Proceedings of the 14th ACM conference on Computer and communications security, pages 584-597, 2007.
16. M. Lillibridge, S. Elnikety, A. Birrell, M. Burrows, and M. Isard. A cooperative internet backup scheme. In ATEC'03: Proceedings of the annual conference on USENIX Annual Technical Conference, pages 3-3, 2003.
17. R. C. Merkle. Protocols for public key cryptosystems. IEEE Symposium on Security and Privacy, pages 122-134, 1980.
18. D. Micciancio. Oblivious data structures: Applications to cryptography. In In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pages 456-464, 1997.
19. M. Naor and K. Nissim. Certificate revocation and certificate update. In SSYM'98: Proceedings of the 7th conference on USENIX Security Symposium, pages 17-17, 1998.
20. H. Shacham and B. Waters. Compact proofs of retrievability. In ASIACRYPT'08: Proceedings of the 14th International Conference on the Theory and Application of Cryptolog and Information Security, pages 90-107, 2008.