Private Membership Test Protocol with Low Communication Complexity

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.

Sara Ramezanian (University of Helsinki), Tommi Meskanen (University of Turku), Masoud Naderpour, Valtteri Niemi (University of Helsinki): Private Membership Test Protocol with Low Communication Complexity

Presented at NSS 2017, Helsinki. Lecture Notes in Computer Science, volume 10394

https://link.springer.com/chapter/10.1007/978-3-319-64701-2_3

Share on LinkedInGoogle+Tweet about this on TwitterShare on FacebookEmail to someone