{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00241008","sets":["6164:6165:6462:11854"]},"path":["11854"],"owner":"11","recid":"241008","title":["2色2n+1枚あるいは3色2n枚の対称関数プロトコル"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2024-10-15"},"_buckets":{"deposit":"1404b526-e447-4e18-92b8-e3b9883d07eb"},"_deposit":{"id":"241008","pid":{"type":"depid","value":"241008","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"2色2n+1枚あるいは3色2n枚の対称関数プロトコル","author_link":["662808","662809","662810","662811","662812","662813"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"2色2n+1枚あるいは3色2n枚の対称関数プロトコル","subitem_title_language":"ja"},{"subitem_title":"Symmetric Function Protocols with 2n + 1 Cards of a Two-Colored Deck and 2n Cards of a Three-Colored Deck","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":"Ibaraki University","subitem_text_language":"en"},{"subitem_text_value":"Ibaraki University / National Institute of Advanced Industrial Science and Technology ","subitem_text_language":"en"},{"subitem_text_value":"Kyushu University / National Institute of Advanced Industrial Science and Technology ","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/241008/files/IPSJ-CSS2024262.pdf","label":"IPSJ-CSS2024262.pdf"},"date":[{"dateType":"Available","dateValue":"2026-10-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSS2024262.pdf","filesize":[{"value":"351.9 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":"afd879d7-eed7-4bd6-9761-c90fd5dcdcbf","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":"Yoshihiro, Takahashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazumasa, Shinagawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Koji, Nuida","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":"2020年にRuangwises-Itoh (TAMC 2020)は対称関数　f:{0,1}n→Rに対する2n+2枚の有限時間プロトコルを提案した．2024年にTakahashi et al.(APKC 2024)は，通常の2色カードではなく多色カードを用いるというアイディアにより，2n+1枚の3色カードを用いた有限時間プロトコルと，2n枚の4色カードを用いたLas Vegasプロトコルを提案した．現在までのところ，2n+1枚の2色カードを用いたプロトコルと，2n枚の2色/3色カードを用いたプロトコルの存在については，有限時間とLas Vegasのどちらの設定においても未解決問題である．本論文では，2n+1枚の2色カードを用いたLas Vegasプロトコルと有限時間プロトコルを提案する．ただし，有限時間プロトコルの方はn≥ 6のときに動作するプロトコルである．また，2n枚の3色カードを用いたLas Vegasプロトコルについて，ランダムカットのみを用いるものと，ランダムカットとランダム二等分割カットを両方用いるものをそれぞれ提案する．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This study deals with card-based cryptographic protocols for symmetric functionsf:{0,1}n→R with  a finite set R. In 2020, Ruangwises-Itoh (TAMC 2020) proposed a finite-runtime protocol using 2n+2 cards. In 2024, Takahashi et al.(APKC 2024) proposed a (2n+1)-card finite-runtime protocol using a 3-colored deck and a 2n-card Las Vegas protocol using a 4-colored deck. Up until now, there are no (2n+1)-card finite-runtime protocol using a 2-colored deck and no 2n-card protocol using a 2-colored/3-colored deck in both finite-runtime and Las Vegas setting. In this paper, we propose (2n+1)-card protocols using a 2-colored deck in both finite-runtime and Las Vegas setting. Here, the finite-time protocol works for n ≥ 6 while the Las Vegas protocol works for any n. We also propose 2n-card Las Vegas protocols using a 3-colored deck, one using only random cuts and one using both random cuts and random bisection cuts, respectively.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1965","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2024論文集"}],"bibliographicPageStart":"1958","bibliographicIssueDates":{"bibliographicIssueDate":"2024-10-15","bibliographicIssueDateType":"Issued"}}]},"relation_version_is_last":true,"weko_creator_id":"11"},"updated":"2025-03-06T06:12:42.814508+00:00","created":"2025-01-19T01:45:31.578932+00:00","id":241008}