Proofs of Zero Knowledge

TL;DR

This paper introduces a novel cryptographic protocol using keyed hash trees for verifying non-existent entries in databases, enhancing privacy and security in data verification processes.

Contribution

It presents a new primitive called keyed hash trees, extending Merkle trees, and compares its scheme to existing methods like Undeniable Attesters and Zero Knowledge Sets.

Findings

The protocol effectively verifies 'no such entry' responses.

Keyed hash trees improve upon traditional Merkle trees for this purpose.

Comparison shows advantages over previous schemes.

Abstract

We present a protocol for verification of ``no such entry'' replies from databases. We introduce a new cryptographic primitive as the underlying structure, the keyed hash tree, which is an extension of Merkle's hash tree. We compare our scheme to Buldas et al.'s Undeniable Attesters and Micali et al.'s Zero Knowledge Sets.