The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

eavesROP: Listening for ROP Payloads in Data Streams

Author

Editor

  • Sherman S. M. Chow
  • Jan Camenisch
  • Lucas C. K. Hui
  • Siu Ming Yiu

Summary, in English

We consider the problem of detecting exploits based on

return-oriented programming. In contrast to previous works we investigate

to which extent we can detect ROP payloads by only analysing

streaming data, i.e., we do not assume any modifications to the target

machine, its kernel or its libraries. Neither do we attempt to execute any

potentially malicious code in order to determine if it is an attack. While

such a scenario has its limitations, we show that using a layered approach

with a filtering mechanism together with the Fast Fourier Transform, it

is possible to detect ROP payloads even in the presence of noise and

assuming that the target system employs ASLR. Our approach, denoted

eavesROP, thus provides a very lightweight and easily deployable mitigation

against certain ROP attacks. It also provides the added merit

of detecting the presence of a brute-force attack on ASLR since library

base addresses are not assumed to be known by eavesROP.

Publishing year

2014

Language

English

Pages

413-424

Publication/Series

Lecture Notes in Computer Science

Volume

8783

Document type

Conference paper

Publisher

Springer

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering
  • Computer Science

Keywords

  • Return-Oriented Programming
  • ROP
  • Pattern Matching
  • ASLR

Conference name

ISC 2014

Conference date

2014-10-12 - 2014-10-14

Status

Published

Research group

  • Crypto and Security

ISBN/ISSN/Other

  • ISSN: 0302-9743
  • ISBN: 978-3-319-13257-0
  • ISBN: 978-3-319-13256-3