Abstract
Most of the hash functions using iterative constructions, are inefficient for bulk hashing of documents with high similarity. In this paper, we present a new approach to construct a cryptographic hash function called Pair Chaining & Modular Arithmetic Combining Incremental Hash Function (PCIHF). PCIHF has some attractive properties, which are incrementality and parallelizability. The security of PCIHF has also been analyzed comprehensively. Finally, we show that PCIHF is not only universal one-way but also collision-free.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bellare, M., Goldreich, Oded., Goldwasser, S.(1994). Incremental Cryptography: The Case of Hashing and Signing. Advances in Cryptology-Proceedings of Crypto’ 94, 216–233
Bellare, M., Goldreich, Oded., Goldwasser, S.(1995). Incremental Cryptography and Application to Virus Protection. Proceedings of the 27th ACM symposium on the Theory of Computing, May 1995, 45–56
Bellare, M., Guerin, R., Rogaway, P. (1995). XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions. Advances in Cryptology-Proceedings of Crypto’ 95, 15–29
Bellare, M., Micciancio, D. (1997). A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost. Advances in Cryptology-Proceedings of Eurocrypt’ 97
Fischlin, M. (1997). Incremental Cryptography and Memory Checkers. Advances in Cryptology-Proceedings of Eurocrypt’ 97, 393–408
Impagliazzo, R., Naor, M. (1996). Efficient Cryptographic Schemes Provably as Secure as Subset Sum. Journal of Cryptology, Vol. 9, No. 4, Autumn 1996
Micciancio, D.(1997). Oblivious Data Structures: Applications to Cryptography. Proceedings of the 29th Annual symposium on the Theory of Computing, 1997
Menezes, A. J., Oorschot, P. C. van, & Vanstone, S. A. (1997). Handbook of Applied Cryptography. Boca Raton: CRC Press
Naor, M., Yung, M. (1989). Universal One-Way Hash Functions and Their Cryptographic Applications. Proceedings of the 21st Annual Symposium on Theory of Computing, ACM, 1989
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bok-Min, G., Siddiqi, M.U., Hean-Teik, C. (2001). Incremental Hash Function Based on Pair Chaining & Modular Arithmetic Combining. In: Rangan, C.P., Ding, C. (eds) Progress in Cryptology — INDOCRYPT 2001. INDOCRYPT 2001. Lecture Notes in Computer Science, vol 2247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45311-3_5
Download citation
DOI: https://doi.org/10.1007/3-540-45311-3_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43010-0
Online ISBN: 978-3-540-45311-6
eBook Packages: Springer Book Archive