{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00222918","sets":["1164:5251:10854:11079"]},"path":["11079"],"owner":"44499","recid":"222918","title":["関数型暗号を用いた秘匿配送マッチングのTEEによる実現"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-12-15"},"_buckets":{"deposit":"4128f27b-7669-4b7f-9da5-8b1965c87081"},"_deposit":{"id":"222918","pid":{"type":"depid","value":"222918","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"関数型暗号を用いた秘匿配送マッチングのTEEによる実現","author_link":["585544","585546","585545","585543","585542","585541"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"関数型暗号を用いた秘匿配送マッチングのTEEによる実現"},{"subitem_title":"Function Encryption Secret Delivery Matching System Using TEE","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-12-15","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学／(株)日立製作所"},{"subitem_text_value":"大阪大学"},{"subitem_text_value":"大阪大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Osaka University / Hitachi, Ltd.","subitem_text_language":"en"},{"subitem_text_value":"Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Osaka University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/222918/files/IPSJ-EIP22098001.pdf","label":"IPSJ-EIP22098001.pdf"},"date":[{"dateType":"Available","dateValue":"2024-12-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-EIP22098001.pdf","filesize":[{"value":"820.7 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":"26"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"2719bfa0-3af4-45c4-aceb-25f59275309f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"古家, 直樹"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"矢内, 直人"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"藤原, 融"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Naoki, Furuya","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Naoto, Yanai","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Toru, Fujiwara","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11238429","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8647","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"物流業界では，トラック不足から荷主のオーダを余裕のある配送業者の配送ルートの途中に割り当てる配送マッチングが行われている．荷主のオーダと配送業者のルート情報には，出発地・到着地の所在地などの機微情報が含まれる．本研究ではサービス提供者に対してオーダとルート情報を秘匿する秘匿配送マッチングを提案する．秘匿計算の手法には準同型暗号等があるが，処理速度の課題がある．そこで本研究では，処理時間の課題に対して，TEE（Trusted Execution Environment）によって任意の演算が可能な関数型暗号を実現し，秘匿配送マッチングに適用することを提案する．TEE として Intel SGX を用いて処理時間とセキュリティの評価を行った．配送業者 255 社が参加するマッチングを約 1.9 秒で実施でき，提案手法の有効性を確認した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告電子化知的財産・社会基盤（EIP）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-12-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2022-EIP-98"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T13:34:18.627734+00:00","created":"2025-01-19T01:22:51.029451+00:00","links":{},"id":222918}