[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3297858.3304037acmconferencesArticle/Chapter ViewAbstractPublication PagesasplosConference Proceedingsconference-collections
research-article
Public Access

Morpheus: A Vulnerability-Tolerant Secure Architecture Based on Ensembles of Moving Target Defenses with Churn

Published: 04 April 2019 Publication History

Abstract

Attacks often succeed by abusing the gap between program and machine-level semantics-- for example, by locating a sensitive pointer, exploiting a bug to overwrite this sensitive data, and hijacking the victim program's execution. In this work, we take secure system design on the offensive by continuously obfuscating information that attackers need but normal programs do not use, such as representation of code and pointers or the exact location of code and data. Our secure hardware architecture, Morpheus, combines two powerful protections: ensembles of moving target defenses and churn. Ensembles of moving target defenses randomize key program values (e.g., relocating pointers and encrypting code and pointers) which forces attackers to extensively probe the system prior to an attack. To ensure attack probes fail, the architecture incorporates churn to transparently re-randomize program values underneath the running system. With frequent churn, systems quickly become impractically difficult to penetrate. We demonstrate Morpheus through a RISC-V-based prototype designed to stop control-flow attacks. Each moving target defense in Morpheus uses hardware support to individually offer more randomness at a lower cost than previous techniques. When ensembled with churn, Morpheus defenses offer strong protection against control-flow attacks, with our security testing and performance studies revealing: i) high-coverage protection for a broad array of control-flow attacks, including protections for advanced attacks and an attack disclosed after the design of Morpheus, and ii) negligible performance impacts (1%) with churn periods up to 50 ms, which our study estimates to be at least 5000x faster than the time necessary to possibly penetrate Morpheus.

References

[1]
Martín Abadi, Mihai Budiu, Úlfar Erlingsson, and Jay Ligatti. 2005. Control-flow Integrity. In Proceedings of the 12th ACM Conference on Computer and Communications Security (CCS '05). ACM, New York,NY, USA, 340--353.
[2]
Aleph One. 1996. Smashing the stack for fun and profit. Phrack Magazine. Retrieved April 6, 2018 from http://www.phrack.org/archives/49/P49--14
[3]
Andes Tech. 2017. Andes Technology GitHub - riscv-llvm. Retrieved August 2, 2018 from https://github.com/andestech/riscv-llvm
[4]
Apple Corporation. 2018. Undefined Behavior Sanitizer. Retrieved Au-gust 6, 2018 from https://developer.apple.com/documentation/code_diagnostics/undefined_behavior_sanitizer
[5]
Roberto Avanzi. 2017. The QARMA Block Cipher Family. Almost MDS Matrices Over Rings With Zero Divisors, Nearly Symmetric Even-Mansour Constructions With Non-Involutory Central Rounds, and Search Heuristics for Low-Latency S-Boxes. IACR Transactions on Symmetric Cryptology 2017, 1 (Mar. 2017), 4--44.
[6]
Elena Gabriela Barrantes, David H. Ackley, Stephanie Forrest, Trek S.Palmer, Darko Stefanovic, and Dino Dai Zovi. 2003. Randomized Instruction Set Emulation to Disrupt Binary Code Injection Attacks. In Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS '03). ACM, New York, NY, USA, 281--289.
[7]
Emery D. Berger and Benjamin G. Zorn. 2006. DieHard: Probabilistic Memory Safety for Unsafe Languages. In Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Designand Implementation (PLDI '06). ACM, New York, NY, USA, 158--168.
[8]
Sandeep Bhatkar and R. Sekar. 2008. Data Space Randomization. In Proceedings of the 5th International Conference on Detection of Intrusions and Malware, and Vulnerability Assessment (DIMVA '08). Springer-Verlag, Berlin, Heidelberg, 1--22.
[9]
David Bigelow, Thomas Hobson, Robert Rudd, William Streilein, and Hamed Okhravi. 2015. Timely Rerandomization for Mitigating Memory Disclosures. In Proceedings of the 22Nd ACM SIGSAC Conference on Computer and Communications Security (CCS '15). ACM, New York,NY, USA, 268--279.
[10]
Nathan Binkert, Bradford Beckmann, Gabriel Black, Steven K. Rein-hardt, Ali Saidi, Arkaprava Basu, Joel Hestness, Derek R. Hower, TusharKrishna, Somayeh Sardashti, Rathijit Sen, Korey Sewell, Muhammad Shoaib, Nilay Vaish, Mark D. Hill, and David A. Wood. 2011. TheGem5 Simulator. SIGARCH Comput. Archit. News 39, 2 (Aug. 2011), 1--7.
[11]
Andrea Bittau, Adam Belay, Ali Mashtizadeh, David Mazières, and Dan Boneh. 2014. Hacking Blind. In Proceedings of the 2014 IEEE Symposium on Security and Privacy (SP '14). IEEE Computer Society, Washington, DC, USA, 227--242.
[12]
blexim. 2002. Basic integer overflows. Phrack Magazine. Retrieved April 6, 2018 from http://phrack.org/issues/60/10.html
[13]
Erik Bosman, Kaveh Razavi, Herbert Bos, and Cristiano Giuffrida.2016. Dedup Est Machina: Memory Deduplication as an Advanced Exploitation Vector. In 2016 IEEE Symposium on Security and Privacy(SP). IEEE Computer Society, Washington, DC, USA, 987--1004.
[14]
Vince Bridgers. 2015. Real Time Linux Scheduling Comparison. In Embedded Linux Conference 2015 (ELC 15). The Linux Foundation,CA.http://events17.linuxfoundation.org/sites/events/files/slides/Real-Time-Linux-Comparison-Bridgers-ELC2015.pdf
[15]
Cristian Cadar, Periklis Akritidis, Manuel Costa, Jean-Philippe Martin,and Miguel Castro. 2008. Data Randomization. Technical Report. Microsoft Research, Redmond, WA, USA. 14 pages. https://www.microsoft.com/en-us/research/publication/data-randomization/MSR-TR-2008--120.
[16]
Miguel Castro, Manuel Costa, and Tim Harris. 2006. Securing Software by Enforcing Data-flow Integrity. In Proceedings of the 7th Symposium on Operating Systems Design and Implementation (OSDI '06). USENIX Association, Berkeley, CA, USA, 147--160. http://dl.acm.org/citation.cfm?id=1298455.1298470
[17]
Yue Chen, Zhi Wang, David Whalley, and Long Lu. 2016. Remix:On-Demand Live Randomization. In Proceedings of the Sixth ACM Conference on Data and Application Security and Privacy (CODASPY'16). ACM, New York, NY, USA, 50--61.
[18]
Crispin Cowan, Steve Beattie, John Johansen, and Perry Wagle. 2003.Pointguard TM: Protecting Pointers from Buffer Overflow Vulnerabilities. In Proceedings of the 12th conference on USENIX Security Symposium, Vol. 12. USENIX Association, Berkeley, CA, USA, 91--104.
[19]
Benjamin Cox, David Evans, Adrian Filipi, Jonathan Rowanhill, WeiHu, Jack Davidson, John Knight, Anh Nguyen-Tuong, and Jason Hiser.2006. N-variant Systems: A Secretless Framework for Security Through Diversity. In Proceedings of the 15th Conference on USENIX Security Symposium - Volume 15 (USENIX-SS'06). USENIX Association, Berkeley, CA, USA, Article 9.http://dl.acm.org/citation.cfm?id=1267336.1267344
[20]
John Criswell and Vikram Adve. 2010. Chaos for a Fast, Secure, and Predictable Future. InFun and Interesting Thoughts at the 31st ACMSIGPLAN Conference on Programming Language Design and Imple-mentation (FIT PLDI '10). 2. http://pldi10fit.blogspot.com/2010/05/chaos-for-fast-secure-and-predictable.html
[21]
CVEs by Type. 2018. CVE Details: Vulnerabilities By Type. Retrieved April 6, 2018 from https://www.cvedetails.com/vulnerabilities-by-types.php
[22]
CWE-122. 2018. CWE-122: Heap-based Buffer Overflow. Retrieved April 6, 2018 from https://cwe.mitre.org/data/definitions/122.html
[23]
Michael Dalton, Hari Kannan, and Christos Kozyrakis. 2007. Raksha:A Flexible Information Flow Architecture for Software Security. InProceedings of the 34th Annual International Symposium on ComputerArchitecture (ISCA '07). ACM, New York, NY, USA, 482--493.
[24]
Udit Dhawan, Catalin Hritcu, Raphael Rubin, Nikos Vasilakis, Silviu Chiricescu, Jonathan M. Smith, Thomas F. Knight, Jr., Benjamin C. Pierce, and Andre DeHon. 2015. Architectural Support for Software-Defined Metadata Processing. In Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS '15). ACM, New York, NY, USA, 487--502.
[25]
Draper Laboratory. 2018. Draper Laboratory GitHub - hope-RIPE. Retrieved April 6, 2018 from https://github.com/draperlaboratory/hope-RIPE
[26]
Gregory J. Duck and Roland H. C. Yap. 2016. Heap Bounds Protection with Low Fat Pointers. In Proceedings of the 25th International Conference on Compiler Construction (CC 2016). ACM, New York, NY, USA,132--142.
[27]
William Enck, Peter Gilbert, Seungyeop Han, Vasant Tendulkar, Byung-Gon Chun, Landon P. Cox, Jaeyeon Jung, Patrick McDaniel, and Anmol N. Sheth. 2014. TaintDroid: An Information-Flow Tracking System for Realtime Privacy Monitoring on Smartphones. ACM Trans. Comput. Syst. 32, 2, Article 5 (June 2014), 29 pages.
[28]
Dmitry Evtyushkin, Dmitry Ponomarev, and Nael Abu-Ghazaleh. 2016.Jump over ASLR: Attacking Branch Predictors to Bypass ASLR. In The 49th Annual IEEE/ACM International Symposium on Microarchitecture(MICRO-49). IEEE Press, Piscataway, NJ, USA, Article 40, 13 pages. http://dl.acm.org/citation.cfm?id=3195638.3195686
[29]
Robert Gawlik, Benjamin Kollenda, Philipp Koppe, Behrad Garmany,and Thorsten Holz. 2016. Enabling Client-Side Crash-Resistance to Overcome Diversification and Information Hiding. In Proceedings ofthe Network and Distributed System Security Symposium 2016 (NDSS'16). Internet Society, Reston, VA, USA.
[30]
Ben Gras, Kaveh Razavi, Erik Bosman, Herbert Bos, and Cristiano Giuffrida. 2017. ASLR on the Line: Practical Cache Attacks on the MMU. In Proceedings of the Network and Distributed System Security Symposium 2017 (NDSS '17). Internet Society, Reston, VA, USA.
[31]
Joseph L. Greathouse, Ilya Wagner, David A. Ramos, Gautam Bhat-nagar, Todd Austin, Valeria Bertacco, and Seth Pettie. 2008. Testudo:Heavyweight Security Analysis via Statistical Sampling. In Proceedings of the 41st Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 41). IEEE Computer Society, Washington, DC, USA, 117--128.
[32]
Matthew R. Guthaus, Jeffrey S. Ringenberg, Dan Ernst, Todd M. Austin, Trevor Mudge, and Richard B. Brown. 2001. MiBench: A Free, Commercially Representative Embedded Benchmark Suite. In Proceedings of the Workload Characterization, 2001. WWC-4. 2001 IEEE International Workshop (WWC '01). IEEE Computer Society, Washington, DC, USA,3--14.
[33]
John L. Henning. 2006. SPEC CPU2006 Benchmark Descriptions.SIGARCH Comput. Archit. News34, 4 (Sept. 2006), 1--17.
[34]
Hong Hu, Shweta Shinde, Sendroiu Adrian, Zheng Leong Chua, Pra-teek Saxena, and Zhenkai Liang. 2016. Data-Oriented Programming:On the Expressiveness of Non-control Data Attacks. In2016 IEEE Symposium on Security and Privacy (SP). IEEE Computer Society, Washing-ton, DC, USA, 969--986.
[35]
Wei Hu, Jason Hiser, Dan Williams, Adrian Filipi, Jack W. David-son, David Evans, John C. Knight, Anh Nguyen-Tuong, and Jonathan Rowanhill. 2006. Secure and Practical Defense Against Code-injection Attacks Using Software Dynamic Translation. In Proceedings of the2Nd International Conference on Virtual Execution Environments (VEE'06). ACM, New York, NY, USA, 2--12.
[36]
Yan Huang. 2016. Heap Overflows and Double-Free Attacks. Retrieved April 6, 2018 from http://homes.soic.indiana.edu/yh33/Teaching/I433--2016/lec13-HeapAttacks.pdf
[37]
Intel Corporation. 2017.Control-flow Enforcement Tech-nology Preview.Retrieved August 6, 2018 from https://software.intel.com/sites/default/files/managed/4d/2a/control-flow-enforcement-technology-preview.pdf
[38]
Sushil Jajodia, Anup K. Ghosh, Vipin Swarup, Cliff Wang, and X. SeanWang. 2011. Moving Target Defense: Creating Asymmetric Uncertainty for Cyber Threats(1st ed.). Springer-Verlag, New York, NY, USA.
[39]
Min Gyung Kang, Stephen McCamant, Pongsin Poosankam, and Dawn Song. 2011. DTA++: Dynamic Taint Analysis with Targeted Control-Flow Propagation. InProceedings of the Network and Distributed SystemSecurity Symposium 2011 (NDSS '11). Internet Society, Reston, VA, USA.
[40]
Gaurav S. Kc, Angelos D. Keromytis, and Vassilis Prevelakis. 2003.Countering Code-injection Attacks with Instruction-set Randomiza-tion. In Proceedings of the 10th ACM Conference on Computer and Com-munications Security (CCS '03). ACM, New York, NY, USA, 272--280.
[41]
Chongkyung Kil, Jinsuk Jun, Christopher Bookholt, Jun Xu, and Peng Ning. 2006. Address Space Layout Permutation (ASLP): Towards Fine-Grained Randomization of Commodity Software. In Proceedings of the 22Nd Annual Computer Security Applications Conference (ACSAC'06). IEEE Computer Society, Washington, DC, USA, 339--348.
[42]
Paul Kocher, Daniel Genkin, Daniel Gruss, Werner Haas, Mike Hamburg, Moritz Lipp, Stefan Mangard, Thomas Prescher, Michael Schwarz, and Yuval Yarom. 2018. Spectre Attacks: Exploiting Speculative Execution. CoRRabs/1801.01203 (2018). arXiv:1801.01203http://arxiv.org/abs/1801.01203
[43]
Volodymyr Kuznetsov, László Szekeres, Mathias Payer, George Candea,R. Sekar, and Dawn Song. 2014. Code-Pointer Integrity. In Proceedings of the 11th USENIX Conference on Operating Systems Design and Implementation (OSDI'14). USENIX Association, Berkeley, CA, USA, 147--163. https://www.usenix.org/conference/osdi14/technical-sessions/presentation/kuznetsov
[44]
Chris Lattner and Vikram Adve. 2004. LLVM: A Compilation Frame-work for Lifelong Program Analysis & Transformation. InProceedingsof the International Symposium on Code Generation and Optimization:Feedback-directed and Runtime Optimization (CGO '04). IEEE Computer Society, Washington, DC, USA, 75--86.
[45]
lowRISC. 2018. lowRISC Project.Retrieved April 5, 2018 fromhttp://www.lowrisc.org/
[46]
Kangjie Lu, Wenke Lee, Stefan Nürnberger, and Michael Backes. 2016. How to Make ASLR Win the Clone Wars: Runtime Re-Randomization. In Proceedings of the Network and Distributed System Security Symposium 2016 (NDSS '16). Internet Society, Reston, VA, USA.
[47]
Ali Jose Mashtizadeh, Andrea Bittau, Dan Boneh, and David Mazières. 2015. CCFI: Cryptographically Enforced Control Flow Integrity. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (CCS '15). ACM, New York, NY, USA, 941--951.
[48]
Frank McKeen, Ilya Alexandrovich, Alex Berenzon, Carlos V. Rozas,Hisham Shafi, Vedvyas Shanbhogue, and Uday R. Savagaonkar. 2013. Innovative Instructions and Software Model for Isolated Execution. In Proceedings of the 2nd International Workshop on Hardware and Architectural Support for Security and Privacy (HASP '13). ACM, NewYork, NY, USA, Article 10, 8 pages.
[49]
National Institute of Standards and Technology. 2018. National Vulnerability Database. Retrieved April 6, 2018 from https://nvd.nist.gov
[50]
James Newsome and Dawn Song. 2005. Dynamic Taint Analysis for Automatic Detection, Analysis, and Signature Generation of Exploitson Commodity Software. In Proceedings of the Network and DistributedSystem Security Symposium 2005 (NDSS '05). Internet Society, Reston,VA, USA.
[51]
Anh Nguyen-Tuong, David Evans, John C. Knight, Benjamin Cox, and Jack W. Davidson. 2008. Security through redundant data diversity. In 2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN). IEEE Press, Piscataway, NJ, USA, 187--196.
[52]
OWASP. 2015. Format string attack. Retrieved April 6, 2018 fromhttps://www.owasp.org/index.php/Format_string_attack
[53]
Antonis Papadogiannakis, Laertis Loutsis, Vassilis Papaefstathiou, and Sotiris Ioannidis. 2013. ASIST: Architectural Support for Instruction Set Randomization. In Proceedings of the 2013 ACM SIGSAC Conferenceon Computer & Communications Security (CCS '13). ACM, New York,NY, USA, 981--992.
[54]
PaX Team. 2003. PaX address space layout randomization (ASLR). Retrieved April 6, 2018 from http://pax.grsecurity.net/docs/aslr.txt
[55]
Mathias Payer. 2012.Too much PIE is bad for performance. Technical Report. ETH Zurich, Department of Computer Science, Zürich. Technical Reports D-INFK.
[56]
Colin Percival. 2005. Cache missing for fun and profit. In Proceedings of the Technical BSD Conference 2005 (BSDCan '05).
[57]
Jonathan Pincus and Brandon Baker. 2004. Beyond Stack Smashing:Recent Advances in Exploiting Buffer Overruns. IEEE Security & Privacy 2, 4 (July 2004), 20--27.
[58]
Qualcomm Product Security. 2017. Pointer Authentication on ARM v8.3:Design and Analysis of the New Software Security Instructions. Technical Report. Qualcomm Technologies, Inc., San Diego, CA, USA.
[59]
riq and gera. 2001. Advances in Format String Exploiting. PhrackMagazine. Retrieved April 6, 2018 from http://phrack.org/issues/59/7.html
[60]
RISC-V Foundation 2017.The RISC-V Instruction Set Manual, Volume I:User-Level ISA, Document Version 2.2. RISC-V Foundation, Berkeley, CA, USA. Editors Andrew Waterman and Krste Asanovic. May 2017.
[61]
Alec Roelke and Mircea R. Stan. 2017. RISC5: Implementing the RISC-V ISA in gem5. In Proceedings of Computer Architecture Research in RISC-V(14)(CARRV '17). 7.
[62]
Ryan Roemer, Erik Buchanan, Hovav Shacham, and Stefan Savage. 2012. Return-Oriented Programming: Systems, Languages, and Applications. ACM Trans. Inf. Syst. Secur. 15, 1, Article 2 (March 2012), 34 pages.
[63]
Paul Rosenfeld, Elliott Cooper-Balis, and Bruce Jacob. 2011. DRAM-Sim2: A Cycle Accurate Memory System Simulator. IEEE Comput. Archit. Lett.10, 1 (Jan. 2011), 16--19.
[64]
rv8. 2018. rv8.io GitHub - musl-riscv. Retrieved August 2, 2018 from https://github.com/rv8-io/musl-riscv
[65]
Fermin J. Serna. 2012. The info leak era on software exploitation. In Black Hat USA.
[66]
Hovav Shacham, Matthew Page, Ben Pfaff, Eu-Jin Goh, Nagendra Modadugu, and Dan Boneh. 2004. On the Effectiveness of Address-space Randomization. In Proceedings of the 11th ACM Conference on Computer and Communications Security (CCS '04). ACM, New York, NY, USA, 298--307.
[67]
Gennadiy Shvets. 2018. Enhanced Virus Protection / Execute Disable Bit. Retrieved January 24, 2019 from http://www.cpu-world.com/Glossary/E/EVP_XD.html
[68]
Kanad Sinha, Vasileios P. Kemerlis, and Simha Sethumadhavan. 2017. Reviving instruction set randomization. In 2017 IEEE InternationalSymposium on Hardware Oriented Security and Trust (HOST). IEEE Press, Piscataway, NJ, USA, 21--28.
[69]
Kevin Z. Snow, Fabian Monrose, Lucas Davi, Alexandra Dmitrienko, Christopher Liebchen, and Ahmad-Reza Sadeghi. 2013. Just-In-Time Code Reuse: On the Effectiveness of Fine-Grained Address Space Lay-out Randomization. In Proceedings of the 2013 IEEE Symposium on Security and Privacy (SP '13). IEEE Computer Society, Washington, DC, USA, 574--588.
[70]
Solar Designer. 1997. lpr LIBC RETURN exploit. Retrieved April 6,2018 from http://insecure.org/sploits/linux.libc.return.lpr.sploit.html
[71]
G. Edward Suh, Jae W. Lee, David Zhang, and Srinivas Devadas. 2004. Secure Program Execution via Dynamic Information Flow Tracking. In Proceedings of the 11th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XI). ACM, New York, NY, USA, 85--96.
[72]
Gregory T. Sullivan, André DeHon, Steven Milburn, Eli Boling, MarcoCiaffi, Jothy Rosenberg, and Andrew Sutherland. 2017. The Dover inherently secure processor. In 2017 IEEE International Symposium on Technologies for Homeland Security (HST). IEEE Press, Piscataway, NJ, USA, 1--5.
[73]
Laszlo Szekeres, Mathias Payer, Tao Wei, and Dawn Song. 2013. SoK:Eternal War in Memory. In Proceedings of the 2013 IEEE Symposiumon Security and Privacy (SP '13). IEEE Computer Society, Washington, DC, USA, 48--62.
[74]
David Lie Chandramohan Thekkath, Mark Mitchell, Patrick Lincoln, Dan Boneh, John Mitchell, and Mark Horowitz. 2000. Architectural Support for Copy and Tamper Resistant Software. In Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS IX). ACM, New York, NY, USA, 168--177.
[75]
Michael Theodorides and David Wagner. 2017. Breaking Active-Set Backward-Edge CFI. In 2017 IEEE International Symposium on Hardware Oriented Security and Trust (HOST). IEEE Press, Piscataway, NJ, USA, 85--89.
[76]
Mohit Tiwari, Shashidhar Mysore, and Timothy Sherwood. 2009. Quantifying the Potential of Program Analysis Peripherals. In Proceedings of the 2009 18th International Conference on Parallel Architectures and Compilation Techniques (PACT '09). IEEE Computer Society, Washington, DC, USA, 53--63.
[77]
Nathan Tuck, Brad Calder, and George Varghese. 2004. Hardware andBinary Modification Support for Code Pointer Protection From Buffer Overflow. In Proceedings of the 37th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 37). IEEE Computer Society,Washington, DC, USA, 209--220.
[78]
Aditya Venkataraman and Kishore Kumar Jagadeesha. 2015.Evaluation of Inter-Process Communication Mechanisms. Technical Report. University of Wisconsin-Madison, Madison, WI, USA.
[79]
David Wagner and Paolo Soto. 2002. Mimicry Attacks on Host-basedIntrusion Detection Systems. InProceedings of the 9th ACM Conferenceon Computer and Communications Security (CCS '02). ACM, New York, NY, USA, 255--264.
[80]
Xi Wang, Haogang Chen, Alvin Cheung, Zhihao Jia, Nickolai Zeldovich, and M. Frans Kaashoek. 2012. Undefined Behavior: What Happened to My Code?. In Proceedings of the Asia-Pacific Workshopon Systems (APSYS '12). ACM, New York, NY, USA, Article 9, 7 pages.
[81]
Xi Wang, Nickolai Zeldovich, M. Frans Kaashoek, and Armando Solar-Lezama. 2013. Towards Optimization-safe Systems: Analyzing the Impact of Undefined Behavior. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles (SOSP '13). ACM, New York, NY, USA, 260--275.
[82]
John Wilander, Nick Nikiforakis, Yves Younan, Mariam Kamkar, and Wouter Joosen. 2011. RIPE: Runtime Intrusion Prevention Evaluator. In Proceedings of the 27th Annual Computer Security Applications Conference (ACSAC '11). ACM, New York, NY, USA, 41--50.
[83]
David Williams-King, Graham Gobieski, Kent Williams-King, James P.Blake, Xinhao Yuan, Patrick Colp, Michelle Zheng, Vasileios P. Ke-merlis, Junfeng Yang, and William Aiello. 2016. Shuffler: Fast and Deployable Continuous Code Re-Randomization. In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI16). USENIX Association, GA, 367--382. https://www.usenix.org/conference/osdi16/technical-sessions/presentation/williams-king
[84]
Jonathan Woodruff, Robert N.M. Watson, David Chisnall, Simon W. Moore, Jonathan Anderson, Brooks Davis, Ben Laurie, Peter G. Neu-mann, Robert Norton, and Michael Roe. 2014. The CHERI Capability Model: Revisiting RISC in an Age of Risk. In Proceeding ofthe 41st Annual International Symposium on Computer Architecuture (ISCA '14). IEEE Press, Piscataway, NJ, USA, 457--468. http://dl.acm.org/citation.cfm?id=2665671.2665740
[85]
James Yonan. 2010. OpenVPN 2.0.x man pages.Re-trieved April 6, 2018 from https://openvpn.net/index.php/open-source/documentation/manuals/65-openvpn-20x-manpage.html

Cited By

View all
  • (2024)ROLoad-PMP: Securing Sensitive Operations for Kernels and Bare-Metal FirmwareIEEE Transactions on Computers10.1109/TC.2024.344910573:12(2722-2733)Online publication date: Dec-2024
  • (2024)A Parallel Tag Cache for Hardware Managed Tagged Memory in Multicore ProcessorsIEEE Transactions on Computers10.1109/TC.2024.344183573:11(2488-2503)Online publication date: Nov-2024
  • (2024)Maya: Hardware Enhanced Customizable Defenses at the User-Kernel Interface2024 International Symposium on Secure and Private Execution Environment Design (SEED)10.1109/SEED61283.2024.00016(50-61)Online publication date: 16-May-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ASPLOS '19: Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems
April 2019
1126 pages
ISBN:9781450362405
DOI:10.1145/3297858
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 April 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. moving target defense
  2. runtime randomization

Qualifiers

  • Research-article

Funding Sources

Conference

ASPLOS '19

Acceptance Rates

ASPLOS '19 Paper Acceptance Rate 74 of 351 submissions, 21%;
Overall Acceptance Rate 535 of 2,713 submissions, 20%

Upcoming Conference

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)519
  • Downloads (Last 6 weeks)60
Reflects downloads up to 30 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)ROLoad-PMP: Securing Sensitive Operations for Kernels and Bare-Metal FirmwareIEEE Transactions on Computers10.1109/TC.2024.344910573:12(2722-2733)Online publication date: Dec-2024
  • (2024)A Parallel Tag Cache for Hardware Managed Tagged Memory in Multicore ProcessorsIEEE Transactions on Computers10.1109/TC.2024.344183573:11(2488-2503)Online publication date: Nov-2024
  • (2024)Maya: Hardware Enhanced Customizable Defenses at the User-Kernel Interface2024 International Symposium on Secure and Private Execution Environment Design (SEED)10.1109/SEED61283.2024.00016(50-61)Online publication date: 16-May-2024
  • (2024)Deep Learning Models as Moving Targets to Counter Modulation Classification AttacksIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621413(1601-1610)Online publication date: 20-May-2024
  • (2024)Special Session: Detecting and Defending Vulnerabilities in Heterogeneous and Monolithic Systems: Current Strategies and Future Directions2024 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES)10.1109/CASES60062.2024.00007(5-14)Online publication date: 29-Sep-2024
  • (2023)A Survey on Thwarting Memory Corruption in RISC-VACM Computing Surveys10.1145/360490656:2(1-29)Online publication date: 17-Jun-2023
  • (2023)VLSI Design and Test View of Computer Security2023 International VLSI Symposium on Technology, Systems and Applications (VLSI-TSA/VLSI-DAT)10.1109/VLSI-TSA/VLSI-DAT57221.2023.10134130(1-4)Online publication date: 17-Apr-2023
  • (2023)Mayalok: A Cyber-Deception Hardware Using Runtime Instruction Infusion2023 IEEE 34th International Conference on Application-specific Systems, Architectures and Processors (ASAP)10.1109/ASAP57973.2023.00019(33-40)Online publication date: Jul-2023
  • (2022)Randezvous: Making Randomization Effective on MCUsProceedings of the 38th Annual Computer Security Applications Conference10.1145/3564625.3567970(28-41)Online publication date: 5-Dec-2022
  • (2022)Adelie: continuous address space layout re-randomization for Linux driversProceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3503222.3507779(483-498)Online publication date: 28-Feb-2022
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media