{"id":234248,"updated":"2025-01-19T09:51:05.374443+00:00","links":{},"created":"2025-01-19T01:35:58.788948+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00234248","sets":["1164:4088:11480:11609"]},"path":["11609"],"owner":"44499","recid":"234248","title":["数独に対するシャッフル2回以下のゼロ知識証明プロトコルに関する一考察"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-05-23"},"_buckets":{"deposit":"842c215d-9253-4ac1-bde5-c42865719fee"},"_deposit":{"id":"234248","pid":{"type":"depid","value":"234248","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"数独に対するシャッフル2回以下のゼロ知識証明プロトコルに関する一考察","author_link":["637978","637979"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"数独に対するシャッフル2回以下のゼロ知識証明プロトコルに関する一考察"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"CSEC1","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2024-05-23","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東北大学大学院情報科学研究科"},{"subitem_text_value":"東北大学大学院情報科学研究科／東北大学サイバーサイエンスセンター"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Tohoku University / Cyberscience Center, Tohoku University","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/234248/files/IPSJ-IOT24065011.pdf","label":"IPSJ-IOT24065011.pdf"},"date":[{"dateType":"Available","dateValue":"2026-05-23"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-IOT24065011.pdf","filesize":[{"value":"950.0 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":"43"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"c7810e70-c2a6-4616-a4f4-b1a07ea3f3f7","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 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":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12326962","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-8787","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"2007 年に Gradwhol らは数独に対するカードベースのゼロ知識証明プロトコルを構築し，2018 年に Sasaki らによって健全性エラーのないプロトコルが，2021 年に Ruangwises によってトランプカードを用いるプロトコルが考案された．昨年の FCT 2023 において著者らは UNO を用いてシャッフル 16 回のプロトコルを提案した．その後，CSS 2023 において佐々木らはシャッフル 3 回のプロトコルを提案した．今年に入り SCIS 2024 において著者らは，佐々木らのプロトコルを改変し，シャッフル 2 回のプロトコルを提案した（カード枚数は 324 枚）．本稿では，シャッフル回数 2 回を保ったままカード枚数を削減したプロトコルを紹介する．具体的には，ブロックに対応するカードを使用しないことと，（閉シャッフルではない）複雑なシャッフルを許容することで，カード枚数を 243 枚に削減する．一方，シャッフル 1 回のプロトコルの構築について，数独パズルを SAT のインスタンスに変換し，Shinagawa-Nuida のカードベースの Garbled Circuit の手法を適用することで，理論的にはシャッフル 1 回のゼロ知識証明プロトコルを構成できることはすぐに分かる．本稿では実際にそのような変換と適用を行うとした場合に，必要なカード枚数について検討する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告インターネットと運用技術（IOT）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-05-23","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"11","bibliographicVolumeNumber":"2024-IOT-65"}]},"relation_version_is_last":true,"weko_creator_id":"44499"}}