Universal Hash Functions

• Papers
  • How to recycle random bits (Russell Impagliazzo, David Zuckerman, FOCS 1989)
  • [scholar]The Computational Complexity of Universal Hashing (Yishay Mansour, Noam Nisan, Prasoon Tiwari, STOC 1990)
  • On families of hash functions via geometric codes and concatenation (Jürgen Bierbrauer, Thomas Johansson, Gregory Kabatinskii, Ben Smeets, Crypto 93)
  • Tiny Families of Functions with Random Properties: A Quality–-Size Trade-–off for Hashing (Oded Goldreich, Avi Wigderson, 1994)
  • On the Connections Between Universal Hashing, Combinatorial Designs and Error-Correcting Codes (Douglas Stinson, ECC TR95-052)
  • Universal Hashing And Geometric Codes (Jürgen Bierbrauer, DCC 1997)
  • MMH: Software Message Authentication in the Gbit/second Rates (Shai Halevi and Hugo Krawczyk, 1997)
  • Efficient Strongly Universal and Optimally Universal Hashing (Philipp Woelfel, 1999)
  • Fast universal hashing with small keys and no preprocessing: the PolyR construction (Ted Krovetz and Phillip Rogaway, ICICS 2000)
  • Software Performance of Universal Hash Functions (Wim Nevelsteen and Bart Preneel, Eurocrypt 2000)
  • Streaming computation of combinatorial objects (Z Bar-Yossef, O Reingold, R Shaltiel, L Trevisan, Computational Complexity, 2002)
  • CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions (John Black, Phil Rogaway, 2003)
  • Energy Scalable Universal Hashing (Jens-Peter Kaps, Kaan Yüksel, Berk Sunar, IEEE TOC 2004)
  • Universal Hash Functions for Emerging Ultra-Low-Power Networks (Kaan Yüksel, Jens-Peter Kaps, and Berk Sunar, 2004)
  • Key Derivation and Randomness Extraction (Olivier Chevassut, Pierre-Alain Fouque, Pierrick Gaudry, and David Pointcheval, eprint 2005/061)
  • The Twist-Augmented Technique for Key Exchange (Olivier Chevassut, Pierre-Alain Fouque, Pierrick Gaudry, David Pointcheval, PKC 2006)
  • [scholar]Cryptography with constant computational overhead (Ishai, Kushilevitz, Ostrovsky, Sahai, STOC 2008)
• Lecture notes, textbooks, surveys
• • The State of Cryptographic Hash Functions (Bart Preneel, 1999)
  • Hash Functions (Mihir Bellare & Phil Rogaway, CSE 2007, Modern Cryptography, Fall 2005)
• Theses
  • Software-optimized universal hashing and message authentication (Ted Krovetz, UC Davis, 2000)
  • Message authentication codes (John Black, UC Davis, 2000)
• Link farms
  • Bibliography on Authentication Codes (Douglas Stinson and Ruizhong Wei, version 4.1, October 13, 1998)
• UOWHFs
  • Universal One-Way Hash Functions and their Cryptographic Applications (Naor, Yung, 1989)
  • Collision-Resistant Hashing: Towards Making UOWHFs Practical (Mihir Bellare, Phil Rogaway)
  • Limits on the Efficiency of One-Way Permutation-Based Hash Functions (Jeong Han Kim, Daniel Simon, Prasad Tetali, 1999)
  • Square Hash: Fast Message Authentication Via Optimized Universal Hash Functions (Mark Etzel, Sarvar Patel, and Zulfikar Ramzan, Crypto '99)

---

Cryptology Pointers by Helger Lipmaa
Got any suggestions or additional links? Mail to <helger.lipmaa>gmail.com
NB! If you find any broken links, please be kind and report them to me together with their current location!

(C) Helger Lipmaa 1997-2009.