Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters
| Abstract |
Content-based routing is widely used in large-scale distribu-ted
systems as it provides a loosely-coupled yet expressive form of
communication: consumers of information register their interests by
the means of subscriptions, which are subsequently used to determine
the set of recipients of every message published in the system. A
major challenge of content-based routing is security. Although some
techniques have been proposed to perform matching of encrypted
subscriptions against encrypted messages, their computational cost
is very high. To speed up that process, it was recently proposed to
embed Bloom filters in both subscriptions and messages to reduce the
space of subscriptions that need to be tested. In this article, we
provide a comprehensive analysis of the information leaked by Bloom
filters when implementing such a “prefiltering” strategy. The main
result is that although there is a fundamental trade-off between
prefiltering efficiency and information leakage, it is practically
possible to obtain good prefiltering while securing the scheme
against leakages with some simple randomization techniques. |
| Keywords |
|
| Citation | H. Mercier, et al., "Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters," in SIROCCO'13: The 20th International Colloquium on Structural Information and Communication Complexity, Ischia, Italy, 2013, . |
| Type | Conference paper (English) |
| Name of conference | SIROCCO'13: The 20th International Colloquium on Structural Information and Communication Complexity (Ischia, Italy) |
| Date of conference | 1-7-2013 |
| Publisher | Springer |
| URL | http://link.springer.com/chapter/10.1007%2F978-3-319-0357... |
| Related project | SRT-15: Intelligence Push in the Enterprise Realm |