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
基金
芬兰科学院;
关键词
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 条
  • [21] Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters
    Inbar, Roi
    Omri, Eran
    Pinkas, Benny
    [J]. SECURITY AND CRYPTOGRAPHY FOR NETWORKS, SCN 2018, 2018, 11035 : 235 - 252
  • [22] Linear Private Set Union from Multi-Query Reverse Private Membership Test
    Zhang, Cong
    Chen, Yu
    Liu, Weiran
    Zhang, Min
    Lin, Dongdai
    [J]. PROCEEDINGS OF THE 32ND USENIX SECURITY SYMPOSIUM, 2023, : 337 - 354
  • [23] A Practical Multiparty Private Set Intersection Protocol Based on Bloom Filters for Unbalanced Scenarios
    Ruan, Ou
    Yan, Changwang
    Zhou, Jing
    Ai, Chaohao
    [J]. APPLIED SCIENCES-BASEL, 2023, 13 (24):
  • [24] Interval Filter: A Locality-Aware Alternative to Bloom Filters for Hardware Membership Queries by Interval Classification
    Quislant, Ricardo
    Gutierrez, Eladio
    Plata, Oscar
    Zapata, Emilio L.
    [J]. INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2010, 2010, 6283 : 162 - 169
  • [25] Incremental bloom filters
    Hao, Fang
    Kodialam, Murali
    Lakshman, T. V.
    [J]. 27TH IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM), VOLS 1-5, 2008, : 1741 - +
  • [26] Bloom filters for molecules
    Jorge Medina
    Andrew D. White
    [J]. Journal of Cheminformatics, 15
  • [27] The Dynamic Bloom Filters
    Guo, Deke
    Wu, Jie
    Chen, Honghui
    Yuan, Ye
    Luo, Xueshan
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2010, 22 (01) : 120 - 133
  • [28] The Circle Game: Scalable Private Membership Test Using Trusted Hardware
    Tamrakar, Sandeep
    Liu, Jian
    Paverd, Andrew
    Ekberg, Jan-Erik
    Pinkas, Benny
    Asokan, N.
    [J]. PROCEEDINGS OF THE 2017 ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (ASIA CCS'17), 2017, : 31 - 44
  • [29] On the analysis of Bloom filters
    Grandi, Fabio
    [J]. INFORMATION PROCESSING LETTERS, 2018, 129 : 35 - 39
  • [30] Real-time Private Membership Test using Homomorphic Encryption
    Chielle, Eduardo
    Gamil, Homer
    Maniatakos, Michail
    [J]. PROCEEDINGS OF THE 2021 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE 2021), 2021, : 1282 - 1287