Research Article
Analysis and Evaluation of Schemes for Secure Sum in Collaborative Frequent Itemset Mining across Horizontally Partitioned Data
Table 1
Comparative analysis for schemes to evaluate secure sum for PPDFIM.
| Symmetric key based scheme based on [15] | Shamir’s secret sharing (NoTP model) based on [11, 14] | Shamir’s secret sharing (STTP model) based on [14] | Paillier based scheme for secure sum [7] |
| modular additions and generation of modular addition pseudorandom streams | Computation is done in the same field as the secret. | Computation is done in the same field as the secret. | It requires expensive operations: modular exponentiation of large numbers (1000s of bits). | Communication cost: —Phase 1 and Phase 2 | Communication cost: —Phase 1 and Phase 2 | Communication cost: —Phase 1; —Phase 2 | Communication cost: —Phase 1 and Phase 2 | Information theoretically secure | Information theoretically secure | Information theoretically secure | Computationally secure |
|
|