Proofs of Zero Knowledge

Computer Science – Cryptography and Security

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-525664

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.