{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00217070","sets":["1164:3925:10844:10845"]},"path":["10845"],"owner":"44499","recid":"217070","title":["対称論理関数に対する最小枚数プロトコルの改良"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-03-03"},"_buckets":{"deposit":"2a26188e-0757-4cf6-a7e2-626054a20337"},"_deposit":{"id":"217070","pid":{"type":"depid","value":"217070","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"対称論理関数に対する最小枚数プロトコルの改良","author_link":["561618","561620","561619","561617"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"対称論理関数に対する最小枚数プロトコルの改良"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"セキュアプロトコル","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2022-03-03","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東北大学"},{"subitem_text_value":"東北大学"},{"subitem_text_value":"電気通信大学／産業技術総合研究所"},{"subitem_text_value":"電気通信大学／産業技術総合研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tohoku Uniersity","subitem_text_language":"en"},{"subitem_text_value":"Tohoku Uniersity","subitem_text_language":"en"},{"subitem_text_value":"The University of Electro-Communications / Institute of Advanced Industrial Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"The University of Electro-Communications / Institute of Advanced Industrial Science and Technology","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/217070/files/IPSJ-CSEC22096034.pdf","label":"IPSJ-CSEC22096034.pdf"},"date":[{"dateType":"Available","dateValue":"2024-03-03"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSEC22096034.pdf","filesize":[{"value":"1.2 MB"}],"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":"44"}],"accessrole":"open_date","version_id":"1e04c262-bda2-45f9-988a-b701309c697a","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":[{}]},{"creatorNames":[{"creatorName":"水木, 敬明"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11235941","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-8655","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"カードベース暗号の研究分野において最も重要な問題の一つに「最小枚数のカードによるプロトコルの構成」がある．すなわち，1 ビットを 2 枚のカードで符号化し，n 個のビットを示す 2n 枚のカード列だけが入力として与えられたときに，どのような論理関数が秘密計算できるか，という問題である．著者らは SCIS 2022 において，n 変数の対称論理関数に対する最小枚数のプロトコルを与えたが，n が 14 以上である必要があり，かつ特殊なケースの使用を必要とするという，制約の大きいものであった．そこで本稿では，これらの制約を緩和するプロトコルの構築を試みる．具体的には，本稿で提案するプロトコルは特殊なケースの使用を必要とせず，n は 8 以上であればよい．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告コンピュータセキュリティ（CSEC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-03-03","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"34","bibliographicVolumeNumber":"2022-CSEC-96"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":217070,"updated":"2025-01-19T15:38:01.861335+00:00","links":{},"created":"2025-01-19T01:17:34.642939+00:00"}