论文信息 - Proofs of Zero Knowledge

Proofs of Zero Knowledge

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.

Matthias Bauer | Matthias Bauer

[1] Peeter Laud,et al. Eliminating Counterevidence with Applications to Accountable Certificate Management , 2002, J. Comput. Secur..

[2] Peeter Laud,et al. Accountable certificate management using undeniable attestations , 2000, CCS.

[3] Silvio Micali,et al. Zero-knowledge sets , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[4] Donald E. Knuth,et al. The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[5] Steven M. Bellovin,et al. Using Bloom Filters for Authenticated Yes/No Answers in the DNS , 2001 .

[6] Ralph C. Merkle,et al. Protocols for Public Key Cryptosystems , 1980, 1980 IEEE Symposium on Security and Privacy.

[7] Donald E. Eastlake,et al. Domain Name System Security Extensions , 1997, RFC.

[8] David Chaum,et al. Undeniable Signatures , 1989, CRYPTO.

[9] M. V. Wilkes,et al. The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[10] Steven M. Bellovin,et al. Using the Domain Name System for System Break-ins , 1995, USENIX Security Symposium.