1. S.M. Bellovin, W.R. Cheswick, Privacy-enhanced searches using encrypted Bloom filters, Draft, 2004, http://www.research.att.com/~smb/papers/bloom-encrypt.ps
2. Space/time trade-offs in hash coding with allowable errors;Bloom;Communications of the ACM,1970
3. A. Broder, M. Mitzenmacher, Network applications of Bloom filters: A survey, in: Proceedings of the 40th Annual Allerton Conference on Communication, Control and Computing, 2002, pp. 636–646
4. L. Carter, R. Floyd, J. Gill, G. Markowsky, M. Wegman, Exact and approximate membership testers, in: Annual ACM Symposium on Theory of Computing, 1978, pp. 59–65
5. E.-J. Goh, Secure indexes for efficient searching on encrypted compressed data, Technical Report 2003/216, Cryptology ePrint Archive, 2003. http://eprint.iacr.org/2003/216/