{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:27:33Z","timestamp":1778128053406,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642004568","type":"print"},{"value":"9783642004575","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00457-5_30","type":"book-chapter","created":{"date-parts":[[2009,2,19]],"date-time":"2009-02-19T09:59:44Z","timestamp":1235037584000},"page":"503-520","source":"Crossref","is-referenced-by-count":30,"title":["How Efficient Can Memory Checking Be?"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy N.","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Addison-Wesley Series in Computer Science and Information Processing","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley Series in Computer Science and Information Processing. Addison Wesley, Reading (1974)"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The invasiveness of off-line memory checking. In: STOC, pp. 504\u2013513 (2002)","DOI":"10.1145\/509907.509981"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Amato, N.M., Loui, M.C.: Checking linked data structures. In: Proceedings of the 24th Annual International Symposium on Fault-Tolerant Computing (FTCS), pp. 164\u2013173 (1994)","DOI":"10.1109\/FTCS.1994.315644"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., Song, D.: Provable data possession at untrusted stores. Cryptology ePrint Archive, Report 2007\/202 (2007)","DOI":"10.1145\/1315245.1315318"},{"key":"30_CR5","volume-title":"Programming Pearls","author":"J. Bentley","year":"1986","unstructured":"Bentley, J.: Programming Pearls. ACM, New York (1986)"},{"issue":"2\/3","key":"30_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01185212","volume":"12","author":"M. Blum","year":"1994","unstructured":"Blum, M., Evans, W.S., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. Algorithmica\u00a012(2\/3), 225\u2013244 (1994)","journal-title":"Algorithmica"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/176454.176484","volume":"2","author":"P. Briggs","year":"1993","unstructured":"Briggs, P., Torczon, L.: An efficient representation for sparse sets. ACM Letters on Programming Languages and Systems\u00a02, 59\u201369 (1993)","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Clarke, D.E., Suh, G.E., Gassend, B., Sudan, A., van Dijk, M., Devadas, S.: Towards constant bandwidth overhead integrity checking of untrusted data. In: IEEE Symposium on Security and Privacy, pp. 139\u2013153 (2005)","DOI":"10.1109\/SP.2005.24"},{"key":"30_CR9","unstructured":"Cox, R.: http:\/\/research.swtch.com\/2008\/03\/using-uninitialized-memory-for-fun-and.html"},{"key":"30_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"The Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: The Foundations of Cryptography, vol.\u00a01. Cambridge University Press, Cambridge (2001)"},{"key":"30_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: The Foundations of Cryptography, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"issue":"2","key":"30_CR12","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct pseudorandom functions. Journal of the ACM\u00a033(2), 792\u2013807 (1986)","journal-title":"Journal of the ACM"},{"key":"30_CR13","first-page":"584","volume-title":"CCS 2007: Proceedings of the 14th ACM conference on Computer and communications security","author":"A. Juels","year":"2007","unstructured":"Juels, A., Kaliski, B.: Pors: proofs of retrievability for large files. In: CCS 2007: Proceedings of the 14th ACM conference on Computer and communications security, pp. 584\u2013597. ACM, New York (2007)"},{"issue":"4","key":"30_CR14","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput.\u00a022(4), 838\u2013856 (1993)","journal-title":"SIAM J. Comput."},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Naor, M., Rothblum, G.N.: The complexity of online memory checking. In: FOCS, pp. 573\u2013584 (2005)","DOI":"10.1109\/SFCS.2005.71"},{"key":"30_CR16","unstructured":"Oprea, A., Reiter, M.K.: Integrity checking in cryptographic file systems with constant trusted storage. In: USENIX Security Symposium (2007)"},{"key":"30_CR17","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":"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)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00457-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T04:13:31Z","timestamp":1558152811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00457-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642004568","9783642004575"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00457-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}