{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:39:26Z","timestamp":1743064766705,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319027258"},{"type":"electronic","value":"9783319027265"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02726-5_1","type":"book-chapter","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T09:39:17Z","timestamp":1383125957000},"page":"1-16","source":"Crossref","is-referenced-by-count":0,"title":["Defending against Heap Overflow by Using Randomization in Nested Virtual Clusters"],"prefix":"10.1007","author":[{"given":"Chee Meng","family":"Tey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"The PaX Team: Homepage of the PaX Team, \n                    \n                      http:\/\/pax.grsecurity.net"},{"key":"1_CR2","unstructured":"Android community: Android security overview, \n                    \n                      http:\/\/source.android.com\/tech\/security\/index.html"},{"key":"1_CR3","unstructured":"Otto Moerbeek: A new malloc(3) for OpenBSD, \n                    \n                      http:\/\/www.openbsd.org\/papers\/eurobsdcon2009\/otto-malloc.pdf"},{"key":"1_CR4","unstructured":"Ollie Whitehouse: An Analysis of Address Space Layout Randomization on Windows Vista, \n                    \n                      http:\/\/www.symantec.com\/avcenter\/reference\/Address_Space_Layout_Randomization.pdf\n                    \n                    \n                  ."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/1133981.1134000","volume-title":"Proceedings of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2006","author":"E.D. Berger","year":"2006","unstructured":"Berger, E.D., Zorn, B.G.: Diehard: probabilistic memory safety for unsafe languages. In: Proceedings of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2006, pp. 158\u2013168. ACM, New York (2006)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1145\/1866307.1866371","volume-title":"Proceedings of the 17th ACM Conference on Computer and Communications Security, CCS 2010","author":"G. Novark","year":"2010","unstructured":"Novark, G., Berger, E.D.: Dieharder: securing the heap. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, CCS 2010, pp. 573\u2013584. ACM, New York (2010)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Li, L., Just, J.E., Sekar, R.: Address-space randomization for windows systems. In: Proceedings of the 22nd Annual Computer Security Applications Conference, pp. 329\u2013338 (2006)","DOI":"10.1109\/ACSAC.2006.10"},{"key":"1_CR8","unstructured":"OpenBSD: The OpenBSD project, \n                    \n                      http:\/\/www.openbsd.org"},{"key":"1_CR9","unstructured":"Bhatkar, S., DuVarney, D.C., Sekar, R.: Address obfuscation: An efficient approach to combat a broad range of memory error exploits. In: Proceedings of the 12th USENIX Security Symposium, Washington, DC, vol.\u00a0120 (2003)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Barrantes, E.G., Ackley, D.H., Palmer, T.S., Stefanovic, D., Zovi, D.D.: Randomized instruction set emulation to disrupt binary code injection attacks. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, pp. 281\u2013289. ACM (2003)","DOI":"10.1145\/948109.948147"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1053283.1053286","volume":"8","author":"E.G. Barrantes","year":"2005","unstructured":"Barrantes, E.G., Ackley, D.H., Forrest, S., Stefanovi\u0107, D.: Randomized instruction set emulation. ACM Transactions on Information and System Security (TISSEC)\u00a08(1), 3\u201340 (2005)","journal-title":"ACM Transactions on Information and System Security (TISSEC)"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1109\/TDSC.2008.58","volume":"7","author":"S.W. Boyd","year":"2010","unstructured":"Boyd, S.W., Kc, G.S., Locasto, M.E., Keromytis, A.D., Prevelakis, V.: On the general applicability of instruction-set randomization. IEEE Transactions on Dependable and Secure Computing\u00a07(3), 255\u2013270 (2010)","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Kc, G.S., Keromytis, A.D., Prevelakis, V.: Countering code-injection attacks with instruction-set randomization. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, pp. 272\u2013280. ACM (2003)","DOI":"10.1145\/948109.948146"},{"key":"1_CR14","unstructured":"Cadar, C., Akritidis, P., Costa, M., Martin, J.P., Castro, M.: Data randomization. Technical report, Microsoft Research (2008) Technical Report MSR-TR-2008-120"},{"key":"1_CR15","first-page":"1","volume-title":"Proceedings of the 2nd Conference on USENIX Workshop on Offensive Technologies, WOOT 2008","author":"M. Daniel","year":"2008","unstructured":"Daniel, M., Honoroff, J., Miller, C.: Engineering heap overflow exploits with javascript. In: Proceedings of the 2nd Conference on USENIX Workshop on Offensive Technologies, WOOT 2008, pp. 1:1\u20131:6. USENIX Association, Berkeley (2008)"},{"issue":"3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1145\/321650.321658","volume":"18","author":"J.M. Robson","year":"1971","unstructured":"Robson, J.M.: An estimate of the store size necessary for dynamic storage allocation. J. ACM\u00a018(3), 416\u2013423 (1971)","journal-title":"J. ACM"},{"key":"1_CR17","unstructured":"OEIS: The On-Line Encyclopedia of Integer Sequences (August 2013), \n                    \n                      http:\/\/oeis.org\/"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02726-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T20:25:48Z","timestamp":1566764748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02726-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319027258","9783319027265"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02726-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}