Reference : Hardened Bloom Filters, with an Application to Unobservability
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/579
Hardened Bloom Filters, with an Application to Unobservability
English
Bernard, Nicolas mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Leprévost, Franck mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Feb-2013
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Uniwersytetu Marii Curie Sklodowskies
12
4
Security Systems, Cryptographic Protocols & Network Security
11-22
Yes (verified by ORBilu)
International
1732-1360
2083-3628
Lublin
Poland
[en] Classical Bloom filters may be used to elegantly check if an element e belongs to a set S, and, if not, to add e to S. They do not store any data and only provide boolean answers regarding the membership of a given element in the set, with some probability of false positive answers. Bloom filters are often used in caching system to check that some requested data actually exist before doing a costly lookup to retrieve them. However, security issues may arise for some other applications where an active attacker is able to inject data crafted to degrade the filters’ algorithmic properties, resulting for instance in a Denial of Service (DoS) situation. This leads us to the concept of hardened Bloom filters, combining classical Bloom filters with cryptographic hash functions and secret nonces. We show how this approach is successfully used in the TrueNyms unobservability system and protects it against replay attacks.
Researchers ; Professionals
http://hdl.handle.net/10993/579
10.2478/v10065-012-0018-y
http://www.degruyter.com/view/j/umcsinfo.2012.12.issue-4/v10065-012-0018-y/v10065-012-0018-y.xml

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
article_TN.pdfAuthor preprint198.58 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.