We show how to efficiently compute hash functions that are invariant under permutations. These hash functions have a variety of applications to distributed computing problems.