News for hackers. Stuff that matters.
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....

Re:Cryptographically Secure Bloom Filters [pdf] by jaekwon on Thursday July 25, 2013 @01:50AM (#6101116)
Can you explain how say the red-black tree impl can be used in real life?