We present two new constructions of quantum hash functions: the first based
on expander graphs and the second based on extractor functions and estimate the
amount of randomness that is needed to construct them. We also propose a keyed
quantum hash function based on extractor function that can be used in quantum
message authentication codes and assess its security in a limited attacker
model
