Proofs of Zero Knowledge

Simple item page
dc.creatorBauer, Matthias
dc.date2004-06-29
dc.date2004-07-14
dc.date.accessioned2026-07-07T03:21:30Z
dc.date.available2026-07-07T03:21:30Z
dc.descriptionWe 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.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/cs/0406058
dc.identifierhttp://arxiv.org/abs/cs/0406058
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32220
dc.subjectCryptography and Security
dc.subjectDatabases
dc.subjectE.2; H.2.0
dc.titleProofs of Zero Knowledge
dc.typetext

Files

Collections

arXiv