Oddly enough, even if frequently ment ion ed, to the best of our knowl edge the (soft) privacy properties of Bloom filters have never been explicitly quantifi ed. Their probabilistic operat ion, along with the implicit data representat ion, yields some ambiguity on the actual data stor ed, which, in scenarios where cryptographic protect ion is unviable or unprac- tical, may be somewhat consider ed as a better than nothing privacy asset. Their performance/memory efficiency makes them appealing in a huge variety of scenarios. Bloom filters are probabilistic data structures which permit to conve- niently represent set membership.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |