55 search results - page 1 / 11 » Caches and Hash Trees for Efficient Memory Integrity |
HPCA
2003
IEEE
14 years 4 months ago
2003
IEEE
We study the hardware cost of implementing hash-tree based verification of untrusted external memory by a high performance processor. This verification could enable applications s...
CHES
2007
Springer
13 years 10 months ago
2007
Springer
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 r...
ANCS
2010
ACM
13 years 2 months ago
2010
ACM
TCP/IP, the most commonly used network protocol, consumes a significant portion of time in Internet servers. While a wide spectrum of studies has been done to reduce its processin...
SBBD
2008
13 years 5 months ago
2008
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
ASIACRYPT
1992
Springer
13 years 8 months ago
1992
Springer
Collision resistant hash functions are an important basic tool for cryptographic applications such as digital signature schemes and integrity protection based on "fingerprinti...