Performance optimizations of integrity checking based on merkle trees

Salaheddine Ouaarab; Guillaume Duc; Renaud Pacalet

doi:10.1145/2768566.2768576

Performance optimizations of integrity checking based on merkle trees

Salaheddine Ouaarab, Guillaume Duc, Renaud Pacalet

CNRS LTCI

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	Hardware and Architectural Support for Security and Privacy, HASP 2015
Publisher	Association for Computing Machinery
ISBN (Electronic)	9781450334839
DOIs	https://doi.org/10.1145/2768566.2768576
Publication status	Published - 14 Jun 2015
Externally published	Yes
Event	4th International Workshop on Hardware and Architectural Support for Security and Privacy, HASP 2015 - Portland, United States Duration: 14 Jun 2015 → …

Publication series

Name	ACM International Conference Proceeding Series
Volume	14-June-2015

Conference

Conference	4th International Workshop on Hardware and Architectural Support for Security and Privacy, HASP 2015
Country/Territory	United States
City	Portland
Period	14/06/15 → …

Access to Document

10.1145/2768566.2768576

Cite this

@inproceedings{96287579f8cb4bbc8c072c2274ef3b1c,

title = "Performance optimizations of integrity checking based on merkle trees",

abstract = "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.",

author = "Salaheddine Ouaarab and Guillaume Duc and Renaud Pacalet",

note = "Publisher Copyright: {\textcopyright} 2015 ACM.; 4th International Workshop on Hardware and Architectural Support for Security and Privacy, HASP 2015 ; Conference date: 14-06-2015",

year = "2015",

month = jun,

day = "14",

doi = "10.1145/2768566.2768576",

language = "English",

series = "ACM International Conference Proceeding Series",

publisher = "Association for Computing Machinery",

booktitle = "Hardware and Architectural Support for Security and Privacy, HASP 2015",

}

Ouaarab, S, Duc, G & Pacalet, R 2015, Performance optimizations of integrity checking based on merkle trees. in Hardware and Architectural Support for Security and Privacy, HASP 2015., a10, ACM International Conference Proceeding Series, vol. 14-June-2015, Association for Computing Machinery, 4th International Workshop on Hardware and Architectural Support for Security and Privacy, HASP 2015, Portland, United States, 14/06/15. https://doi.org/10.1145/2768566.2768576

Performance optimizations of integrity checking based on merkle trees. / Ouaarab, Salaheddine; Duc, Guillaume ; Pacalet, Renaud.
Hardware and Architectural Support for Security and Privacy, HASP 2015. Association for Computing Machinery, 2015. a10 (ACM International Conference Proceeding Series; Vol. 14-June-2015).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Performance optimizations of integrity checking based on merkle trees

AU - Ouaarab, Salaheddine

AU - Duc, Guillaume

AU - Pacalet, Renaud

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.

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 -

Performance optimizations of integrity checking based on merkle trees

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this