Is Bloom Filter a Bad Choice for Security and Privacy?

Ripon Patgiri, Sabuzima Nayak, Naresh Babu Muppalaneni
{"title":"Is Bloom Filter a Bad Choice for Security and Privacy?","authors":"Ripon Patgiri, Sabuzima Nayak, Naresh Babu Muppalaneni","doi":"10.1109/ICOIN50884.2021.9333950","DOIUrl":null,"url":null,"abstract":"Today, millions of devices produce billions of network requests to the servers. All these request packets need to be scanned for security. Hence, providing network security and privacy requires filtering and deduplication of packets. In case of filtering, Bloom Filter data structure is the best alternative. Bloom Filter is a probabilistic data structure for membership filtering and it is capable of filtering massive amounts of data using a small memory footprint. However, Bloom Filter is not popular in many applications due to its false positive and false negative issues. Currently, many network security and privacy techniques are implementing Bloom Filter. In this paper, we discuss various facts on Bloom Filter. We advocate that Bloom Filter is the first layer of defence for network security and privacy. Furthermore, we discuss how Bloom Filter provides better security against various network attacks.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"67 1","pages":"648-653"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Information Networking (ICOIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN50884.2021.9333950","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

Today, millions of devices produce billions of network requests to the servers. All these request packets need to be scanned for security. Hence, providing network security and privacy requires filtering and deduplication of packets. In case of filtering, Bloom Filter data structure is the best alternative. Bloom Filter is a probabilistic data structure for membership filtering and it is capable of filtering massive amounts of data using a small memory footprint. However, Bloom Filter is not popular in many applications due to its false positive and false negative issues. Currently, many network security and privacy techniques are implementing Bloom Filter. In this paper, we discuss various facts on Bloom Filter. We advocate that Bloom Filter is the first layer of defence for network security and privacy. Furthermore, we discuss how Bloom Filter provides better security against various network attacks.
布隆过滤器是安全和隐私的坏选择吗?
今天,数以百万计的设备向服务器发出数十亿个网络请求。所有这些请求包都需要进行安全扫描。因此,为了保证网络安全和隐私,需要对数据包进行过滤和重复数据删除。在过滤的情况下,布隆过滤器数据结构是最好的选择。Bloom Filter是一种用于成员过滤的概率数据结构,它能够使用较小的内存占用来过滤大量数据。然而,由于其假阳性和假阴性问题,布隆过滤器在许多应用中并不受欢迎。目前,许多网络安全和隐私技术都在实现布隆过滤器。本文讨论了关于布隆过滤器的各种事实。我们主张布隆过滤器是网络安全和隐私的第一层防御。此外,我们讨论了布隆过滤器如何提供更好的安全性,以抵御各种网络攻击。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信