Computer Science – Cryptography and Security
Scientific paper
2004-06-29
Computer Science
Cryptography and Security
16 pages
Scientific paper
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.
No associations
LandOfFree
Proofs of Zero Knowledge does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Proofs of Zero Knowledge, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proofs of Zero Knowledge will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-525664