Indirect Branch Validation Unit
- Authors
- Lee, Gyungho; Shi, Yixin; Lin, Hui
- Issue Date
- 10월-2009
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- Control data; Indirect branch; Branch prediction; Software attack
- Citation
- MICROPROCESSORS AND MICROSYSTEMS, v.33, no.7-8, pp.461 - 468
- Indexed
- SCIE
SCOPUS
- Journal Title
- MICROPROCESSORS AND MICROSYSTEMS
- Volume
- 33
- Number
- 7-8
- Start Page
- 461
- End Page
- 468
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/119238
- DOI
- 10.1016/j.micpro.2009.09.002
- ISSN
- 0141-9331
- Abstract
- This paper presents a micro-architectural enhancement, named Indirect Branch Validation Unit (IBVU), to prevent malicious attacks from compromising the control data of the program. The IBVU provides a run-time control flow protection by validating a dynamic instance of an indirect branch's address and its target address - indirect branch pair (IBP), which represents the program behavior. To validate an IBP at run-time with little performance and storage overhead, the IBVU employs a Bloom filter, a hashing based bit vector representation for querying a set membership. Two organizations trading off of the access delay and space in VLSI design are provided, and three commonly used hashing schemes are evaluated for the performance impact as well as the area overhead. Recognizing potential false positives from adopting the Bloom filter, consideration of reducing it per the Bloom filter's design parameters is discussed, while the difficulty of utilizing the false positives due to hashing based indexing of the Bloom filter for malicious attack is noted. (C) 2009 Elsevier B.V. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Informatics > Department of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.