{"created":"2025-01-19T01:04:44.333131+00:00","updated":"2025-01-19T21:01:01.777728+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00201474","sets":["6164:6165:6462:10022"]},"path":["10022"],"owner":"44499","recid":"201474","title":["表データの最適セル秘匿処理に対するマッチング攻撃とその実証的評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-10-14"},"_buckets":{"deposit":"2b865ce7-2ad2-4af7-87d1-f9394482a084"},"_deposit":{"id":"201474","pid":{"type":"depid","value":"201474","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"表データの最適セル秘匿処理に対するマッチング攻撃とその実証的評価","author_link":["492851","492852","492849","492850"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"表データの最適セル秘匿処理に対するマッチング攻撃とその実証的評価"},{"subitem_title":"Algorithmic Matching Attacks on Optimally Suppressed Tabular Data","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":"総合研究大学院大学／統計数理研究所／独立行政法人統計センター"},{"subitem_text_value":"総合研究大学院大学／独立行政法人統計センター"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"The Graduate University for Advanced Studies / The Institute of Statistical Mathematics / National Statistics Center","subitem_text_language":"en"},{"subitem_text_value":"The Graduate University for Advanced Studies / National Statistics Center","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/201474/files/IPSJCSS2019181.pdf","label":"IPSJCSS2019181.pdf"},"date":[{"dateType":"Available","dateValue":"2021-10-14"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJCSS2019181.pdf","filesize":[{"value":"683.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":"2b03377f-0165-414f-ba4d-37fa8e5436ae","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":"Kazuhiro, Minami","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yutaka, Abe","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":"The objective of the cell suppression problem (CSP) is to protect sensitive cell values in tabular data under the presence of linear relations concerning marginal sums. Previous algorithms for solving CSPs ensure that every sensitive cell has enough uncertainty on its values based on the interval width of all possible values. However, we find that every deterministic CSP algorithm is vulnerable to an adversary who possesses the knowledge of that algorithm. We devise a matching attack scheme that narrows down the ranges of sensitive cell values by matching the suppression pattern of an original table with that of each candidate table. Our experiments show that actual ranges of sensitive cell values are significantly narrower than those assumed by the previous CSP algorithms.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1290","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2019論文集"}],"bibliographicPageStart":"1283","bibliographicIssueDates":{"bibliographicIssueDate":"2019-10-14","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2019"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":201474,"links":{}}