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
peer reviewedClassical Bloom filters may be used to elegantly check if an element e belongs to a set...
International audienceGroup membership verification checks if a biometric trait corresponds to one m...
Privacy-preserving techniques for processing sets of information have attracted the research communi...
We study the problem of running a set membership test in private manner. We require that a client...
This thesis focuses on the private membership test (PMT) problem and presents three single server pr...
We introduce a practical method to perform private membership tests. In this method, clients are abl...
This thesis focuses on the private membership test (PMT) problem and presents three single server pr...
In the area of cloud computing, judging the fulfillment of service-level agreements on a technical l...
The issue of privacy becomes more and more important. On the other hand, online collaboration among ...
Bloom filters are widely used in networking and computing to accelerate membership checking. In many...
Abstract. In this paper, we propose a privacy-preserving variant of Bloom-filters. The Bloom-filter ...
We propose in this work to solve privacy preserving set relations performed by a third party in an o...
Abstract. Bloom filters provide a space- and time-efficient mean to check the inclusion of an elemen...
Part 3: Privacy-Preserving Data Applications IInternational audienceBloom filters provide a space- a...
International audienceIn this paper, we consider the scenario in which the profile of a user is repr...
peer reviewedClassical Bloom filters may be used to elegantly check if an element e belongs to a set...
International audienceGroup membership verification checks if a biometric trait corresponds to one m...
Privacy-preserving techniques for processing sets of information have attracted the research communi...
We study the problem of running a set membership test in private manner. We require that a client...
This thesis focuses on the private membership test (PMT) problem and presents three single server pr...
We introduce a practical method to perform private membership tests. In this method, clients are abl...
This thesis focuses on the private membership test (PMT) problem and presents three single server pr...
In the area of cloud computing, judging the fulfillment of service-level agreements on a technical l...
The issue of privacy becomes more and more important. On the other hand, online collaboration among ...
Bloom filters are widely used in networking and computing to accelerate membership checking. In many...
Abstract. In this paper, we propose a privacy-preserving variant of Bloom-filters. The Bloom-filter ...
We propose in this work to solve privacy preserving set relations performed by a third party in an o...
Abstract. Bloom filters provide a space- and time-efficient mean to check the inclusion of an elemen...
Part 3: Privacy-Preserving Data Applications IInternational audienceBloom filters provide a space- a...
International audienceIn this paper, we consider the scenario in which the profile of a user is repr...
peer reviewedClassical Bloom filters may be used to elegantly check if an element e belongs to a set...
International audienceGroup membership verification checks if a biometric trait corresponds to one m...
Privacy-preserving techniques for processing sets of information have attracted the research communi...