{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:45Z","timestamp":1763467725972,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"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":["SIGARCH Comput. Archit. News"],"published-print":{"date-parts":[[2005,3]]},"abstract":"<jats:p>System security as it is practiced today is a losing battle. In this paper, we outline a possible comprehensive solution for binary-based attacks, using virtual machines, machine descriptions, and randomization to achieve broad heterogeneity at the machine level. This heterogeneity increases the \"cost\" of broad-based binary attacks to a sufficiently high level that they cease to become feasible. The convergence of several recent technologies appears to make our approach achievable at a reasonable cost, with only moderate run-time overhead.<\/jats:p>","DOI":"10.1145\/1055626.1055632","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T19:28:32Z","timestamp":1131391712000},"page":"34-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["An architecture a day keeps the hacker away"],"prefix":"10.1145","volume":"33","author":[{"given":"David A.","family":"Holland","sequence":"first","affiliation":[{"name":"Harvard University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ada T.","family":"Lim","sequence":"additional","affiliation":[{"name":"Harvard University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Margo I.","family":"Seltzer","sequence":"additional","affiliation":[{"name":"Harvard University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199517"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945462"},{"key":"e_1_2_1_3_1","first-page":"105","volume-title":"Proceedings of the 12th USENIX Security Symposium","author":"Bhatkar S.","year":"2003","unstructured":"S. Bhatkar , D. C. DuVarney , and R. Sekar . Address obfuscation: An efficient approach to combat a broad range of memory error exploits . In Proceedings of the 12th USENIX Security Symposium , pages 105 -- 120 , Washington, DC , August 2003 . S. Bhatkar, D. C. DuVarney, and R. Sekar. Address obfuscation: An efficient approach to combat a broad range of memory error exploits. In Proceedings of the 12th USENIX Security Symposium, pages 105--120, Washington, DC, August 2003."},{"key":"e_1_2_1_4_1","first-page":"91","volume-title":"Proceedings of the 12th USENIX Security Symposium","author":"Cowan C.","year":"2003","unstructured":"C. Cowan , S. Beattie , J. Johansen , and P. Wagle . Pointguard#8482;: Protecting pointers from buffer overflow vulnerabilities . In Proceedings of the 12th USENIX Security Symposium , pages 91 -- 104 , Washington, DC , August 2003 . C. Cowan, S. Beattie, J. Johansen, and P. Wagle. Pointguard#8482;: Protecting pointers from buffer overflow vulnerabilities. In Proceedings of the 12th USENIX Security Symposium, pages 91--104, Washington, DC, August 2003."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 7th USENIX Security Symposium","author":"Cowan C.","year":"1998","unstructured":"C. Cowan , C. Pu , D. Maier , H. Hinton , P. Bakke , S. Beattie , A. Grier , P. Wagle , and Q. Zhang . Automatic detection and prevention of buffer-overflow attacks . In Proceedings of the 7th USENIX Security Symposium , January 1998 . C. Cowan, C. Pu, D. Maier, H. Hinton, P. Bakke, S. Beattie, A. Grier, P. Wagle, and Q. Zhang. Automatic detection and prevention of buffer-overflow attacks. In Proceedings of the 7th USENIX Security Symposium, January 1998."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/822075.822408"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945464"},{"key":"e_1_2_1_8_1","volume-title":"Cyber insecurity: The cost of monopoly. Technical report","author":"Geer D.","year":"2003","unstructured":"D. Geer , R. Bace , P. Gutmann , P. Metzger , C. Pfleeger , J. Quarterman , and B. Schneier . Cyber insecurity: The cost of monopoly. Technical report , Computer & Communications Industry Association , 2003 . D. Geer, R. Bace, P. Gutmann, P. Metzger, C. Pfleeger, J. Quarterman, and B. Schneier. Cyber insecurity: The cost of monopoly. Technical report, Computer & Communications Industry Association, 2003."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948146"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/647253.720293"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646905.710481"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 1989 Winter USENIX Conference","author":"Seeley D.","year":"1989","unstructured":"D. Seeley . A tour of the worm . In Proceedings of the 1989 Winter USENIX Conference , January 1989 . D. Seeley. A tour of the worm. In Proceedings of the 1989 Winter USENIX Conference, January 1989."},{"key":"e_1_2_1_13_1","first-page":"2004","volume":"9","author":"Seifried K.","year":"2002","unstructured":"K. Seifried . Honeypotting with vmware - basics , 2002 . Online. Internet . March 9 , 2004 . Available WWW: http:\/\/www.seifried.org\/security\/ids\/20020107-honeypot-vmware-basics.html. K. Seifried. Honeypotting with vmware - basics, 2002. Online. Internet. March 9, 2004. Available WWW: http:\/\/www.seifried.org\/security\/ids\/20020107-honeypot-vmware-basics.html.","journal-title":"Online. Internet"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 22nd Symposium on Reliable and Distributed Systems","author":"Xu J.","year":"2003","unstructured":"J. Xu , Z. Kalbarczyk , and R. K. Iyer . Transparent runtime randomization for security . In Proceedings of the 22nd Symposium on Reliable and Distributed Systems , Florence, Italy , October 2003 . J. Xu, Z. Kalbarczyk, and R. K. Iyer. Transparent runtime randomization for security. In Proceedings of the 22nd Symposium on Reliable and Distributed Systems, Florence, Italy, October 2003."}],"container-title":["ACM SIGARCH Computer Architecture News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1055626.1055632","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1055626.1055632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:27Z","timestamp":1750264287000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1055626.1055632"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["10.1145\/1055626.1055632"],"URL":"https:\/\/doi.org\/10.1145\/1055626.1055632","relation":{},"ISSN":["0163-5964"],"issn-type":[{"type":"print","value":"0163-5964"}],"subject":[],"published":{"date-parts":[[2005,3]]},"assertion":[{"value":"2005-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}