{"created":"2025-01-19T01:04:36.544359+00:00","updated":"2025-01-19T21:05:13.023635+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00201335","sets":["6164:6165:6462:10022"]},"path":["10022"],"owner":"44499","recid":"201335","title":["秘密分散に基づく秘匿全文検索"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-10-14"},"_buckets":{"deposit":"d11c7088-7819-4e3f-8274-4cbdf41fe900"},"_deposit":{"id":"201335","pid":{"type":"depid","value":"201335","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"秘密分散に基づく秘匿全文検索","author_link":["491944","491943","491940","491941","491939","491942"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"秘密分散に基づく秘匿全文検索"},{"subitem_title":"Privacy-Preserving Full-Text Search Based on Secret Sharing","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"全文検索，秘密分散，FM-index，マルチパーティ計算，プライバシ保護","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2019-10-14","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":"早稲田大学"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Waseda University","subitem_text_language":"en"},{"subitem_text_value":"National Institute of Advanced Industrial Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Waseda University","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/201335/files/IPSJCSS2019042.pdf","label":"IPSJCSS2019042.pdf"},"date":[{"dateType":"Available","dateValue":"2021-10-14"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJCSS2019042.pdf","filesize":[{"value":"875.8 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":"30"},{"tax":["include_tax"],"price":"0","billingrole":"46"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"cfc966b3-164e-48cf-9a44-1d3db50e5d98","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2019 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":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yoshiki, Nakagawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Satsuya, Ohata","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kana, Shimizu","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_18_relation_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_select":"NCID","subitem_relation_type_id_text":"ISSN　1882-0840"}}]},"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":"秘密分散法に基づき，クエリと文書を互いに秘匿したまま全文検索する手法を提案する．計算には，クエリ保有者，文書保有者，結託の恐れのない二人の委託計算者が参加する．クエリ保有者と文書保有者のそれぞれが事前にクエリと文書のシェアを作って委託計算者に送り，委託計算者は検索結果のみをクエリ保有者に返す．提案手法では，FM-indexと呼ばれる全文索引により文書を検索しやすい構造に変換する．これにより，委託計算で必要となる計算量，通信量，通信ラウンド数の全てが文書の長さに依存せず，クエリの長さのみに比例する．提案手法を実装し，文書とクエリの長さがそれぞれ1000万と100のゲノム配列検索を行ったところ，委託計算者の計算時間は1CPUの利用でわずか0.30秒，ラウンド数は202，通信量は7.13KBであった．文書保有者の事前計算は文書長とクエリ長の積に線形だが，並列化により効率的に計算できるため，実装上の工夫をせずとも10CPUの利用で15分以内に留まる．提案手法は文字列検索の他に，オートマトンによるパターンマッチや木構造の走査等にも応用でき，多様なデータ検索の高速化に貢献することが期待される．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We propose a secure full-text search protocol based on secret sharing. We consider a case in which a database holder and a querier send shares of the database and the query to two non-colluding computing nodes and they return the result to the querier. By using an efficient full-text index called FM-index, all the time, communication and round complexities of the protocol become linear to the length of query and do not depend on the length of database. In the experiment using a genomic sequence of length 10 million and a query sequence of length 100, the CPU time, communication round, and data transfer size for a single query were only 0.3s, 202 and 7.13KB. The building block of the protocol can also be applied to other applications such as a deterministic finite automaton matching and a tree traversal, and is expected to contribute to various real word problems.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"296","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2019論文集"}],"bibliographicPageStart":"289","bibliographicIssueDates":{"bibliographicIssueDate":"2019-10-14","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2019"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":201335,"links":{}}