arXiv · cs/0406058
Proofs of Zero Knowledge
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.
Explore related subjects
Keep this discovery
Matthias Bauer. 2004-07-14. Proofs of Zero Knowledge. https://arxiv.org/abs/cs/0406058
Cite the original work for its findings. Save a collection to share your selection of sources.