{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:33:24Z","timestamp":1742913204050,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031565823"},{"type":"electronic","value":"9783031565830"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-56583-0_8","type":"book-chapter","created":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T05:02:23Z","timestamp":1712034143000},"page":"114-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SdShield: Effectively Ensuring Heap Security via Shadow Page Table"],"prefix":"10.1007","author":[{"given":"Linong","family":"Shi","sequence":"first","affiliation":[]},{"given":"Chuanping","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Zhuang","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,3]]},"reference":[{"key":"8_CR1","unstructured":"Akritidis, P.: Cling: a memory allocator to mitigate dangling pointers. In: USENIX Security (2010)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Novark, G., Berger, E.D.: DieHarder: securing the heap. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, pp. 573\u2013584 (2010)","DOI":"10.1145\/1866307.1866371"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Silvestro, S., Liu, H., Crosser, C., Lin, Z., Liu, T.: FreeGuard: a faster secure heap allocator. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 2389\u20132403 (2017)","DOI":"10.1145\/3133956.3133957"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Liu, B., Olivier, P., Ravindran, B.: SlimGuard: a secure and memory-efficient heap allocator. In: Proceedings of the 20th International Middleware Conference (2019)","DOI":"10.1145\/3361525.3361532"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Ainsworth, S., Jones, T.M.: MarkUs: drop-in use-after-free prevention for low-level languages. In: IEEE Symposium on Security and Privacy, pp. 578\u2013591 (2020)","DOI":"10.1109\/SP40000.2020.00058"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Nagarakatte, S., Zhao, J., Martin, M.M.K., Zdancewic, S.: CETS: compiler enforced temporal safety for C. In: ISMM (2010)","DOI":"10.1145\/1806651.1806657"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-39235-1_11","volume-title":"Detection of Intrusions and Malware, and Vulnerability Assessment","author":"N Nikiforakis","year":"2013","unstructured":"Nikiforakis, N., Piessens, F., Joosen, W.: HeapSentry: kernel-assisted protection against heap overflows. In: Rieck, K., Stewin, P., Seifert, J.-P. (eds.) DIMVA 2013. LNCS, vol. 7967, pp. 177\u2013196. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39235-1_11"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Lee, B., et al.: Preventing use-after-free with dangling pointers nullification. In: NDSS, pp. 1\u201315 (2015)","DOI":"10.14722\/ndss.2015.23238"},{"key":"8_CR9","unstructured":"Kouwe, E.V.D., Nigade, V., Giuffrida, C.: DangSan: scalable use-after-free detection. In: EuroSys, pp. 405\u2013419 (2017)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, M., Ainsworth, S., Jones ,T.M.: MineSweeper: a clean sweep for drop-in use-after-free prevention. In: ASPLOS, pp. 212\u2013225 (2022)","DOI":"10.1145\/3503222.3507712"},{"key":"8_CR11","unstructured":"He, L., Hu, H., Su, P., Cai, Y., Liang, Z.: FREEWILL: automatically diagnosing use-after-free bugs via reference miscounting detection on binaries. In: 31st USENIX Security Symposium (USENIX Security 2022), pp. 2497\u20132512 (2022)"},{"key":"8_CR12","unstructured":"Dhurjati, D., Adve, V.: Efficiently detecting all dangling pointer uses in production servers. In: DSN (2006)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Younan, Y.: FreeSentry: protecting against use-after-free vulnerabilities due to dangling pointers. In: NDSS, pp. 1\u201315 (2015)","DOI":"10.14722\/ndss.2015.23190"},{"key":"8_CR14","unstructured":"Dang, T.H.Y., Maniatis, P., David Wagner, D.: Oscar: a practical page-permissions-based scheme for thwarting dangling pointers. In: USENIX Security, pp. 1\u201318 (2017)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Gorter, F., Koning, K., Bos, H., Giuffrida, C.: DangZero: efficient use-after-free detection via direct page table access. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 1\u201315 (2022)","DOI":"10.1145\/3548606.3560625"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Szekeres, L., Payer, M., Wei, T., Song, D.: SoK: eternal war in memory. In: Proceedings of the 2013 IEEE Symposium on Security and Privacy (2013)","DOI":"10.1109\/SP.2013.13"},{"key":"8_CR17","unstructured":"Silvestro, S., Liu, H., Liu, T., Lin, Z., Liu, T.: Guarder: a tunable secure allocator. In: 27th USENIX Security Symposium, pp. 117\u2013133 (2018)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Yun, I., Song, S.W., Min, S., Kim, T.: HardsHeap: a universal and extensible framework for evaluating secure allocators. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security (2021)","DOI":"10.1145\/3460120.3484740"},{"key":"8_CR19","unstructured":"Wickman, B., et al.: Preventing use-after-free attacks with fast forward allocation. In: USENIX Security (2021)"},{"key":"8_CR20","unstructured":"Robertson, W., Kruegel, C., Mutz, D., Valeur, F.: Run-time detection of heap-based overflows. In: Proceedings of the 17th USENIX Conference on System Administration (2003)"},{"key":"8_CR21","unstructured":"Younan, Y., Joosen, W., Piessens, F., Eynden, H.V.D.: Security of memory allocators for C and C++. Technical report (2005)"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Shin, J., Kwon, D., Seo, J., Cho, Y., Paek, Y.: CRCount: pointer invalidation with reference counting to mitigate use-after-free in legacy C\/C++. In: NDSS (2019)","DOI":"10.14722\/ndss.2019.23541"},{"key":"8_CR23","unstructured":"Perens, B.: Electric fence malloc debugger. http:\/\/perens.com\/FreeSoftware\/ElectricFence\/. Accessed 10 Apr 2023"},{"issue":"10","key":"8_CR24","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/MC.2012.345","volume":"45","author":"F Boland","year":"2012","unstructured":"Boland, F., Black, P.: The juliet 1.1 C\/C++ and Java test suite. IEEE Comput. 45(10), 88\u201390 (2012)","journal-title":"IEEE Comput."},{"key":"8_CR25","unstructured":"Lu, S., Li, Z., Qin, F., Tan, L., Zhou, P.: BugBench: benchmarks for evaluating bug detection tools. In: Workshop on the Evaluation of Software Defect Detection Tools (2005)"},{"key":"8_CR26","unstructured":"Leitch, J.: Issue 24613. array.fromstring use after free. https:\/\/bugs.python.org\/issue24613. Accessed 10 Apr 2023"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Berger, E.D., Zorn, B.G., McKinley, K.S.: Reconsidering custom memory allocation. In: OOPSLA (2002)","DOI":"10.1145\/582420.582421"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Bernhard, L., Rodler, M., Holz, T., Davi, L.: xTag: mitigating use-after-free vulnerabilities via software-based pointer tagging on Intel x86-64. In: IEEE EuroS&P (2022)","DOI":"10.1109\/EuroSP53844.2022.00038"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Burow, N., McKee, D., Carr, S.A., Payer, M.: CUP: comprehensive user-space protection for C\/C++. In: AsiaCCS, pp. 381\u2013392 (2018)","DOI":"10.1145\/3196494.3196540"},{"key":"8_CR30","unstructured":"Farkhani, R.M., Ahmadi, M., Lu, L.: PTAuth: temporal memory safety via robust points-to authentication. In: USENIX Security (2018)"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Gui, B., Song, W., Huang, J.: UAFSan: an object-identifier-based dynamic approach for detecting use-after-free vulnerabilities. In: ISSTA (2021)","DOI":"10.1145\/3460319.3464835"},{"key":"8_CR32","unstructured":"Microsoft: GFlags and PageHeap. https:\/\/docs.microsoft.com\/en-us\/windows-hardware\/drivers\/debugger\/gflags-and-pageheap. Accessed 10 Mar 2023"},{"issue":"3","key":"8_CR33","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1587\/transinf.E97.D.601","volume":"97","author":"D Tian","year":"2014","unstructured":"Tian, D., Li, X., Chen, M., Hu, C.: ICruiser: an improved approach for concurrent heap buffer overflow monitoring. IEICE Trans. Inf. Syst. 97(3), 601\u2013605 (2014)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"8_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-40965-6_2","volume-title":"Advances in Computing Science \u2013 ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation","author":"T Maeda","year":"2003","unstructured":"Maeda, T., Yonezawa, A.: Kernel Mode Linux: toward an operating system protected by a type theory. In: Saraswat, V.A. (ed.) ASIAN 2003. LNCS, vol. 2896, pp. 3\u201317. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40965-6_2"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Boehm, H.J., Demers, A.J., Shenker, S.: Mostly parallel garbage collection. In: PLDI (1991)","DOI":"10.1145\/113445.113459"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Digital Forensics and Cyber Crime"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56583-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T10:04:06Z","timestamp":1724925846000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56583-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031565823","9783031565830"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56583-0_8","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDF2C","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Digital Forensics and Cyber Crime","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdf2c2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"105","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}