• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Sok: Eternal war in memory. (2013)

Cached

  • Download as a PDF

Download Links

  • [seclab.cs.sunysb.edu]
  • [seclab.cs.sunysb.edu]
  • [seclab.cs.sunysb.edu]
  • [nebelwelt.net]
  • [www.cs.berkeley.edu]
  • [bitblaze.cs.berkeley.edu]
  • [lenx.100871.net]
  • [www.cs.berkeley.edu]
  • [ieee-security.org]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by László Szekeres , Mathias Payer , Tao Wei , Dawn Song
Venue:In IEEE Symposium on Security and Privacy,
Citations:40 - 2 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Szekeres13sok:eternal,
    author = {László Szekeres and Mathias Payer and Tao Wei and Dawn Song},
    title = {Sok: Eternal war in memory.},
    booktitle = {In IEEE Symposium on Security and Privacy,},
    year = {2013}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Abstract-Memory corruption bugs in software written in low-level languages like C or C++ are one of the oldest problems in computer security. The lack of safety in these languages allows attackers to alter the program's behavior or take full control over it by hijacking its control flow. This problem has existed for more than 30 years and a vast number of potential solutions have been proposed, yet memory corruption attacks continue to pose a serious threat. Real world exploits show that all currently deployed protections can be defeated. This paper sheds light on the primary reasons for this by describing attacks that succeed on today's systems. We systematize the current knowledge about various protection techniques by setting up a general model for memory corruption attacks. Using this model we show what policies can stop which attacks. The model identifies weaknesses of currently deployed techniques, as well as other proposed protections enforcing stricter policies. We analyze the reasons why protection mechanisms implementing stricter polices are not deployed. To achieve wide adoption, protection mechanisms must support a multitude of features and must satisfy a host of requirements. Especially important is performance, as experience shows that only solutions whose overhead is in reasonable bounds get deployed. A comparison of different enforceable policies helps designers of new protection mechanisms in finding the balance between effectiveness (security) and efficiency. We identify some open research problems, and provide suggestions on improving the adoption of newer techniques.

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University