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

DOI10.1007/978-3-319-03578-9_11MaRDI QIDQ2868639zbMATH OpenOpenAlexFDO

Authors Hugues Mercier, Emanuel Onica, étienne Rivière, Pascal Felber

Publication date 17 December 2013

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-03578-9_11

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Data structures (68P05) Network design and communication in computer systems (68M10) Internet topics (68M11)

Recommendations

• Compressed Bloom filters
• scientific article; zbMATH DE number 2087302
• Hardened bloom filters, with an application to unobservability
• Network Applications of Bloom Filters: A Survey
• Cache-, hash-, and space-efficient bloom filters

Cites work

• scientific article; zbMATH DE number 1222942 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• Space/time trade-offs in hash coding with allowable errors

Cited in

(4)

• scientific article; zbMATH DE number 2087302 (Why is no real title available?)
• Bloom filter-based secure data forwarding in large-scale cyber-physical systems
• On the cost and safety of handoffs in content-based routing systems
• Towards a cryptographic treatment of publish/subscribe systems

Describes a project that uses

Uses Software

• CryptDB

This page was built for publication: Performance/security tradeoffs for content-based routing supported by Bloom filters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868639)