{"created":"2025-01-19T00:56:03.772387+00:00","updated":"2025-01-20T01:23:21.209985+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00190069","sets":["6164:6165:6640:9508"]},"path":["9508"],"owner":"11","recid":"190069","title":["秘匿検索の頻度分析対策としての複数DB活用について"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-06-21"},"_buckets":{"deposit":"728022f3-70c0-40c0-9d65-53c82b327967"},"_deposit":{"id":"190069","pid":{"type":"depid","value":"190069","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"秘匿検索の頻度分析対策としての複数DB活用について","author_link":["434216","434214","434213","434215"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"秘匿検索の頻度分析対策としての複数DB活用について"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"暗号,検索可能暗号,頻度分析攻撃,分散DB","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2017-06-21","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":"三菱電機"},{"subitem_text_value":"三菱電機"}]},"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/190069/files/IPSJ-DICOMO2017064.pdf","label":"IPSJ-DICOMO2017064.pdf"},"date":[{"dateType":"Available","dateValue":"2019-06-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DICOMO2017064.pdf","filesize":[{"value":"538.1 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"5f47d240-75bb-4038-864a-49c4058ca86a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2017 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"伊藤, 隆"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"平野, 貴人"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"森, 拓海"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"服部, 充洋"}],"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":"秘匿検索（検索可能暗号）は，ユーザがデータセンタに登録した暗号化データを，暗号化したままで検索するための技術である．秘匿検索では，暗号化キーワードの頻度からキーワードを推定する頻度分析攻撃に対抗するため，確率的暗号を用いるなどして頻度情報を隠ぺいする．しかし，秘匿検索システムが運用されて検索が行われると，キーワードの同一性や頻度情報が徐々に漏れるため，最終的には頻度分析攻撃が可能になるという問題があった．本論文では，暗号化データを複数データセンタのいずれかに振り分け，この際各データセンタにおける頻度分布が撹乱されるよう工夫することで，効率面でのオーバーヘッドを生じることなく，頻度分析対策を実現する方式を提案する．また，提案方式による頻度分析耐性の向上を，攻撃者によるキーワード推定の的中率に基づいて評価した結果，都道府県名を秘匿する例で的中率を78%から17%に低減できるなど，安定した効果を持つことが確認できた．","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"451","bibliographic_titles":[{"bibliographic_title":"マルチメディア，分散協調とモバイルシンポジウム2017論文集"}],"bibliographicPageStart":"444","bibliographicIssueDates":{"bibliographicIssueDate":"2017-06-21","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2017"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":190069,"links":{}}