Private Membership Test Protocol with Low Communication Complexity

被引:3
|
作者
Ramezanian, Sara [1 ]
Meskanen, Tommi [1 ]
Naderpour, Masoud [1 ]
Niemi, Valtteri [1 ]
机构
[1] Univ Helsinki, Dept Comp Sci, Helsinki, Finland
来源
NETWORK AND SYSTEM SECURITY | 2017年 / 10394卷
关键词
Privacy enhancing technologies; Applied cryptography; Private information retrieval; Private membership test; Homomorphic encryption; Bloom filter; Cuckoo filter; INFORMATION-RETRIEVAL;
D O I
10.1007/978-3-319-64701-2_3
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We introduce a practical method to perform private membership test. In this method, clients are able to test whether an item is in a set controlled by the server, without revealing their query items to the server. After executing the queries, the content of server's set remains secret. We apply Bloom filter and Cuckoo filter in the membership test procedure. In order to achieve privacy properties, we present a novel protocol based on homomorphic encryption schemes. We have implemented our method in a realistic scenario where a client of an anti-malware company wants to privately check a file hash value through the company's database.
引用
收藏
页码:31 / 45
页数:15
相关论文
共 50 条
  • [21] Secure group communication with low communication complexity
    Kim, H
    Lee, J
    Yoon, H
    Cho, JW
    PARALLEL AND DISTRIBUTED COMPUTING: APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS, 2004, 3320 : 586 - 590
  • [22] Upper bound on the communication complexity of private information retrieval
    Ambainis, A
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 401 - 407
  • [23] Unbalanced private set intersection with linear communication complexity
    Quanyu ZHAO
    Bingbing JIANG
    Yuan ZHANG
    Heng WANG
    Yunlong MAO
    Sheng ZHONG
    Science China(Information Sciences), 2024, 67 (03) : 79 - 93
  • [24] PRIVATE VS COMMON RANDOM BITS IN COMMUNICATION COMPLEXITY
    NEWMAN, I
    INFORMATION PROCESSING LETTERS, 1991, 39 (02) : 67 - 71
  • [25] Unbalanced private set intersection with linear communication complexity
    Zhao, Quanyu
    Jiang, Bingbing
    Zhang, Yuan
    Wang, Heng
    Mao, Yunlong
    Zhong, Sheng
    SCIENCE CHINA-INFORMATION SCIENCES, 2024, 67 (03)
  • [26] Threshold Private Set Intersection with Better Communication Complexity
    Ghosh, Satrajit
    Simkin, Mark
    PUBLIC-KEY CRYPTOGRAPHY - PKC 2023, PT II, 2023, 13941 : 251 - 272
  • [28] Linear Private Set Union from Multi-Query Reverse Private Membership Test
    Zhang, Cong
    Chen, Yu
    Liu, Weiran
    Zhang, Min
    Lin, Dongdai
    PROCEEDINGS OF THE 32ND USENIX SECURITY SYMPOSIUM, 2023, : 337 - 354
  • [29] Low Communication-Cost PSI Protocol for Unbalanced Two-Party Private Sets
    Ning, Jingyu
    Tan, Zhenhua
    Zhang, Kaibing
    Ye, Weizhong
    IET INFORMATION SECURITY, 2024, 2024
  • [30] The Circle Game: Scalable Private Membership Test Using Trusted Hardware
    Tamrakar, Sandeep
    Liu, Jian
    Paverd, Andrew
    Ekberg, Jan-Erik
    Pinkas, Benny
    Asokan, N.
    PROCEEDINGS OF THE 2017 ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (ASIA CCS'17), 2017, : 31 - 44