@inproceedings{oai:ipsj.ixsq.nii.ac.jp:00077982,
 author = {青木, 良樹 and 菊池, 浩明 and 寺田, 雅之 and 石井, 一彦 and 関野, 公彦 and Yoshiki, Aoki and Hiroaki, Kikuchi and Masayuki, Terada and Kazuhiko, Ishii and Kimihiko, Sekino},
 book = {コンピュータセキュリティシンポジウム2011 論文集},
 issue = {3},
 month = {Oct},
 note = {本論文は三者間で垂直分割されたデータベース環境において，互の値を秘匿したまま通信効率の良い一致度の秘匿分散計算方式を提案する．n人のユーザ間の類以度を計算する時，従来手法ではnの二乗個の暗号文を通信する必要があり非常に効率が悪い．そこで，一致度という類以度の推移性を利用し，このn^2のコストを，nに削減する近似方法を提案し，評価を行う．, This paper proposes a new communication efficient distributed concordance evaluation in dataset vertical partition multiple parties. In conventional method,  compute transitivity similarity between n users. We must send n^2 ciphertexts, which is very inefficient in communication. To solve the problem, we use a transitivity of concordance measure in order to reduce by O(n). We evaluate our scheme in terms of quantity of disclosed private data.},
 pages = {510--515},
 publisher = {情報処理学会},
 title = {垂直分割における通信効率の良い一致度の秘匿分散計算},
 volume = {2011},
 year = {2011}
}