Fig. 5
From: BLOOM: BLoom filter based oblivious outsourced matchings

Query time of FHE-BLOOM grows linearly with exponentially decreasing p (note the logarithmic x-axis)
From: BLOOM: BLoom filter based oblivious outsourced matchings
Query time of FHE-BLOOM grows linearly with exponentially decreasing p (note the logarithmic x-axis)