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 条

[1] Private membership test protocol with low communication complexity
Sara Ramezanian
Tommi Meskanen
Masoud Naderpour
Ville Junnila
Valtteri Niemi
Digital Communications and Networks, 2020, 6 (03) : 321 - 332
[2] Private membership test protocol with low communication complexity
Ramezanian, Sara
Meskanen, Tommi
Naderpour, Masoud
Junnila, Ville
Niemi, Valtteri
DIGITAL COMMUNICATIONS AND NETWORKS, 2020, 6 (03) : 321 - 332
[3] Multiparty Threshold Private Set Intersection Protocol with Low Communication Complexity
Yu, Xiaopeng
Li, Fagen
Zhao, Wei
Dai, Zhengyi
Tang, Dianhua
SECURITY AND COMMUNICATION NETWORKS, 2022, 2022
[4] Multiparty Threshold Private Set Intersection Protocol with Low Communication Complexity
Yu, Xiaopeng
Li, Fagen
Zhao, Wei
Dai, Zhengyi
Tang, Dianhua
Security and Communication Networks, 2022, 2022
[5] Low complexity quantum private queries protocol
State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an
710071, China
Xi'an Dianzi Keji Daxue Xuebao, 5 (33-37 and 74): : 33 - 37
[6] Private Membership Test for Bloom Filters
Meskanen, Tommi
Liu, Jian
Ramezanian, Sara
Niemi, Valtteri
2015 IEEE TRUSTCOM/BIGDATASE/ISPA, VOL 1, 2015, : 515 - 522
[7] A Private Lookup Protocol with Low Online Complexity for Secure Multiparty Computation
Laud, Peeter
INFORMATION AND COMMUNICATIONS SECURITY, ICICS 2014, 2015, 8958 : 143 - 157
[8] Unbalanced private set intersection cardinality protocol with low communication cost
Lv, Siyi
Ye, Jinhui
Yin, Sijie
Cheng, Xiaochun
Feng, Chen
Liu, Xiaoyan
Li, Rui
Li, Zhaohui
Liu, Zheli
Zhou, Li
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 102 : 1054 - 1061
[9] A Fast Single Server Private Information Retrieval Protocol with Low Communication Cost
Dong, Changyu
Chen, Liqun
COMPUTER SECURITY - ESORICS 2014, PT I, 2014, 8712 : 380 - 399
[10] Performance Test of Low-Complexity Visible Light Communication System
Luckyarno, Yakub Fahim
Namonta, Pornchanok
Cherntanomwong, Panarat
2017 2ND INTERNATIONAL CONFERENCES ON INFORMATION TECHNOLOGY, INFORMATION SYSTEMS AND ELECTRICAL ENGINEERING (ICITISEE): OPPORTUNITIES AND CHALLENGES ON BIG DATA FUTURE INNOVATION, 2017, : 84 - 89

← 1 2 3 4 5 →