Re:Cryptographically Secure Bloom Filters [pdf]
by bascule on Tuesday July 23, 2013 @11:02PM
(#6094248)
If you think that's cool, you ain't seen nothin' yet. Check out Andrew Miller's PhD thesis: a compiler that can take the Agda description of any data structure and produce a cryptographically authenticated "Merkelized" version of it:
https://github.com/amiller/generic-ads
Here's an implementation of a red-black tree:
https://github.com/amiller/generic-ads/blob/master/RedBlack....