I was recently reading about some of the interesting work with invertible bloom filters/invertible bloom lookup tables, eg [0] [1]. There might be either a cle

I was recently reading about some of the interesting work with invertible bloom filters/invertible bloom lookup tables, eg [0] [1]. There might be either a clever way to exploit IBLTs to to make a low-information query of the data (like "Oblivious Selection from a Table" in [1]), or otherwise there may be a way to use them to more efficiently implement the bloom filter/sharded bloom filter options. My information theory/coding theory is not strong enough to really know, but it might be worth looking into! [0] https://www.ics.uci.edu/~eppstein/pubs/EppGooUye-SIGCOMM-11.pdf https://www.ics.uci.edu/~eppstein/pubs/EppGooUye-SIGCOMM-11.... [1] http://arxiv.org/pdf/1101.2245.pdf http://arxiv.org/pdf/1101.2245.pdf