Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp01kd17cw359
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Malik, Sharad | - |
dc.contributor.author | Subramanyan, Pramod | - |
dc.contributor.other | Electrical Engineering Department | - |
dc.date.accessioned | 2017-04-12T20:36:10Z | - |
dc.date.available | 2017-04-12T20:36:10Z | - |
dc.date.issued | 2017 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp01kd17cw359 | - |
dc.description.abstract | Today's computing devices store and process an enormous amount of security-critical assets. These assets are a lucrative target for cybercriminals and protecting them from malicious actors remains a key challenge in computer security. Hardware is especially important in this context: security protections implemented in software may be invalidated by faulty hardware. Ensuring hardware remains secure is becoming difficult. Deverticalization and globalization of the semiconductor industry have led to the separation of integrated circuit (IC) design houses from foundries and rendered ICs vulnerable to the threat of malicious design changes, i.e., hardware trojans. The emergence of systems-on-chip (SoC) designs, which comprise multiple programmable cores, firmware and application-specific accelerators, poses new verification challenges. In particular, verifying that SoC security requirements are met is challenging due to the need for co-verification of firmware and hardware. This thesis first tackles the problem of algorithmic reverse engineering of digital circuits which can help analysts detect hardware trojans. We present a comprehensive portfolio of algorithms which analyze a flat unstructured netlist and output a high-level netlist with components such as register files, counters, adders and subtracters. Our techniques are fully-automated and scalable to designs with hundreds of thousands of gates. Next, we present a methodology for system-level security verification of SoCs. The methodology is based on the construction of instruction-level abstractions (ILA). The ILA raises the level of abstraction of hardware modules to be similar to that of instructions in programmable processors. It can be used instead of the cycle-accurate and bit-precise hardware description for scalable co-verification of system-level security properties in SoCs. We introduce techniques to semi-automatically synthesize the ILA and show how it can be proven to be a correct abstraction of the underlying hardware. We then show how the ILA is used for security verification by designing a specification language and verification algorithm for information-flow properties. In summary, this thesis presents a set of techniques to address security challenges in modern SoCs. In particular, it provides a methodology for verifying security of SoCs where security properties hold for the complete system, not just individual components such as the hardware or firmware alone. | - |
dc.language.iso | en | - |
dc.publisher | Princeton, NJ : Princeton University | - |
dc.relation.isformatof | The Mudd Manuscript Library retains one bound copy of each dissertation. Search for these copies in the library's main catalog: <a href=http://catalog.princeton.edu> catalog.princeton.edu </a> | - |
dc.subject | abstraction | - |
dc.subject | formal | - |
dc.subject | hardware | - |
dc.subject | security | - |
dc.subject | system-on-chip | - |
dc.subject | verification | - |
dc.subject.classification | Computer engineering | - |
dc.subject.classification | Computer science | - |
dc.subject.classification | Electrical engineering | - |
dc.title | Deriving Abstractions to Address Hardware Platform Security Challenges | - |
dc.type | Academic dissertations (Ph.D.) | - |
pu.projectgrantnumber | 690-2143 | - |
Appears in Collections: | Electrical Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Subramanyan_princeton_0181D_12023.pdf | 1.4 MB | Adobe PDF | View/Download |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.