{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:58:34Z","timestamp":1773511114852,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642335358","type":"print"},{"value":"9783642335365","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33536-5_20","type":"book-chapter","created":{"date-parts":[[2012,9,30]],"date-time":"2012-09-30T07:52:35Z","timestamp":1348991555000},"page":"202-216","source":"Crossref","is-referenced-by-count":35,"title":["BLIP: Non-interactive Differentially-Private Similarity Computation on Bloom filters"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"Alaggan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Gambs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-22012-8_4","volume-title":"Automata, Languages and Programming","author":"M.S. Alvim","year":"2011","unstructured":"Alvim, M.S., Andr\u00e9s, M.E., Chatzikokolakis, K., Palamidessi, C.: On the Relation between Differential Privacy and Quantitative Information Flow. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 60\u201376. Springer, Heidelberg (2011)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Benedikt, M., Lakshmanan, L.V.S., Stoyanovich, J.: Efficient network aware search in collaborative tagging sites. PVLDB 2008, 1(1) (August 2008)","DOI":"10.14778\/1453856.1453934"},{"issue":"4","key":"20_CR3","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1007\/s00778-008-0129-7","volume":"18","author":"M. Bawa","year":"2009","unstructured":"Bawa, M., Bayardo, R.J., Agrawal, R., Vaidya, J.: Privacy-preserving indexing of documents on the network. The VLDB Journal\u00a018(4), 837\u2013856 (2009)","journal-title":"The VLDB Journal"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/978-3-540-85174-5_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A. Beimel","year":"2008","unstructured":"Beimel, A., Nissim, K., Omri, E.: Distributed Private Data Analysis: Simultaneously Solving How and What. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 451\u2013468. Springer, Heidelberg (2008)"},{"key":"20_CR5","unstructured":"Bellovin, S.M., Cheswick, W.R.: Privacy-enhanced searches using encrypted Bloom filters. Tech. rep., Columbia University CUCS-034-07 (2007)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Bertier, M., Frey, D., Guerraoui, R., Kermarrec, A.M., Leroy, V.: The Gossple anonymous social network. In: Proceedings of the 11th International Middleware Conference (Middleware 2010), ACM\/IFIP\/USENIX, Bangalore, India, November 29 - December 3, pp. 191\u2013211 (2010)","DOI":"10.1007\/978-3-642-16955-7_10"},{"issue":"7","key":"20_CR7","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"key":"20_CR8","first-page":"609","volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC 2008)","author":"A. Blum","year":"2008","unstructured":"Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: Dwork, C. (ed.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC 2008), pp. 609\u2013618. ACM, Victoria (2008)"},{"issue":"4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.ipl.2008.05.018","volume":"108","author":"P. Bose","year":"2008","unstructured":"Bose, P., Guo, H., Kranakis, E., Maheshwari, A., Morin, P., Morrison, J., Smid, M., Tang, Y.: On the false-positive rate of Bloom filters. Information Processing Letters\u00a0108(4), 210\u2013213 (2008)","journal-title":"Information Processing Letters"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-79228-4_1","volume-title":"Theory and Applications of Models of Computation","author":"C. Dwork","year":"2008","unstructured":"Dwork, C.: Differential Privacy: A Survey of Results. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 1\u201319. Springer, Heidelberg (2008)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C. Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating Noise to Sensitivity in Private Data Analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 265\u2013284. Springer, Heidelberg (2006)"},{"issue":"1","key":"20_CR12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.29012\/jpc.v2i1.585","volume":"2","author":"C. Dwork","year":"2010","unstructured":"Dwork, C., Naor, M.: On the difficulties of disclosure prevention in statistical databases or the case for differential privacy. Journal of Privacy and Confidentiality\u00a02(1), 93\u2013107 (2010)","journal-title":"Journal of Privacy and Confidentiality"},{"key":"20_CR13","unstructured":"Goh, E.J.: Secure indexes. Tech. rep., Cryptology ePrint Archive 2003\/216 (March 16, 2004)"},{"key":"20_CR14","unstructured":"G\u00f6tz, M., Machanavajjhala, A., Wang, G., Xiao, X., Gehrke, J.: Privacy in search logs. CoRR abs\/0904.0682 (2009)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-30229-2_5","volume-title":"Middleware 2004","author":"M. Jelasity","year":"2004","unstructured":"Jelasity, M., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol.\u00a03231, pp. 79\u201398. Springer, Heidelberg (2004)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-22348-8_7","volume-title":"Data and Applications Security and Privacy XXV","author":"F. Kerschbaum","year":"2011","unstructured":"Kerschbaum, F.: Public-Key Encrypted Bloom Filters with Applications to Supply Chain Integrity. In: Li, Y. (ed.) DBSec. LNCS, vol.\u00a06818, pp. 60\u201375. Springer, Heidelberg (2011)"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-24861-0_22","volume-title":"Information Security","author":"J. Lee","year":"2011","unstructured":"Lee, J., Clifton, C.: How Much Is Enough? Choosing \u03b5 for Differential Privacy. In: Lai, X., Zhou, J., Li, H. (eds.) ISC 2011. LNCS, vol.\u00a07001, pp. 325\u2013340. Springer, Heidelberg (2011)"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Li, Y.D., Zhang, Z., Winslett, M., Yang, Y.: Compressive mechanism: utilizing sparse representation in differential privacy. CoRR abs\/1107.3350 (2011)","DOI":"10.1145\/2046556.2046581"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), Providence, RI, USA, October 20-23, pp. 94\u2013103 (2007)","DOI":"10.1109\/FOCS.2007.66"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-03356-8_8","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I. Mironov","year":"2009","unstructured":"Mironov, I., Pandey, O., Reingold, O., Vadhan, S.P.: Computational Differential Privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 126\u2013142. Springer, Heidelberg (2009)"},{"key":"20_CR21","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/11530084_19","volume-title":"Data Integration in the Life Sciences","author":"R.K. Pon","year":"2005","unstructured":"Pon, R.K., Critchlow, T.: Performance-Oriented Privacy-Preserving Data Integration. In: Lud\u00e4scher, B., Raschid, L. (eds.) DILS 2005. LNCS (LNBI), vol.\u00a03615, pp. 240\u2013256. Springer, Heidelberg (2005)"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-642-22263-4_15","volume-title":"Privacy Enhancing Technologies","author":"A. Shikfa","year":"2011","unstructured":"Shikfa, A., \u00d6nen, M., Molva, R.: Broker-Based Private Matching. In: Fischer-H\u00fcbner, S., Hopper, N. (eds.) PETS 2011. LNCS, vol.\u00a06794, pp. 264\u2013284. Springer, Heidelberg (2011)"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Tarkoma, S., Rothenberg, C.E., Lagerspetz, E.: Theory and practice of Bloom filters for distributed systems. IEEE Communications Surveys & Tutorials\u00a0(99), 1\u201325 (2011)","DOI":"10.1109\/SURV.2011.031611.00024"},{"issue":"309","key":"20_CR24","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/01621459.1965.10480775","volume":"60","author":"S.L. Warner","year":"1965","unstructured":"Warner, S.L.: Randomized response: a survey technique for eliminating evasive answer bias. Journal of the American Statistical Association\u00a060(309), 63\u201369 (1965)","journal-title":"Journal of the American Statistical Association"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33536-5_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:12:23Z","timestamp":1606169543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33536-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335358","9783642335365"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33536-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}