2020
DOI: 10.48550/arxiv.2008.08134
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Differentially Private Sketches for Jaccard Similarity Estimation

Abstract: This paper describes two locally-differential private algorithms for releasing user vectors such that the Jaccard similarity between these vectors can be efficiently estimated. The basic building block is the well known MinHash method. To achieve a privacy-utility trade-off, Min-Hash is extended in two ways using variants of Generalized Randomized Response and the Laplace Mechanism. A theoretical analysis provides bounds on the absolute error and experiments show the utility-privacy trade-off on synthetic and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 16 publications
(37 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?