Incremental cryptography and memory checkers
- We introduce the relationship between incremental cryptography and memory checkers. We present an incremental message authentication scheme based on the XOR MACs which supports insertion, deletion and other single block operations. Our scheme takes only a constant number of pseudorandom function evaluations for each update step and produces smaller authentication codes than the tree scheme presented in [BGG95]. Furthermore, it is secure against message substitution attacks, where the adversary is allowed to tamper messages before update steps, making it applicable to virus protection. From this scheme we derive memory checkers for data structures based on lists. Conversely, we use a lower bound for memory checkers to show that so-called message substitution detecting schemes produce signatures or authentication codes with size proportional to the message length.
Download full text files
Additional Services
| Author: | Marc FischlinGND |
|---|---|
| URN: | urn:nbn:de:hebis:30-12655 |
| URL: | http://www.mi.informatik.uni-frankfurt.de/research/papers.html |
| Document Type: | Preprint |
| Language: | English |
| Date of Publication (online): | 2005/07/21 |
| Year of first Publication: | 1997 |
| Publishing Institution: | Universitätsbibliothek Johann Christian Senckenberg |
| Release Date: | 2005/07/21 |
| Page Number: | 16 |
| Note: | Preprint, später in: Advances in Cryptology - Eurocrypt '97 , Lecture Notes in Computer Science, Vol. 1233, Springer-Verlag, 1997, S. 393-408 |
| Source: | Advances in Cryptology - Eurocrypt '97 , Lecture Notes in Computer Science, Vol. 1233, Springer-Verlag, pp. 393-408, 1997 - http://www.mi.informatik.uni-frankfurt.de/research/papers.html |
| HeBIS-PPN: | 224947036 |
| Institutes: | Informatik und Mathematik / Mathematik |
| Informatik und Mathematik / Informatik | |
| Dewey Decimal Classification: | 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik |
| Licence (German): |  Deutsches Urheberrecht |
