Privacy-Preserving Data Mining in Presence of Covert Adversaries
スポンサーリンク
概要
- 論文の詳細を見る
Disclosure of the original data sets is not acceptable due to privacy concerns in many distributed data mining settings. To address such concerns, privacy-preserving data mining has been an active research area in recent years. All the recent works on privacy-preserving data mining have considered either semi-honest or malicious adversarial models, whereby an adversary is assumed to follow or arbitrarily deviate from the protocol, respectively. While semi-honest model provides weak security requiring small amount of computation and malicious model provides strong security requiring expensive computations like Non-Interactive Zero Knowledge proofs, we envisage the need for ‘covert’ adversarial model that performs in between the semi-honest and malicious models, both in terms of security guarantee and computational cost. In this paper, for the first time in data-mining area, we build efficient and secure dot product and set-intersection protocols in covert adversarial model. We use homomorphic property of Paillier encryption scheme and two-party computation of Aumann et al. to construct our protocols. Furthermore, our protocols are secure in Universal Composability framework.
論文 | ランダム
- 高齢義歯装着者の義歯への満足度に影響する要因について
- 下顎運動に随伴する体幹動揺における立位と座位の差
- 聴覚障害を持つ妊婦の情報取得の困難さに関する研究--母親学級の場面から
- 病院施設における小グループ制母親学級 (特集 あなたの施設はどうしていますか? こころとからだの出産準備)
- 少人数グループ制母親学級運営の中での助産婦の役割から