{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:25Z","timestamp":1750220965998,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T00:00:00Z","timestamp":1555027200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,4,12]]},"DOI":"10.1145\/3325730.3325738","type":"proceedings-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T12:45:07Z","timestamp":1561121107000},"page":"115-122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Novel and Fine-grained Heap Randomization Allocation Strategy for Effectively Alleviating Heap Buffer Overflow Vulnerabilities"],"prefix":"10.1145","author":[{"given":"Zhiyong","family":"Jin","sequence":"first","affiliation":[{"name":"School of Mechanical Science & Engineering, Huazhong University of Science and Technology, Wuhan, Hubei, China"}]},{"given":"Yongfu","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Mechanical Science & Engineering, Huazhong University of Science and Technology, Wuhan, Hubei, China"}]},{"given":"Tian","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Mechanical Science & Engineering, Huazhong University of Science and Technology, Wuhan, Hubei, China"}]},{"given":"Kai","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mechanical Science & Engineering, Huazhong University of Science and Technology, Wuhan, Hubei, China"}]},{"given":"Zhenting","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Mechanical Science & Engineering, Huazhong University of Science and Technology, Wuhan, Hubei, China"}]},{"given":"Jiongzhi","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Mechanical Science & Engineering, Huazhong University of Science and Technology, Wuhan, Hubei, China"}]}],"member":"320","published-online":{"date-parts":[[2019,4,12]]},"reference":[{"volume-title":"USENIX Security Symposium","author":"Bhatkar R.","key":"e_1_3_2_1_1_1","unstructured":"S. Bhatkar , R. Sekar , and D. C. DuVarney . 2005. Efficient techniques for comprehensive protection from memory error exploits . In USENIX Security Symposium . Baltimore, Maryland, USA. S. Bhatkar, R. Sekar, and D. C. DuVarney. 2005. Efficient techniques for comprehensive protection from memory error exploits. In USENIX Security Symposium. Baltimore, Maryland, USA."},{"key":"e_1_3_2_1_2_1","volume":"201","author":"Piromsopa K","unstructured":"Piromsopa . K , Enbody. R. J. 201 1. Survey of Protections from Buffer-Overflow Attacks. Engineering Journal. Piromsopa. K, Enbody. R. J. 2011. Survey of Protections from Buffer-Overflow Attacks. Engineering Journal.","journal-title":"Enbody. R. J."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSAC.2004.2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978321"},{"key":"e_1_3_2_1_5_1","volume-title":"VTint: Defending Virtual Function Tables' Integrity. In 22nd Annual Network and Distributed System Security Symposium","author":"Zhang C.","year":"2015","unstructured":"C. Zhang , C. Song , K. Z. Chen , Z. Chen , and D Song . 2015 . VTint: Defending Virtual Function Tables' Integrity. In 22nd Annual Network and Distributed System Security Symposium . San Diego, CA, USA. C. Zhang, C. Song, K. Z. Chen, Z. Chen, and D Song. 2015. VTint: Defending Virtual Function Tables' Integrity. In 22nd Annual Network and Distributed System Security Symposium. San Diego, CA, USA."},{"volume-title":"IEEE Symposium on Security and Privacy","author":"Pappas M.","key":"e_1_3_2_1_6_1","unstructured":"V. Pappas , M. Polychronakis , and A. D. Keromytis . 2012. Smashing the gadgets: Hindering return-oriented programming using in-place code randomization . In IEEE Symposium on Security and Privacy . San Francisco, CA, USA. V. Pappas, M. Polychronakis, and A. D. Keromytis. 2012. Smashing the gadgets: Hindering return-oriented programming using in-place code randomization. In IEEE Symposium on Security and Privacy. San Francisco, CA, USA."},{"key":"e_1_3_2_1_7_1","unstructured":"C. Zhang T. Wei and Z. Chen. 2013. Practical Control Flow Integrity and Randomization for Binary Executables. Security and Privacy IEEE. Berkeley CA USA.Ding W. and Marchionini G. 1997. A Study on Video Browsing Strategies. Technical Report. University of Maryland at College Park.  C. Zhang T. Wei and Z. Chen. 2013. Practical Control Flow Integrity and Randomization for Binary Executables. Security and Privacy IEEE. Berkeley CA USA.Ding W. and Marchionini G. 1997. A Study on Video Browsing Strategies. Technical Report. University of Maryland at College Park."},{"volume-title":"Black Hat Asia.","author":"Litchfield","key":"e_1_3_2_1_8_1","unstructured":"D. Litchfield . 2003. Defeating the stack based buffer overflow exploitation prevention mechanism of microsoft windows 2003 server . In Black Hat Asia. Singapore . D. Litchfield. 2003. Defeating the stack based buffer overflow exploitation prevention mechanism of microsoft windows 2003 server. In Black Hat Asia. Singapore."},{"key":"e_1_3_2_1_9_1","volume-title":"36th IEEE Symposium on Security and Privacy, S&P","author":"Kugle C","year":"2015","unstructured":"Kugle . C , M\u00fcller . T. 2015 . Separated Control and Data Stacks to Mitigate Buffer Overflow Exploits . In 36th IEEE Symposium on Security and Privacy, S&P . San Jose, CA, USA. Kugle. C, M\u00fcller. T. 2015. Separated Control and Data Stacks to Mitigate Buffer Overflow Exploits. In 36th IEEE Symposium on Security and Privacy, S&P. San Jose, CA, USA."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.51"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23644-0_7"},{"key":"e_1_3_2_1_12_1","volume-title":"Marlin: A Fine Grained Randomization Approach to Defend against ROP Attacks. Network and System Security.","author":"Gupta A","year":"2013","unstructured":"Gupta . A , Kerr . S , and Kirkpatrick . M. S. 2013 . Marlin: A Fine Grained Randomization Approach to Defend against ROP Attacks. Network and System Security. Heidelberg, Germany . Gupta. A, Kerr. S, and Kirkpatrick. M. S. 2013. Marlin: A Fine Grained Randomization Approach to Defend against ROP Attacks. Network and System Security. Heidelberg, Germany."},{"volume-title":"35th IEEE Symposium on Security and Privacy, S&P","author":"Larsen A.","key":"e_1_3_2_1_13_1","unstructured":"P. Larsen , A. Homescu , S. Brunthaler , and M. Franz . 2014. SoK: Automated software diversity . In 35th IEEE Symposium on Security and Privacy, S&P . Berkeley, CA, USA. P. Larsen, A. Homescu, S. Brunthaler, and M. Franz. 2014. SoK: Automated software diversity. In 35th IEEE Symposium on Security and Privacy, S&P. Berkeley, CA, USA."},{"key":"e_1_3_2_1_14_1","volume-title":"Usenix Conference on Security Symposium","author":"Backes M.","year":"2014","unstructured":"Backes . M. 2014 . Oxymoron: making fine-grained memory randomization practical by allowing code sharing . Usenix Conference on Security Symposium . San Diego, CA, USA. Backes. M. 2014. Oxymoron: making fine-grained memory randomization practical by allowing code sharing. Usenix Conference on Security Symposium. San Diego, CA, USA."},{"volume-title":"Just-In-Time Code Reuse: On the Effectiveness of Fine-Grained Address Space Layout Randomization. Security and Privacy","author":"Snow K. Z","key":"e_1_3_2_1_15_1","unstructured":"Snow . K. Z , Monrose . F , and Davi . L. 2013. Just-In-Time Code Reuse: On the Effectiveness of Fine-Grained Address Space Layout Randomization. Security and Privacy , IEEE. Berkeley, CA , USA. Snow. K. Z, Monrose. F, and Davi. L. 2013. Just-In-Time Code Reuse: On the Effectiveness of Fine-Grained Address Space Layout Randomization. Security and Privacy, IEEE. Berkeley, CA, USA."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.30"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2857705.2857707"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21966-0_4"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-4048(93)90054-9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1900546.1900550"},{"key":"e_1_3_2_1_21_1","unstructured":"T. Jackson B. Salamat A. Homescu K. Manivannan G. Wagner A. Gal S. Brunthaler C. Wimmer and M. Franz. 2011. Moving Target Defense. Chapter 4.  T. Jackson B. Salamat A. Homescu K. Manivannan G. Wagner A. Gal S. Brunthaler C. Wimmer and M. Franz. 2011. Moving Target Defense. Chapter 4."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/3195638.3195686"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSAC.2006.9"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2012.39"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382216"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2362793.2362833"},{"volume-title":"Binary rewriting without relocation information","author":"Barua R. K","key":"e_1_3_2_1_27_1","unstructured":"Barua . R. K , Smithson . M. 2013. Binary rewriting without relocation information . University of Maryland , Tech. Rep. Barua. R. K, Smithson. M. 2013. Binary rewriting without relocation information. University of Maryland, Tech. Rep."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SERE-C.2014.28"}],"event":{"name":"ICMAI 2019: 2019 4th International Conference on Mathematics and Artificial Intelligence","sponsor":["Southwest Jiaotong University","Xihua University Xihua University"],"location":"Chegndu China","acronym":"ICMAI 2019"},"container-title":["Proceedings of the 2019 4th International Conference on Mathematics and Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3325730.3325738","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3325730.3325738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:22Z","timestamp":1750204462000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3325730.3325738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,12]]},"references-count":28,"alternative-id":["10.1145\/3325730.3325738","10.1145\/3325730"],"URL":"https:\/\/doi.org\/10.1145\/3325730.3325738","relation":{},"subject":[],"published":{"date-parts":[[2019,4,12]]},"assertion":[{"value":"2019-04-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}