1. M. Alaggan, S. Gambs, A.-M. Kermarrec, BLIP: non-interactive differentially-private similarity computation on Bloom filters, in Stabilization, Safety, and Security of Distributed Systems, ed. by A.W. Richa, C. Scheideler. Lecture Notes in Computer Science, vol. 7596 (Springer, Berlin, Heidelberg, 2012), pp. 202–216
2. A. Beach, M. Gartrell, S. Akkala, J. Elston, J. Kelley, K. Nishimoto, B. Ray, S. Razgulin, K. Sundaresan, B. Surendar, M. Terada, R. Han, WhozThat? Evolving an ecosystem for context-aware mobile social networks. IEEE Network 22(4), 50–55 (2008)
3. F. Beierle, Do you like What I like? Similarity estimation in proximity-based mobile social networks, in 2018 17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications (TrustCom), August (IEEE, New York, 2018), pp. 1040–1047. https://doi.org/10.1109/TrustCom/BigDataSE.2018.00146
4. T. Bertin-Mahieux, D.P. Ellis, B. Whitman, P. Lamere, The million song dataset, in Proceedings of the 12th International Society for Music Information Retrieval Conference (ISMIR) (2011)
5. B.H. Bloom, Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970). https://doi.org/10.1145/362686.362692