TY  - JOUR
A1  - Fischlin, Marc
T1  - Practical memory checkers for stacks, queues and deques
N2  - A memory checker for a data structure provides a method to check that the output of the data structure operations is consistent with the input even if the data is stored on some insecure medium. In [8] we present a general solution for all data structures that are based on insert(i,v) and delete(j) commands. In particular this includes stacks, queues, deques (double-ended queues) and lists. Here, we describe more time and space efficient solutions for stacks, queues and deques. Each algorithm takes only a single function evaluation of a pseudorandomlike function like DES or a collision-free hash function like MD5 or SHA for each push/pop resp. enqueue/dequeue command making our methods applicable to smart cards.
Y1  - 2005
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/4224
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-12643
UR  - http.//www.uni-frankfurt.de/roessner/group/marc/marc.html
ER  -