Performance/security tradeoffs for content-based routing supported by bloom filters

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8179 LNCS, Issue , 2013, Pages 129-140

  Mercier, Hugues ^a   Onica, Emanuel ^a   Rivier̀e, Etienne ^a   Felber, Pascal ^a  

^a UNIVERSITY OF NEUCHÂTEL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPREHENSIVE ANALYSIS; COMPUTATIONAL COSTS; CONTENT BASED ROUTING; ENCRYPTED MESSAGES; INFORMATION LEAKAGE; LARGE-SCALE DISTRIBUTED SYSTEM; PRE-FILTERING; RANDOMIZATION TECHNIQUES;

COMMUNICATION; CRYPTOGRAPHY; NETWORK SECURITY;

DATA STRUCTURES;

EID: 84892996881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-03578-9_11     Document Type: Conference Paper

References (15)

1. Eugster, P.T., Felber, P.A., Guerraoui, R., Kermarrec, A.M.: The many faces of publish/subscribe. ACM Computing Surveys 35(2), 114-131 (2003)
2. Choi, S., Ghinita, G., Bertino, E.: A privacy-enhancing content-based publish/ Subscribe system using scalar product preserving transformations. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010, Part I. LNCS, vol. 6261, pp. 368-384. Springer, Heidelberg (2010)
3. Barazzutti, R., Felber, P., Mercier, H., Onica, E., Rivière, E.: Thrifty privacy: efficient support for privacy-preserving publish/subscribe. In: Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems, DEBS 2012, pp. 225-236. ACM (2012)
4. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422-426 (1970)
5. Kerschbaum, F.: Public-key encrypted Bloom filters with applications to supply chain integrity. In: Li, Y. (ed.) DBSec. LNCS, vol. 6818, pp. 60-75. Springer, Heidelberg (2011)
6. Shikfa, A., Önen, M., Molva, R.: Broker-based private matching. In: Fischer-Hübner, S., Hopper, N. (eds.) PETS 2011. LNCS, vol. 6794, pp. 264-284. Springer, Heidelberg (2011)
7. Jerzak, Z., Fetzer, C.: Bloom filter based routing for content-based publish/ subscribe. In: Proceedings of the Second International Conference on Distributed Event-Based Systems, DEBS 2008, pp. 71-81. ACM, New York (2008)
8. Perl, H., Mohammed, Y., Brenner, M., Smith, M.: Fast confidential search for biomedical data using Bloom filters and homomorphic cryptography. In: 2012 IEEE 8th International Conference on E-Science (e-Science), pp. 1-8 (2012)
9. Goh, E.J.: Secure indexes. Cryptology ePrint Archive, Report 2003/216 (2003)
10. Bellovin, S.M., Cheswick, W.R.: Privacy-enhanced searches using encrypted Bloom filters. Cryptology ePrint Archive, Report 2004/022 (2004)
11. Kuzu, M., Kantarcioglu, M., Durham, E., Malin, B.: A constraint satisfaction cryptanalysis of Bloom filters in private record linkage. In: Fischer-Hübner, S., Hopper, N. (eds.) PETS 2011. LNCS, vol. 6794, pp. 226-245. Springer, Heidelberg (2011)
12. Andrews, G.E.: The Theory of Partitions. Cambridge Mathematical Library (1998)
13. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science, 2nd edn. Addison-Wesley Longman Publishing (1994)
14. Newman, M.E.J.: Power laws, Pareto distributions and Zipf's law. Contemporary Physics 46, 323-351 (2005)
15. Popa, R.A., Redfield, C.M.S., Zeldovich, N., Balakrishnan, H.: CryptDB: protecting confidentiality with encrypted query processing. In: Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, SOSP 2011, pp. 85-100. ACM, New York (2011)