{"created":"2025-01-18T23:45:35.852461+00:00","updated":"2025-01-21T12:00:07.964183+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00099596","sets":["1164:6389:7521:7522"]},"path":["7522"],"owner":"11","recid":"99596","title":["P2P型ネットワークにおけるハッシュ木構成法の評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-03-20"},"_buckets":{"deposit":"82ed4ce8-2fa7-4058-ac02-77a431621563"},"_deposit":{"id":"99596","pid":{"type":"depid","value":"99596","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"P2P型ネットワークにおけるハッシュ木構成法の評価","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"P2P型ネットワークにおけるハッシュ木構成法の評価"},{"subitem_title":"Evaluation of hash tree construction on P2P networks","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2014-03-20","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"広島市立大学大学院情報科学研究科"},{"subitem_text_value":"広島市立大学大学院情報科学研究科"},{"subitem_text_value":"広島市立大学大学院情報科学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City University Graduate School","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City University Graduate School","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City University Graduate School","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/99596/files/IPSJ-SPT14008037.pdf"},"date":[{"dateType":"Available","dateValue":"2100-01-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SPT14008037.pdf","filesize":[{"value":"2.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"46"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"ed733ecd-83bc-4797-9bc6-a3642b6c098a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 by the Institute of Electronics, Information and Communication Engineers\nThis SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"淺枝, 智之"},{"creatorName":"樋口, 太平"},{"creatorName":"双紙, 正和"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tomoyuki, Asaeda","creatorNameLang":"en"},{"creatorName":"Taihei, Higuchi","creatorNameLang":"en"},{"creatorName":"Masakazu, Soshi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12628305","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"近年，データの送受信に基地局となるサーバを用いず，通信端末であるピア同士で通信を行う P2P という通信方法が研究されている．第三者機関を経由せず通信可能なため，認証局によるデータの検証が困難である．そこで，ハシシュ値を用いたデータ検証アルゴリズムであるハシシュ木を P2P 型ネットワークを実現する代表的な方法である Chord に構築する手法を提案された．未知の IP アドレスへメッセージをルーティングするためにオーバーレイネットワークを構築し，DHT により特定の論理アドレスを持つノードへのルーティングを実現している．しかし，実際にメッセージの通信を行うのは下層のレイヤーであり，オーバーレイネットワーク上でのメッセージ数が最適であっても，コンピュータネットワークでのメッセージ数が最適であるとは限らない．そこで本研究では，コンピュータネットワークでのメッセージ数は，ネットワーク全体への負荷に直結するほか，メッセージ数が増えることで構築までにかかる時間も増加するため，先に提案した 3 つのアルゴリズムについて，各手法のコンピュータネットワークにおけるメッセージ数を調査する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In recent years communication systems called P2P, where the peers communicate with one another without the support of base station servers, have been extensively studied. However, unfortunately, it is this ab sence of central servers that makes it difficult to authenticate each peer in a secure manner. In order to solve the problem, in this paper we consider efficient authentication methods with hash trees on P2P systems.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告セキュリティ心理学とトラスト（SPT）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2014-03-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"37","bibliographicVolumeNumber":"2014-SPT-8"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":99596,"links":{}}