Abstract
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.
Chapter PDF
Similar content being viewed by others
References
A. Ahu, J. Hopcroft, J. Ullman: The Design and Analysis of Computer Algorithms, Addison Wesley, 1974.
M. Bellare, O. Goldreich, S. Goldwasser: Incremental Cryptography: The Case of Hashing and Signing, Crypto’ 94, Lecture Notes in Computer Science, Vol. 839, Springer-Verlag, pp. 216–233, 1994.
M. Bellare, O. Goldreich, S. Goldwasser: Incremental Cryptography and Application to Virus Protection, Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, pp. 45–56, 1995.
M. Bellare, R. Guérin, P. Rogaway: XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions, Crypto’ 95, Lecture Notes in Computer Science, Vol. 963, Springer-Verlag, pp. 15–29, extended version available athttp://www.cs.ucdavis.edu/~rogaway/, 1995.
M. Bellare, J. Killian, P. Rogaway: On the Security of Cipher Block Chaining, Crypto’ 94, Lecture Notes in Computer Science, Vol. 839, pp. 341–358, 1994.
M. Blum, W. Evans, P. Gemmell, S. Kannan, M. Naor: Checking the Correctness of Memories, Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pp. 90–99, 1991.
M. Blum, W. Evans, P. Gemmell, S. Kannan, M. Naor: Checking the Correctness of Memories, Algorithmica, Volume 12, pp. 225–244, 1994.
M. Blum, S. Kannan: Designing Programs that Check Their Work, Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, pp. 86–97, 1989.
O. Goldreich, S. Goldwasser, S. Micali: How to Construct Random Funtions, Journal of ACM, Vol. 33(4), pp. 792–807, 1986.
S. Goldwasser, S. Micali, C. Rackoff: The Knowledge Complexity of Interactive Proof Systems, SIAM Journal on Computation, Vol. 18, pp. 186–208, 1989.
S. Goldwasser, S. Micali, R.L. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks, SIAM Journal on Computation, Vol. 17(2), pp. 281–308, 1988.
O. Goldreich, R. Ostrovsky: Software Protection and Simulation on Oblivious RAM, Journal of ACM, Vol. 43(3), pp. 431–473, 1996.
D. Micciancio: Oblivious Data Structures: Application to Cryptography, (to appear at) Proceedings of the 29th Annual Symposium on the Theory of Computing, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fischlin, M. (1997). Incremental Cryptography and Memory Checkers. In: Fumy, W. (eds) Advances in Cryptology — EUROCRYPT ’97. EUROCRYPT 1997. Lecture Notes in Computer Science, vol 1233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69053-0_27
Download citation
DOI: https://doi.org/10.1007/3-540-69053-0_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62975-7
Online ISBN: 978-3-540-69053-5
eBook Packages: Springer Book Archive