{"created":"2025-01-19T01:04:46.161809+00:00","updated":"2025-01-19T21:00:06.419121+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00201507","sets":["6164:6165:6462:10022"]},"path":["10022"],"owner":"44499","recid":"201507","title":["一般化とランダム化を組み合わせた匿名化手法の提案及びその具体的な識別リスク計算方法の検討"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-10-14"},"_buckets":{"deposit":"73a53c7b-5393-4bc3-b59f-bac3d5e78bb8"},"_deposit":{"id":"201507","pid":{"type":"depid","value":"201507","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"一般化とランダム化を組み合わせた匿名化手法の提案及びその具体的な識別リスク計算方法の検討","author_link":["493127","493129","493130","493128"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"一般化とランダム化を組み合わせた匿名化手法の提案及びその具体的な識別リスク計算方法の検討"},{"subitem_title":"Proposal of Anonymization Method by Generalization and Randomization and How Much Is Explicit Identification Risk?","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"匿名化，識別推定リスク","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":"NTT セキュアプラットフォーム研究所"},{"subitem_text_value":"NTT セキュアプラットフォーム研究所"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Secure Platform Laboratories","subitem_text_language":"en"},{"subitem_text_value":"NTT Secure Platform Laboratories","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/201507/files/IPSJCSS2019214.pdf","label":"IPSJCSS2019214.pdf"},"date":[{"dateType":"Available","dateValue":"2021-10-14"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJCSS2019214.pdf","filesize":[{"value":"882.4 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":"5fb08a7b-0615-494b-9c39-287e44d1922e","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":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Satoshi, Hasegawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takayuki, Miura","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":"本研究では, 一般化とランダム化を組み合わせた匿名化手法を提案する. 一般化とランダム化を組み合わせた手法はNP-困難な問題であるため, ヒューリスティック最適値探索アルゴリズムを用いることで, 実用的な時間で実行可能なアルゴリズムを示す.    加えてランダム化を施した際の具体的な識別リスクを計算する方法を提案する. 通常時間計算量が階乗オーダ必要なアルゴリズムを指数オーダに改善したことを報告する.","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we propose an anonymization method that combines generalization and randomization.Because the method of combining generalization and randomization is a N P-hardness problem,by using a heuristic optimal value search algorithm, an algorithm that can be executed in a practical time is shown. We propose a method to calculate explicit identification risk of randomized. We denote that the algorithm that requires O(N!) for naive method has been improved to 2N.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1527","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2019論文集"}],"bibliographicPageStart":"1520","bibliographicIssueDates":{"bibliographicIssueDate":"2019-10-14","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2019"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":201507,"links":{}}