{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,3]],"date-time":"2026-11-03T12:59:19Z","timestamp":1793710759164,"version":"4.6.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540205920","type":"print"},{"value":"9783540400615","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40061-5_12","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:06:00Z","timestamp":1283713560000},"page":"188-207","source":"Crossref","is-referenced-by-count":76,"title":["Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking"],"prefix":"10.1007","author":[{"given":"Dwaine","family":"Clarke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Srinivas","family":"Devadas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marten","family":"van Dijk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Blaise","family":"Gassend","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G. Edward","family":"Suh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: 28th ACM STOC, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-48658-5_22","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Goldreich, O., Goldwasser, S.: Incremental cryptography: The case of hashing and signing. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 216\u2013233. Springer, Heidelberg (1994)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-44750-4_2","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Guerin, R., Rogaway, P.: XOR MACs: New methods for message authentication using finite pseudorandom functions. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 15\u201328. Springer, Heidelberg (1995)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/3-540-69053-0_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Micciancio, D.: A new paradigm for collision-free hashing: Incrementality at reduced cost. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 163\u2013192. Springer, Heidelberg (1997)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"ACM CCS 1993","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM CCS 1993, pp. 62\u201373. ACM Press, New York (1993)"},{"key":"12_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, 225\u2013244 (1994)","journal-title":"Algorithmica"},{"key":"12_CR7","unstructured":"Clarke, D., Gassend, B., Suh, G.E., van Dijk, M., Devadas, S.: Offline integrity checking of untrusted storage. MIT-LCS-TR-871 (November 2002)"},{"key":"12_CR8","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Collision-free hashing from lattice problems. In: Theory of Cryptography Library 96-09 (July 1996)"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM\u00a033(4), 210\u2013217 (1986)","journal-title":"Journal of the ACM"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications. In: 22nd ACM STOC, pp. 213\u2013223 (1990)","DOI":"10.1145\/100216.100244"},{"key":"12_CR11","unstructured":"NIST. FIPS PUB 180-1: Secure Hash Standard (April 1995)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Rivest, R.: RFC 1321: The MD5 Message-Digest Algorithm (April 1992)","DOI":"10.17487\/rfc1321"},{"key":"12_CR13","unstructured":"Suh, G.E., Clarke, D., Gassend, B., van Dijk, M., Devadas, S.: Aegis: Architecture for tamper-evident and tamper-resistant processing. In: Proceedings of the 17th Int\u2019l Conference on Supercomputing (June 2003)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Suh, G.E., Clarke, D., Gassend, B., van Dijk, M., Devadas, S.: Efficient memory integrity verification and encryption for secure processors. In: Proceedings of the 36th Int\u2019l Symposium on Microarchitecture (December 2003)","DOI":"10.1109\/MICRO.2003.1253207"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40061-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T17:18:53Z","timestamp":1559582333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40061-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205920","9783540400615"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40061-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}