{"created":"2025-01-19T01:18:13.795491+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00217764","sets":["1164:2592:10824:10923"]},"path":["10923"],"owner":"44499","recid":"217764","title":["一次元折り紙の計算量的複雑性とその電子署名方式への応用"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-05-12"},"_buckets":{"deposit":"9a67707a-802b-4f3b-8e95-50da08d67ccf"},"_deposit":{"id":"217764","pid":{"type":"depid","value":"217764","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"一次元折り紙の計算量的複雑性とその電子署名方式への応用","author_link":["564831","564827","564828","564829","564826","564830","564833","564832"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"一次元折り紙の計算量的複雑性とその電子署名方式への応用"},{"subitem_title":"Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-05-12","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"北陸先端科学技術大学院大学"},{"subitem_text_value":"茨城工業高等専門学校"},{"subitem_text_value":"北陸先端科学技術大学院大学"},{"subitem_text_value":"北陸先端科学技術大学院大学"}]},"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/217764/files/IPSJ-AL22188001.pdf","label":"IPSJ-AL22188001.pdf"},"date":[{"dateType":"Available","dateValue":"2024-05-12"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL22188001.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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"c3a8103c-f79e-4004-a394-d0d18312bf38","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_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Junnosuke, Hoshido","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tsutomu, Ansai","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tonan, Kamata","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ryuhei, Uehara","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","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-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本稿は，折り目幅復元問題と呼ばれる問題を提案し，その複雑性を示すとともに，電子署名方式への応用を提案するものである．長さ n+1 の短冊状の紙を等間隔に刻まれた n 本の折り目に従って長さ 1 に折り畳んだとき，各折り目に挟まる紙の枚数を折り目幅とよぶ．折り目幅復元問題とは，折り目幅の情報が入力として与えられたとき，それに矛盾しない折り畳み状態が存在するかどうかを問う問題である．これは折り目幅問題と関連して得られる，新たな一次元折り紙問題である．問題には，それぞれの折り目の向きが与えられているか否か，折り目幅の情報が全て与えられているか否か，などの条件設定が存在する．ここでは，それらの内のいくつかの場合について，NP 困難性を証明する．さらに，問題の計算複雑性を利用した新たな電子署名方式を提案する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-05-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2022-AL-188"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":217764,"updated":"2025-01-19T15:22:30.444326+00:00","links":{}}