Dynamic reencryption of return addresses

  • Lee, Hyungyu
  • Pyo, Changwoo
  • Lee, Gyungho
Citations

WEB OF SCIENCE

1
Citations

SCOPUS

1

초록

The authors present dynamic reencryption of return addresses to mitigate their leakage. The authors' method enforces programs to save return addresses as encrypted and renew the encryption states with fresh keys before or after vulnerable operations. When a function returns, it should restore the return address from its encryption using the most recent key not to cause a crash. Under the protection of their method, return addresses and keys may leak, but the disclosed bits become garbage because keys govern all return addresses through encryption, while changing before control-flow proceeds into a vulnerable region. As a result, it becomes probabilistically infeasible to build exploits for intercepting control-flow by using leaked return addresses or keys. They implemented the proposed method as an extension of the LLVM compiler that inserts reencryption code where necessary. They also have confirmed its effectiveness against information leak attacks carried out in the early stage of blind return-oriented programming (BROP). The performance overhead ranges below 11.6% for processor-intensive programs and 4.12% or less for web servers.

키워드

cryptographydynamic reencryptionreturn addressfunction returnsleaked return addressesRANDOMIZATION
제목
Dynamic reencryption of return addresses
저자
Lee, HyungyuPyo, ChangwooLee, Gyungho
DOI
10.1049/iet-ifs.2018.5142
발행일
2019-01
유형
Article
저널명
IET Information Security
13
1
페이지
76 ~ 85