{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T23:10:07Z","timestamp":1748819407257,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319318745"},{"type":"electronic","value":"9783319318752"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-31875-2_32","type":"book-chapter","created":{"date-parts":[[2016,3,23]],"date-time":"2016-03-23T09:05:02Z","timestamp":1458723902000},"page":"386-398","source":"Crossref","is-referenced-by-count":1,"title":["Fully Batch Processing Enabled Memory Integrity Verification Algorithm Based on Merkle Tree"],"prefix":"10.1007","author":[{"given":"Se Hwan","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonggon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ohmin","family":"Kwon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyunsoo","family":"Yoon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Bellard, F.: QEMU, a Fast and Portable Dynamic Translator. In: USENIX Annual Technical Conference, FREENIX Track, pp. 41\u201346 (2005)"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Blum, M., Evans, W., Gemmell, P., Kannan, S., Naor, M.: Checking the cor-rectness of memories. In: Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science 1991, pp. 90\u201399 (1991)","DOI":"10.1109\/SFCS.1991.185352"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-40061-5_12","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"D Clarke","year":"2003","unstructured":"Clarke, D., Devadas, S., van Dijk, M., Gassend, B., Suh, G.: Incremental multiset hash functions and their application to memory integrity checking. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 188\u2013207. Springer, Heidelberg (2003)"},{"key":"32_CR4","unstructured":"Clarke, D., 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, 2005, pp. 139\u2013153 (2005)"},{"key":"32_CR5","unstructured":"Eastlake, D., Jones, P.: US secure hash algorithm 1 (SHA1) (2001). http:\/\/www.hjp.at\/doc\/rfc\/rfc3174.html"},{"key":"32_CR6","first-page":"1","volume":"2008","author":"I Foster","year":"2008","unstructured":"Foster, I., Zhao, Y., Raicu, I., Lu, S.: Cloud computing and grid computing 360-degree compared. Grid Comput. Environ. Workshop 2008, 1\u201310 (2008)","journal-title":"Grid Comput. Environ. Workshop"},{"key":"32_CR7","first-page":"295","volume":"2003","author":"B Gassend","year":"2003","unstructured":"Gassend, B., Suh, G.E., Clarke, D., Van Dijk, M., Devadas, S.: Caches and hash trees for efficient memory integrity verification. High Perform. Comput. Archit. 2003, 295\u2013306 (2003)","journal-title":"High Perform. Comput. Archit."},{"issue":"4","key":"32_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1186736.1186737","volume":"34","author":"JL Henning","year":"2006","unstructured":"Henning, J.L.: SPEC CPU2006 benchmark descriptions. ACM SIGARCH Comput. Architect. News 34(4), 1\u201317 (2006)","journal-title":"ACM SIGARCH Comput. Architect. News"},{"key":"32_CR9","first-page":"122","volume":"1980","author":"RC Merkle","year":"1980","unstructured":"Merkle, R.C.: Protocols for public key cryptosystems. IEEE Symp. Secur. Priv. 1980, 122\u2013123 (1980)","journal-title":"IEEE Symp. Secur. Priv."},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Patel, A., Afram, F., Ghose, K.: Marss-x86: A qemu-based micro-architectural and systems simulator for x86 multicore processors. In: 1st International Qemu Users\u2019 Forum, pp. 29\u201330 (2011)","DOI":"10.1145\/2024724.2024954"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Rogers, B., Chhabra, S., Prvulovic, M., Solihin, Y.: Using address independent seed encryption and bonsai merkle trees to make secure processors os and performance-friendly. In: Proceedings of the 40th Annual IEEE\/ACM International Symposium on Microarchitecture 2007, pp. 183\u2013196 (2007)","DOI":"10.1109\/MICRO.2007.16"},{"key":"32_CR12","unstructured":"Suh, G.E., Clarke, D., Gassend, B., Dijk, M.V., Devadas, S.: Efficient memory integrity verification and encryption for secure processors. In: Proceedings of the 36th Annual IEEE\/ACM International Symposium on Microarchitecture 2003, p. 339 (2003)"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Szefer, J., Biedermann, S.: Towards fast hardware memory integrity checking with skewed Merkle trees. In: Proceedings of the Third Workshop on Hard-ware and Architectural Support for Security and Privacy 2014, p. 9 (2014)","DOI":"10.1145\/2611765.2611774"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Yourst, M.T.: PTLsim: A cycle accurate full system x86-64 microarchitec-tural simulator. In: IEEE International Symposium on Performance Analysis of Systems & Software, ISPASS 2007, pp. 23\u201334 (2007)","DOI":"10.1109\/ISPASS.2007.363733"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31875-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T22:42:35Z","timestamp":1748817755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31875-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319318745","9783319318752"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31875-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}