Abstract
We describe a novel software verification primitive called Oblivious Hashing. Unlike previous techniques that mainly verify the static shape of code, this primitive allows implicit computation of a hash value based on the actual execution (i.e., space-time history of computation) of the code. We also discuss its applications in local software tamper resistance and remote code authentication. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Chen, Y., Venkatesan, R., Cary, M., Pang, R., Sinha, S., & Jakubowski, M. H. (2003). Oblivious hashing: A stealthy software integrity verification primitive. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2578, 400–414. https://doi.org/10.1007/3-540-36415-3_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
