TY - GEN
T1 - Performance optimizations of integrity checking based on merkle trees
AU - Ouaarab, Salaheddine
AU - Duc, Guillaume
AU - Pacalet, Renaud
N1 - Publisher Copyright:
© 2015 ACM.
PY - 2015/6/14
Y1 - 2015/6/14
N2 - Merkle hash trees are used to protect the integrity of data sets, against all kinds of attacks, including replay. They usually imply a significant storage and performance overhead. This paper introduces several proposals (hollow trees, dedicated caches) to mitigate these overheads. They have been implemented in SecBus, a software / hardware architecture protecting the external memories of a System-on-Chip.
AB - Merkle hash trees are used to protect the integrity of data sets, against all kinds of attacks, including replay. They usually imply a significant storage and performance overhead. This paper introduces several proposals (hollow trees, dedicated caches) to mitigate these overheads. They have been implemented in SecBus, a software / hardware architecture protecting the external memories of a System-on-Chip.
UR - https://www.scopus.com/pages/publications/84962593590
U2 - 10.1145/2768566.2768576
DO - 10.1145/2768566.2768576
M3 - Conference contribution
AN - SCOPUS:84962593590
T3 - ACM International Conference Proceeding Series
BT - Hardware and Architectural Support for Security and Privacy, HASP 2015
PB - Association for Computing Machinery
T2 - 4th International Workshop on Hardware and Architectural Support for Security and Privacy, HASP 2015
Y2 - 14 June 2015
ER -