{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00077982","sets":["6164:6165:6462:6551"]},"path":["6551"],"owner":"10","recid":"77982","title":["垂直分割における通信効率の良い一致度の秘匿分散計算"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-10-12"},"_buckets":{"deposit":"3ecc44f3-861f-4a5b-920a-d07eb28498b3"},"_deposit":{"id":"77982","pid":{"type":"depid","value":"77982","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"垂直分割における通信効率の良い一致度の秘匿分散計算","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"垂直分割における通信効率の良い一致度の秘匿分散計算"},{"subitem_title":"Communication Efficient Distributed Concordance Evaluation in Vertical Partitioning","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"秘匿計算","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2011-10-12","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東海大学"},{"subitem_text_value":"東海大学"},{"subitem_text_value":"株式会社NTTドコモ 先進技術研究所"},{"subitem_text_value":"株式会社NTTドコモ 先進技術研究所"},{"subitem_text_value":"株式会社NTTドコモ 先進技術研究所"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tokai University","subitem_text_language":"en"},{"subitem_text_value":"Tokai University","subitem_text_language":"en"},{"subitem_text_value":"NTT-DoCoMo","subitem_text_language":"en"},{"subitem_text_value":"NTT-DoCoMo","subitem_text_language":"en"},{"subitem_text_value":"NTT-DoCoMo","subitem_text_language":"en"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/77982/files/IPSJCSS2011087.pdf"},"date":[{"dateType":"Available","dateValue":"2012-10-12"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJCSS2011087.pdf","filesize":[{"value":"360.3 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"44"},{"tax":["include_tax"],"price":"30000","billingrole":"5"}],"accessrole":"open_date","version_id":"0dccdbcb-0a97-41d7-ab41-62eed9bca689","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"青木, 良樹"},{"creatorName":"菊池, 浩明"},{"creatorName":"寺田, 雅之"},{"creatorName":"石井, 一彦"},{"creatorName":"関野, 公彦"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yoshiki, Aoki","creatorNameLang":"en"},{"creatorName":"Hiroaki, Kikuchi","creatorNameLang":"en"},{"creatorName":"Masayuki, Terada","creatorNameLang":"en"},{"creatorName":"Kazuhiko, Ishii","creatorNameLang":"en"},{"creatorName":"Kimihiko, Sekino","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本論文は三者間で垂直分割されたデータベース環境において，互の値を秘匿したまま通信効率の良い一致度の秘匿分散計算方式を提案する．n人のユーザ間の類以度を計算する時，従来手法ではnの二乗個の暗号文を通信する必要があり非常に効率が悪い．そこで，一致度という類以度の推移性を利用し，このn^2のコストを，nに削減する近似方法を提案し，評価を行う．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"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.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"515","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2011 論文集"}],"bibliographicPageStart":"510","bibliographicIssueDates":{"bibliographicIssueDate":"2011-10-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2011"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:33:27.295545+00:00","updated":"2025-01-21T20:42:46.575831+00:00","id":77982}