Private Membership Test for Bloom Filters

被引：10
|
作者：
Meskanen, Tommi [1 ]
Liu, Jian [2 ]
Ramezanian, Sara [1 ]
Niemi, Valtteri [1 ,3 ]
机构：
[1] Univ Turku, Turku, Finland
[2] Aalto Univ, Espoo, Finland
[3] Univ Helsinki, Helsinki, Finland
来源：
2015 IEEE TRUSTCOM/BIGDATASE/ISPA, VOL 1 | 2015年
基金：
芬兰科学院;
关键词：
INFORMATION-RETRIEVAL; COMMUNICATION;
D O I：
10.1109/Trustcom.2015.414
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study the problem of running a set membership test in private manner. We require that a client wants to have the option of not revealing the item for which the membership test is done. Respectively, the server does not wants to reveal the contents of the whole set. A Bloom filter is applied in the membership test. We present two protocols based on prior work as well as a new protocol. Each of these is having a slightly different privacy and complexity properties. We motivate the problem in the context of an anti-malware client checking application fingerprints against a cloud-based malware signature database.
引用
收藏
页码：515 / 522
页数：8
相关论文
共 50 条
  • [1] Basket bloom filters for membership queries
    Xie, Kun
    Min, Ying-Hua
    Zhang, Da-Fang
    Xie, Gao-Gang
    Wen, Ji-Gang
    [J]. Jisuanji Xuebao/Chinese Journal of Computers, 2007, 30 (04): : 597 - 607
  • [2] Basket bloom filters for membership queries
    Xie, Kun
    Min, Yinghua
    Zhang, Dafang
    Xie, Gaogang
    Wen, Jigang
    [J]. TENCON 2005 - 2005 IEEE REGION 10 CONFERENCE, VOLS 1-5, 2006, : 562 - 567
  • [3] Noisy Bloom Filters for Multi-Set Membership Testing
    Dai, Haipeng
    Zhong, Yuankun
    Liu, Alex X.
    Wang, Wei
    Li, Meng
    [J]. SIGMETRICS/PERFORMANCE 2016: PROCEEDINGS OF THE SIGMETRICS/PERFORMANCE JOINT INTERNATIONAL CONFERENCE ON MEASUREMENT AND MODELING OF COMPUTER SCIENCE, 2016, : 139 - 151
  • [4] Bloom Tree: A Search Tree Based on Bloom Filters for Multiple-Set Membership Testing
    Yoon, MyungKeun
    Son, JinWoo
    Shin, Seon-Ho
    [J]. 2014 PROCEEDINGS IEEE INFOCOM, 2014, : 1429 - 1437
  • [5] Fast Dynamic Multiset Membership Testing Using Combinatorial Bloom Filters
    Hao, Fang
    Kodialam, Murali
    Lakshman, T. V.
    Song, Haoyu
    [J]. IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 513 - 521
  • [6] A Constraint Satisfaction Cryptanalysis of Bloom Filters in Private Record Linkage
    Kuzu, Mehmet
    Kantarcioglu, Murat
    Durham, Elizabeth
    Malin, Bradley
    [J]. PRIVACY ENHANCING TECHNOLOGIES, 2011, 6794 : 226 - +
  • [7] Secure Sharing of Private Locations through Homomorphic Bloom Filters
    Feng, Yunhe
    Lu, Zheng
    Cao, Qing
    [J]. 2018 IEEE 4TH INTERNATIONAL CONFERENCE ON BIG DATA SECURITY ON CLOUD (BIGDATASECURITY), 4THIEEE INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE AND SMART COMPUTING, (HPSC) AND 3RD IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT DATA AND SECURITY (IDS), 2018, : 107 - 113
  • [8] Resistive Bloom Filters: From Approximate Membership to Approximate Computing with Bounded Errors
    Akhlaghi, Vahideh
    Rahimi, Abbas
    Gupta, Rajesh K.
    [J]. PROCEEDINGS OF THE 2016 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2016, : 1441 - 1444
  • [9] Beyond bloom filters: From approximate membership checks to approximate state machines
    Bonomi, Flavio
    Mitzenmacher, Michael
    Panigrahy, Rina
    Singh, Sushil
    Varghese, George
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2006, 36 (04) : 315 - 326
  • [10] Solving Set Relations with Secure Bloom Filters Keeping Cardinality Private
    Tajan, Louis
    Westhoff, Dirk
    Armknecht, Frederik
    [J]. PROCEEDINGS OF THE 17TH INTERNATIONAL JOINT CONFERENCE ON E-BUSINESS AND TELECOMMUNICATIONS (SECRYPT), VOL 1, 2020, : 443 - 450
12345