Research Article
Outsourcing Set Intersection Computation Based on Bloom Filter for Privacy Preservation in Multimedia Processing
Participants: , Server | Input: inputs query set | ; Server inputs the Bloom filter | set of intersection . | Output: gets query results | , if , then data ; | otherwise . | Step 1. Server generates random Bloom filter | set and Bloom filter set pair | following the steps below. | for () | | ; | ; | | Step 2. generates query Bloom filter set | according to query set . | for () | ; | for () | | for () | | ; | | | Step 3. and Server implement oblivious | transfer protocol . is set to be a | Receiver and Server is set to be a Sender. The | input of is while the input of Server | is . After the oblivious transfer protocol | is completed, gets the set . When | , ; when | , . | Step 4. checks whether each element of | is in the intersection following the steps | below. | for () | | ; | for () | | | | if ((mod2) == 0) | | if () | ; | else | ; | | else | | if () | ; | else | ; | | |
|