Homomorphic Hashes — Efficient Trust and Avoiding Complex Hashing Operations

We waste so much computing power, and every bit of extra computing costs us a little more energy. So, a good of work is going into making sure we have trusted systems, but also in reducing our computational overhead. Can you thus have trust with efficiency?

Homomorphic Hashes

We are currently seeing the rise of homomorphic encryption, and where we can mathematically process encrypted values. But, how can we create a new hash value, without knowing the previous values added to the hash? Well, we can do this with a homomorphic hash. So, let’s look at one of the implementations of this: LtHash and initially defined by Bellare and Micciancio [1]:

At the time, the homomorphic encryption method was defined as an incremental technique. The method has since been updated by Lewi et al at Facebook [2]:

This paper focuses on a method by which an owner of a database — a distributor — is responsible for…