International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: TEC-Tree: A Low-Cost, Parallelizable Tree for Efficient Defense Against Memory Replay Attacks

Authors:
Reouven Elbaz
David Champagne
Ruby B. Lee
Lionel Torres
Gilles Sassatelli
Pierre Guillemin
Download:
DOI: 10.1007/978-3-540-74735-2_20
URL: https://iacr.org/archive/ches2007/47270289/47270289.pdf
Search ePrint
Search Google
Conference: CHES 2007
BibTeX
@inproceedings{ches-2007-864,
  title={TEC-Tree: A Low-Cost, Parallelizable Tree for Efficient Defense Against Memory Replay Attacks},
  booktitle={Cryptographic Hardware and Embedded Systems - CHES 2007, 9th International Workshop, Vienna, Austria, September 10-13, 2007, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={4727},
  pages={289-302},
  url={https://iacr.org/archive/ches2007/47270289/47270289.pdf},
  doi={10.1007/978-3-540-74735-2_20},
  author={Reouven Elbaz and David Champagne and Ruby B. Lee and Lionel Torres and Gilles Sassatelli and Pierre Guillemin},
  year=2007
}