TEC-tree: A low-cost, parallelizable tree for efficient defense against memory replay attacks

Reouven Elbaz, David Champagne, Ruby B. Lee, Lionel Torres, Gilles Sassatelli, Pierre Guillemin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

29 Scopus citations

Abstract

Replay attacks are often the most costly attacks to thwart when dealing with off-chip memory integrity. With a trusted System-on-Chip, the existing countermeasures against replay require a large amount of on-chip memory to provide tamper-proof storage for metadata such as hash values or nonces. Tree-based strategies can be deployed to reduce this unacceptable overhead; for example, the well-known Merkle tree technique decreases this overhead to a single hash value. However, it comes at the cost of performance-killing characteristics for embedded systems - e.g. non-parallelizable hash computations on tree updates. In this paper, we propose an alternative solution: the Tamper-Evident Counter Tree (TEC-Tree). It allows for tamper-evident offchip storage of the nonces involved in a replay countermeasure; TEC-Tree parallelizes the computations involved in both the authentication and tree update processes. Moreover, because our tree relies on block encryption, it provides data confidentiality at no extra cost. TEC-Tree is a deployable solution for memory integrity, with low performance hit and hardware cost.

Original languageEnglish (US)
Title of host publicationCryptographic Hardware and Embedded Systems - CHES 2007 - 9th International Workshop, Proceedings
PublisherSpringer Verlag
Pages289-302
Number of pages14
ISBN (Print)9783540747345
DOIs
StatePublished - 2007
Event9th International Workshop on Cryptographic Hardware and Embedded Systems, CHES 2007 - Vienna, Austria
Duration: Sep 10 2007Sep 13 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4727 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th International Workshop on Cryptographic Hardware and Embedded Systems, CHES 2007
CountryAustria
CityVienna
Period9/10/079/13/07

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Keywords

  • Confidentiality
  • Memory integrity
  • Merkle trees
  • Parallelizability
  • Physical attacks
  • Replay attacks
  • Tamper evidence

Fingerprint Dive into the research topics of 'TEC-tree: A low-cost, parallelizable tree for efficient defense against memory replay attacks'. Together they form a unique fingerprint.

  • Cite this

    Elbaz, R., Champagne, D., Lee, R. B., Torres, L., Sassatelli, G., & Guillemin, P. (2007). TEC-tree: A low-cost, parallelizable tree for efficient defense against memory replay attacks. In Cryptographic Hardware and Embedded Systems - CHES 2007 - 9th International Workshop, Proceedings (pp. 289-302). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4727 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-74735-2_20