Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

1 2012

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: TrueNyms unobservability system

Sortuj według:

Ogranicz wyniki do:

Hardened Bloom filters, with an application to unobservability

Bernard M., Leprévost F.

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

2012

Vol. 12, no. 4

11--22

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.