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

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