{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00201346","sets":["6164:6165:6462:10022"]},"path":["10022"],"owner":"44499","recid":"201346","title":["ノンインタラクティブな秘密計算上でのセット極大マッチの列挙"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-10-14"},"_buckets":{"deposit":"41d24767-a2e2-46ff-b0fa-224ee2e1030e"},"_deposit":{"id":"201346","pid":{"type":"depid","value":"201346","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"ノンインタラクティブな秘密計算上でのセット極大マッチの列挙","author_link":["492011","492010","492012","492009","492016","492013","492015","492014"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ノンインタラクティブな秘密計算上でのセット極大マッチの列挙"},{"subitem_title":"Finding All the Set-Maximal Matches over Non-Interactive Secure Computation","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"set-maximal match，non-interactive secure computation，TFHE，fully homomorphic encryption","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2019-10-14","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"理化学研究所革新知能統合研究センター／筑波大学情報学群情報科学類"},{"subitem_text_value":"理化学研究所革新知能統合研究センター"},{"subitem_text_value":"理化学研究所革新知能統合研究センター"},{"subitem_text_value":"理化学研究所革新知能統合研究センター／筑波大学大学院システム情報工学研究科コンピュータサイエンス専攻"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"RIKEN Center for Advanced Intelligence Project / University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"RIKEN Center for Advanced Intelligence Project","subitem_text_language":"en"},{"subitem_text_value":"RIKEN Center for Advanced Intelligence Project","subitem_text_language":"en"},{"subitem_text_value":"RIKEN Center for Advanced Intelligence Project / University of Tsukuba","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/201346/files/IPSJCSS2019053.pdf","label":"IPSJCSS2019053.pdf"},"date":[{"dateType":"Available","dateValue":"2021-10-14"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJCSS2019053.pdf","filesize":[{"value":"462.5 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":"02d6e5c4-ed49-4acc-9732-513066844f77","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":[{}]},{"creatorNames":[{"creatorName":"佐久間, 淳"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuki, Koike","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takaaki, Nishimoto","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yasuo, Tabei","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Jun, Sakuma","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":"本論文ではセット極大マッチ問題と呼ばれる文字列の問題をノンインタラクティブな秘密計算上で効率良く解決するアルゴリズムを提案する．セット極大マッチ問題とは，パターン文字列と文字列集合が与えられた時，集合中の文字列とパターン文字列が共通の部分文字列を持つ区間の内，極大なものを全て列挙する問題である．この問題は遺伝学分野において関心を持たれている．提案手法が先行研究に比べ，理論計算量・実測値双方において漸近的に高速である事も示す．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we propose an efficient non-interactive privacy-preserving algorithm for the set-maximal match problem. The set-maximal match problem is, given a pattern string and a set of strings, to enumerate all of the maximal segments in which the pattern and some string in the set have the same substring. The motivation of this problem arises from genetics. We show our method runs asymptotically faster than the existing methods in both of theoretical time complexity and experiments.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"372","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2019論文集"}],"bibliographicPageStart":"365","bibliographicIssueDates":{"bibliographicIssueDate":"2019-10-14","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2019"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":201346,"updated":"2025-01-19T21:04:51.386987+00:00","links":{},"created":"2025-01-19T01:04:37.191686+00:00"}