{"updated":"2025-01-22T23:51:36.435863+00:00","links":{},"id":16454,"created":"2025-01-18T22:49:43.291364+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00016454","sets":["934:935:938:941"]},"path":["941"],"owner":"1","recid":"16454","title":["定理証明器による電子現金プロトコルの検証"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-06-26"},"_buckets":{"deposit":"53451a19-4e2e-4a04-8b08-1e25deceb611"},"_deposit":{"id":"16454","pid":{"type":"depid","value":"16454","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"定理証明器による電子現金プロトコルの検証","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"定理証明器による電子現金プロトコルの検証"},{"subitem_title":"Verification of Electronic Cash Protocol Using a Theorem Prover","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"発表概要","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2008-06-26","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"関西学院大学"},{"subitem_text_value":"関西学院大学"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Kwansei Gakuin University","subitem_text_language":"en"},{"subitem_text_value":"Kwansei Gakuin 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/16454/files/IPSJ-TPRO0101007.pdf"},"date":[{"dateType":"Available","dateValue":"2010-06-26"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TPRO0101007.pdf","filesize":[{"value":"34.2 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"82ae44b2-99f8-4d23-97bd-49798c369949","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2008 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"安田, 武史"},{"creatorName":"高橋, 和子"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takeshi, Yasuda","creatorNameLang":"en"},{"creatorName":"Kazuko, Takahashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464814","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7802","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本発表では，定理証明器Isabelle/HOLを用いて，電子現金プロトコルを帰納的にモデル化しその仕様を検証する方法を示す．電子現金方式に要求される仕様は一般に，「完全情報化」，「安全性」，「プライバシ」，「オフライン性」，「譲渡可能性」，「分割利用可能性」の6つであり，このすべての仕様を満たす電子現金方式が提案されている．我々は，この方式の1つを帰納的手法を用いてモデル化し，「安全性」，「分割利用可能性」の仕様が満たされることを検証した．対象とする方式では，電子現金はBinary Tree Approachにより実現されており，分割利用するための操作がこの二分木上で定義されている．また，ビットコミットメントを使うことで二重使用を防止している．これらの仕組みを取り込んだデータ構造や関数を帰納的に定義した．プロトコルのモデル化は，Paulsonの帰納的アプローチに基づき，送受信イベントをトレースとしてリストに格納する形ですべて帰納的に記述した．検証においては，モデル化に対応した仕様の解釈を行った．「安全性」は「誰かが二重使用を行った場合，必ず発覚する」と解釈し，「分割利用可能性」は「ある金額から任意の金額を使用した場合，残りの金額も正当な電子現金である」と解釈し，それぞれ検証した．この結果，定理証明器を電子現金プロトコルの検証に使える可能性を示すことができた．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We show inductive modeling of an electronic cash protocol and verification that its requirements are satisfied using a theoreom prover Isabelle/HOL. It is said that an electronic cash should satisfy the following six requirements: independance, security, privacy, off-line, transferability and divisability. An electronic cash scheme that satisfies all of them has been proposed. We formalize the protocol based on this scheme. The scheme is implemented using a binary tree on which the operation for divisable use is defined. Moreover, doublespending is detected by the bit-commitment. We define the data structure and recursive functions that reflect these mechanism. In modeling a protocol, we use Paulson's inductive approach, in which each event of sending/receiving is stored as a trace. We verified the security and divisability of the six requirements. As for security, we verify the assertion that if double-spending of an electronic cash occurs, then it can be detected. As for divisability, we verify the assertion that if we use some portion of a well-defined electronic cash, then the remainder is also a well-defined one. As a result, we showed the possibility that thereom provers can be applied to verification on electronic cash protocols.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"60","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌プログラミング（PRO）"}],"bibliographicPageStart":"60","bibliographicIssueDates":{"bibliographicIssueDate":"2008-06-26","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"1"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}