{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:07:25Z","timestamp":1755839245702,"version":"3.41.0"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T00:00:00Z","timestamp":1638748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2018YFB1003305"],"award-info":[{"award-number":["2018YFB1003305"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61832020, 61821003, and 61772216"],"award-info":[{"award-number":["61832020, 61821003, and 61772216"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2022,3,31]]},"abstract":"<jats:p>Data security is an indispensable part of non-volatile memory (NVM) systems. However, implementing data security efficiently on NVM is challenging, since we have to guarantee the consistency of user data and the related security metadata. Existing consistency schemes ignore the recoverability of the SGX style integrity tree (SIT) and the access correlation between metadata blocks, thereby generating unnecessary NVM write traffic. In this article, we propose SecNVM, an efficient and write-friendly metadata crash consistency scheme for secure NVM. SecNVM utilizes the observation that for a lazily updated SIT, the lost tree nodes after a crash can be recovered by the corresponding child nodes in NVM. It reduces the SIT persistency overhead through a restrained write-back metadata cache and exploits the SIT inter-layer dependency for recovery. Next, leveraging the strong access correlation between the counter and DMAC, SecNVM improves the efficiency of security metadata access through a novel collaborative counter-DMAC scheme. In addition, it adopts a lightweight address tracker to reduce the cost of address tracking for fast recovery. Experiments show that compared to the state-of-the-art schemes, SecNVM improves the performance and decreases write traffic a lot, and achieves an acceptable recovery time.<\/jats:p>","DOI":"10.1145\/3488724","type":"journal-article","created":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T21:29:34Z","timestamp":1638826174000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["SecNVM: An Efficient and Write-Friendly Metadata Crash Consistency Scheme for Secure NVM"],"prefix":"10.1145","volume":"19","author":[{"given":"Mengya","family":"Lei","sequence":"first","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, Hubei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Li","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, Hubei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang","family":"Wang","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, Hubei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Feng","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, Hubei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaomin","family":"Zou","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, Hubei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renzhi","family":"Xiao","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, Hubei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,12,6]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"Wikipedia. [n.d.]. Wikipedia Power-on self-test. https:\/\/en.wikipedia.org\/wiki\/Power-on_self-test."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2020.3020085"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/2980024.2872377"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3307650.3322250"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2024716.2024718"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3015925"},{"key":"e_1_3_1_8_2","unstructured":"Siddhartha Chhabra Raghunandan Makaram Jim McCormick and Binata Bhattacharyya. 2019. Cache and Data Organization for Memory Protection. (Jan. 22 2019). US Patent 10 185 842."},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2024723.2000086"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1961296.1950380"},{"key":"e_1_3_1_11_2","unstructured":"Intel Cooperation. 2016. Intel Architecture Instruction Set Extensions Programming Reference . Technical Report 319433-030. Intel."},{"issue":"86","key":"e_1_3_1_12_2","first-page":"1","article-title":"Intel SGX explained","volume":"2016","author":"Costan Victor","year":"2016","unstructured":"Victor Costan and Srinivas Devadas. 2016. Intel SGX explained. IACR Cryptology ePrint Archive 2016, 86 (2016), 1\u2013118.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2005.3"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.5555\/822080.822806"},{"issue":"204","key":"e_1_3_1_15_2","first-page":"1","article-title":"A memory encryption engine suitable for general purpose processors","volume":"2016","author":"Gueron Shay","year":"2016","unstructured":"Shay Gueron. 2016. A memory encryption engine suitable for general purpose processors. IACR Cryptology ePrint Archive 2016, 204 (2016), 1\u201314.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00034"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA51647.2021.00038"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2016.2615845"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1555815.1555758"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2016.2538218"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.5555\/3408352.3408514"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3012007"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2013.6522320"},{"key":"e_1_3_1_24_2","unstructured":"Helger Lipmaa Phillip Rogaway and David Wagner. 2000. Comments to NIST concerning AES modes of operation: CTR-Mode encryption. In Symmetric Key Block Cipher Modes of Operation Workshop 18 Oct 2000 Baltimore Maryland USA ."},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2334321"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00035"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389134"},{"key":"e_1_3_1_28_2","article-title":"The Galois\/counter mode of operation (GCM)","author":"McGrew David","year":"2004","unstructured":"David McGrew and John Viega. 2004. The Galois\/counter mode of operation (GCM). Submission to NIST Modes of Operation Process.","journal-title":"Submission to NIST Modes of Operation Process."},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2830772.2830802"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2007.44"},{"key":"e_1_3_1_31_2","unstructured":"Andy M. Rudoff. 2016. Deprecating the pcommit instruction. https:\/\/software.intel.com\/content\/www\/us\/en\/develop\/blogs\/deprecate-pcommit-instruction.html."},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00041"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00046"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/1816038.1815980"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.5555\/3130379.3130595"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3195970.3195983"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2018.2863281"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898087"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3195970.3196123"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA45697.2020.00066"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3296957.3177155"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/1150019.1136502"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3381835"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317869"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00040"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2019.2941193"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/2786763.2694387"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3195799"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.5555\/3408352.3408524"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/3307650.3322252"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358290"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00043"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488724","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:28Z","timestamp":1750193308000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488724"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,6]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3,31]]}},"alternative-id":["10.1145\/3488724"],"URL":"https:\/\/doi.org\/10.1145\/3488724","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2021,12,6]]},"assertion":[{"value":"2021-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}