Integrity Verification of Applications on RADIUM Architecture Page: 33
vii, 44 pages : color illustrationsView a full description of this thesis.
Extracted Text
The following text was automatically extracted from the image on this page using optical character recognition software:
measurement values are encrypted with one-way hash function and are extended to PCR
8. (PCRs are numbered from 0-15)" [16]. In the dynamic attestation protocol, challenger
sends the request along with a nonce. "The attestation service responds with a two-part
message; the first one is current integrity evidence and the send one is TPM signature and
nonce received from the requester. Nonce is protection against reply attacks while hashed
value protects against duplication" [20].
The main shortcoming of ReDAS is that it uses a static chain of trust at the time
of boot. Then, the kernel or integrity verification module can be compromised at runtime.
RADIUM, which is a dynamic attestation platform, overcomes this shortcoming. The ma-
chine no longer needs to be restarted every time an attestation is performed. ReDAS also
inherits limitations of Daikon. For example, it cannot infer useful invariants for complex
structures like linked lists. Therefore, ReDAS cannot detect violations that are not covered
by the defined set of invariants. Some violations may be missed due to the transient nature
of applications (i.e. violations may erase the trace before they are captured).
4.2. Automatic Security Debugging Using Program Structural Constraints
Understanding and detecting security bugs in an application is a cumbersome process,
as it needs manual tracing of the runtime behavior of applications. Manual debugging is not
a good solution for detecting unknown vulnerabilities. Oftentimes the attacks last for very
short lengths of time, which makes detection difficult. Program structural constraints make
the debugging process more efficient. These constraints can be observed during the runtime
of an application to find vulnerabilities. The authors used "static analysis methods to deter-
mine structural constraints and dynamic monitoring component to verify if the constraint is
satisfied or not" [21]. The tool is called CBones.
On a Linux platform, an application's ELF [12] has a memory structure as follows:
Code, Data, Heap, DSO, Stack, and Kernel (Figure 2.2). Of all these segments, stack,
heap, and data are considered the most important areas in which to look for clues of correct
execution. Therefore, the structural constraints are defined for these segments. Some of the
constraints the authors have defined are: caller-callee constraint, return address constraint,33
Upcoming Pages
Here’s what’s next.
Search Inside
This thesis can be searched. Note: Results may vary based on the legibility of text within the document.
Tools / Downloads
Get a copy of this page or view the extracted text.
Citing and Sharing
Basic information for referencing this web page. We also provide extended guidance on usage rights, references, copying or embedding.
Reference the current page of this Thesis.
Tarigopula, Mohan Krishna. Integrity Verification of Applications on RADIUM Architecture, thesis, August 2015; Denton, Texas. (https://digital.library.unt.edu/ark:/67531/metadc804915/m1/41/: accessed July 17, 2024), University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu; .