Advances, Systems and Applications
Table 1 Notations and descriptions
N | The length of the data set |
pk, sk | B’s public and private keys |
\(BF_{B}\)[i] | B generated Bloom filter |
\(C_{i}\) | Ciphertext generated after b’s key is added to the dense BF |
\(b_{Ai}\),\(b_{Bi}\) | The number generated when the ith bit in the original set of A or B is encoded with 0-1 |
\(h_{k-1}(b_{Ai})\) | The k-1th hash function is used to compute the set encoded by A |
\(C_{i}^*\) | The new set extract from \(C_{i}\) |
Enpk, Decsk | Encryption using the public key pk and decryption using the private key sk |
T | The intersection of A and B |