{"created":"2025-01-19T01:45:25.225191+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00240941","sets":["6164:6165:6462:11854"]},"path":["11854"],"owner":"11","recid":"240941","title":["カードベース秘匿マッチングと多入力AND秘密計算"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2024-10-15"},"_buckets":{"deposit":"268c79c8-2589-406b-a20c-3a5b52c7cc62"},"_deposit":{"id":"240941","pid":{"type":"depid","value":"240941","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"カードベース秘匿マッチングと多入力AND秘密計算","author_link":["662341","662342","662343","662344","662345","662346"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"カードベース秘匿マッチングと多入力AND秘密計算","subitem_title_language":"ja"},{"subitem_title":"Card-Based Private Matching and Secure Multi-Input AND Computation","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"カードベース暗号，秘密計算，秘匿共通集合計算, マルチパーティ計算","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2024-10-15","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":"National Institute of Technology, Fukushima College","subitem_text_language":"en"},{"subitem_text_value":"Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"National Institute of Advanced Industrial Science and Technology (AIST)","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/240941/files/IPSJ-CSS2024195.pdf","label":"IPSJ-CSS2024195.pdf"},"date":[{"dateType":"Available","dateValue":"2026-10-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSS2024195.pdf","filesize":[{"value":"337.2 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":"7ab31562-2d09-497b-a962-51706704681b","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 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":"Koichi, Koizumi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takaaki, Mizuki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Goichiro, Hanaoka","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"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":"2024年にDoiらはPrivate Set Intersection (PSI)を実現するカードベース暗号プロトコルをいくつか考案している．その中のshufPSI-3と呼ばれるプロトコルでは，Aliceのカード列とBobのカード列，そしてインデックスを表すカード列を並べ，ダミーカードを巧みに用いて，パイルスクランブルシャッフル1回でPSIを実現している．本稿では，この既存プロトコルにおけるアイデア・技術を応用して，(i) Private Set Intersection Cardinality (PSI-CA)プロトコルがほぼ自明に構成できることを述べ，(ii)秘匿マッチングを実現するプロトコルを構築し，(iii)入力数の対数の回数のシャッフルを用いた新しい多入力AND秘密計算プロトコルを提案する．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In 2024, Doi et al. devised several card-based cryptographic protocols that perform Private Set Intersection (PSI). One of these protocols, called shufPSI-3, realizes PSI with a single pile-scramble shuffle by cleverly using dummy cards after arranging Alice's card sequence, Bob's card sequence, and cards representing indexes. In this paper, we apply the ideas and techniques in this existing protocol to (i) show that a Private Set Intersection Cardinality (PSI-CA) protocol can be constructed almost trivially, (ii) construct protocols that achieve private matching, and (iii) design a new secure multi-input AND computation protocol using a logarithmic number of shuffles in terms of the number of inputs.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1472","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2024論文集"}],"bibliographicPageStart":"1465","bibliographicIssueDates":{"bibliographicIssueDate":"2024-10-15","bibliographicIssueDateType":"Issued"}}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":240941,"updated":"2025-03-06T05:57:52.459587+00:00","links":{}}