TY - GEN
T1 - Towards constant bandwidth overhead integrity checking of untrusted data
AU - Clarke, D.
AU - Suh, G.E.
AU - Gassend, B.
AU - Sudan, A.
AU - Van Dijk, M.
AU - Devadas, S.
PY - 2005
Y1 - 2005
N2 - We present an adaptive tree-log scheme to improve the performance of checking the integrity of arbitrarily-large untrusted data, when using only a small fixed-sited trusted state. Currently, hash trees are used to check the data. In many systems that use hash trees, programs perform many data operations before performing a critical operation that exports a result outside of the program's execution environment. The adaptive tree-log scheme we present uses this observation to harness the power of the constant runtime bandwidth overhead of a log-based scheme. For all programs, the adaptive tree-log scheme's bandwidth overhead is guaranteed to never be worse than a parameterizable worst case bound. Furthermore, for all programs, as the average number of times the program accesses data between critical operations increases, the adaptive tree-log scheme's bandwidth overhead moves from a logarithmic to a constant bandwidth overhead. © 2005 IEEE.
AB - We present an adaptive tree-log scheme to improve the performance of checking the integrity of arbitrarily-large untrusted data, when using only a small fixed-sited trusted state. Currently, hash trees are used to check the data. In many systems that use hash trees, programs perform many data operations before performing a critical operation that exports a result outside of the program's execution environment. The adaptive tree-log scheme we present uses this observation to harness the power of the constant runtime bandwidth overhead of a log-based scheme. For all programs, the adaptive tree-log scheme's bandwidth overhead is guaranteed to never be worse than a parameterizable worst case bound. Furthermore, for all programs, as the average number of times the program accesses data between critical operations increases, the adaptive tree-log scheme's bandwidth overhead moves from a logarithmic to a constant bandwidth overhead. © 2005 IEEE.
UR - http://www.scopus.com/inward/record.url?scp=27544456041&partnerID=8YFLogxK
U2 - 10.1109/SP.2005.24
DO - 10.1109/SP.2005.24
M3 - Conference contribution
T3 - Proceedings - IEEE Symposium on Security and Privacy
SP - 139
EP - 153
BT - Proceedings - 2005 IEEE Symposium on Security and Privacy, IEEE S and P 2005
T2 - 2005 IEEE Symposium on Security and Privacy, IEEE S and P 2005
Y2 - 8 May 2005 through 11 May 2005
ER -