{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T11:46:09Z","timestamp":1789991169150,"version":"4.0.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319112022","type":"print"},{"value":"9783319112039","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11203-9_14","type":"book-chapter","created":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T16:36:46Z","timestamp":1408034206000},"page":"239-256","source":"Crossref","is-referenced-by-count":13,"title":["StealthGuard: Proofs of Retrievability with Hidden Watchdogs"],"prefix":"10.1007","author":[{"given":"Monir","family":"Azraoui","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaoutar","family":"Elkhiyaoui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Refik","family":"Molva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Melek","family":"\u00d6nen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Juels, A., Kaliski Jr., B.S.: Pors: proofs of retrievability for large files. In: Ning, P., di Vimercati, S.D.C., Syverson, P.F. (eds.) ACM Conference on Computer and Communications Security, pp. 584\u2013597. ACM (2007)","DOI":"10.1145\/1315245.1315317"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-89255-7_7","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"H. Shacham","year":"2008","unstructured":"Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 90\u2013107. Springer, Heidelberg (2008)"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1952982.1952994","volume":"14","author":"G. Ateniese","year":"2011","unstructured":"Ateniese, G., Burns, R.C., Curtmola, R., Herring, J., Khan, O., Kissner, L., Peterson, Z.N.J., Song, D.: Remote data checking using provable data possession. ACM Trans. Inf. Syst. Secur.\u00a014(1), 12 (2011)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Xu, J., Chang, E.C.: Towards efficient proofs of retrievability. In: ASIACCS, pp. 79\u201380 (2012)","DOI":"10.1145\/2414456.2414503"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Stefanov, E., van Dijk, M., Juels, A., Oprea, A.: Iris: a scalable cloud file system with efficient integrity checks. In: ACSAC, pp. 229\u2013238 (2012)","DOI":"10.1145\/2420950.2420985"},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"I.S. Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial Codes Over Certain Finite Fields. Journal of the Society of Industrial and Applied Mathematics\u00a08(2), 300\u2013304 (1960)","journal-title":"Journal of the Society of Industrial and Applied Mathematics"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Dworkin, M.: Recommendation for Block Cipher Modes of Operation: Methods and Techniques. National Institute of Standards and Technology. Special Publication 800-38A (2001)","DOI":"10.6028\/NIST.SP.800-38a"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-31680-7_10","volume-title":"Privacy Enhancing Technologies","author":"E.-O. Blass","year":"2012","unstructured":"Blass, E.-O., Di Pietro, R., Molva, R., \u00d6nen, M.: PRISM \u2013 Privacy-Preserving Search in MapReduce. In: Fischer-H\u00fcbner, S., Wright, M. (eds.) PETS 2012. LNCS, vol.\u00a07384, pp. 180\u2013200. Springer, Heidelberg (2012)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Pietro, R.D., Mancini, L.V., Tsudik, G.: Scalable and efficient provable data possession. In: Proceedings of the 4th International Conference on Security and Privacy in Communication Networks, SecureComm 2008, pp. 9:1\u20139:10. ACM, New York (2008)","DOI":"10.1145\/1460877.1460889"},{"key":"14_CR10","first-page":"213","volume-title":"Proceedings of the 16th ACM Conference on Computer and Communications Security, CCS 2009","author":"C. Erway","year":"2009","unstructured":"Erway, C., K\u00fcp\u00e7\u00fc, A., Papamanthou, C., Tamassia, R.: Dynamic provable data possession. In: Proceedings of the 16th ACM Conference on Computer and Communications Security, CCS 2009, pp. 213\u2013222. ACM, New York (2009)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-04444-1_22","volume-title":"Computer Security \u2013 ESORICS 2009","author":"Q. Wang","year":"2009","unstructured":"Wang, Q., Wang, C., Li, J., Ren, K., Lou, W.: Enabling public verifiability and data dynamics for storage security in cloud computing. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol.\u00a05789, pp. 355\u2013370. Springer, Heidelberg (2009)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Zheng, Q., Xu, S.: Fair and dynamic proofs of retrievability. In: CODASPY, pp. 237\u2013248 (2011)","DOI":"10.1145\/1943513.1943546"},{"issue":"5","key":"14_CR13","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1109\/TPDS.2010.183","volume":"22","author":"Q. Wang","year":"2011","unstructured":"Wang, Q., Wang, C., Ren, K., Lou, W., Li, J.: Enabling public auditability and data dynamics for storage security in cloud computing. IEEE Trans. Parallel Distrib. Syst.\u00a022(5), 847\u2013859 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Mo, Z., Zhou, Y., Chen, S.: A dynamic proof of retrievability (por) scheme with o(logn) complexity. In: ICC, pp. 912\u2013916 (2012)","DOI":"10.1109\/ICC.2012.6364056"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Chen, B., Curtmola, R.: Robust dynamic provable data possession. In: ICDCS Workshops, pp. 515\u2013525 (2012)","DOI":"10.1109\/ICDCSW.2012.57"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-38348-9_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"D. Cash","year":"2013","unstructured":"Cash, D., K\u00fcp\u00e7\u00fc, A., Wichs, D.: Dynamic proofs of retrievability via oblivious RAM. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 279\u2013295. Springer, Heidelberg (2013)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Shi, E., Stefanov, E., Papamanthou, C.: Practical dynamic proofs of retrievability. In: ACM Conference on Computer and Communications Security, pp. 325\u2013336 (2013)","DOI":"10.1145\/2508859.2516669"},{"issue":"3","key":"14_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L. Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary Cache: a Scalable Wide-Area Web Cache Sharing Protocol. IEEE\/ACM Trans. Netw.\u00a08(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Keying Hash Functions for Message Authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 1\u201315. Springer, Heidelberg (1996)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Azraoui, M., Elkhiyaoui, K., Molva, R., \u00d6nen, M.: Stealthguard: Proofs of retrievability with hidden watchdogs. Technical report, EURECOM (June 2014)","DOI":"10.1007\/978-3-319-11203-9_14"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-18178-8_10","volume-title":"Information Security","author":"J. Trostle","year":"2011","unstructured":"Trostle, J., Parrish, A.: Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups. In: Burmester, M., Tsudik, G., Magliveras, S., Ili\u0107, I. (eds.) ISC 2010. LNCS, vol.\u00a06531, pp. 114\u2013128. Springer, Heidelberg (2011)"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Burns, R.C., Curtmola, R., Herring, J., Kissner, L., Peterson, Z.N.J., Song, D.: Provable data possession at untrusted stores. In: Ning, P., di Vimercati, S.D.C., Syverson, P.F. (eds.) ACM Conference on Computer and Communications Security, pp. 598\u2013609. ACM (2007)","DOI":"10.1145\/1315245.1315318"},{"issue":"4","key":"14_CR23","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. J. Cryptology\u00a017(4), 297\u2013319 (2004)","journal-title":"J. Cryptology"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A. Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 177\u2013194. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Computer Security - ESORICS 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11203-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T20:08:40Z","timestamp":1569182920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11203-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319112022","9783319112039"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11203-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}