{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00067301","sets":["1164:2592:5970:5971"]},"path":["5971"],"owner":"10","recid":"67301","title":["Adaptive One-Step Byzantine Consensus"],"pubdate":{"attribute_name":"公開日","attribute_value":"2010-01-19"},"_buckets":{"deposit":"df4c0a27-7774-49d8-a329-ccf3130cc1b9"},"_deposit":{"id":"67301","pid":{"type":"depid","value":"67301","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"Adaptive One-Step Byzantine Consensus","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Adaptive One-Step Byzantine Consensus"},{"subitem_title":"Adaptive One-Step Byzantine Consensus","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2010-01-19","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Nagoya Institute of Technology"},{"subitem_text_value":"Nagoya Institute of Technology"},{"subitem_text_value":"Nagoya Institute of Technology"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/67301/files/IPSJ-AL10128002.pdf"},"date":[{"dateType":"Available","dateValue":"2012-01-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL10128002.pdf","filesize":[{"value":"152.7 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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"28290c2f-a87b-4ff3-9e27-28008c5c3ca1","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2010 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Nazreen, Banu"},{"creatorName":"Taisuke, Izumi"},{"creatorName":"Koichi, Wada"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Nazreen, Banu","creatorNameLang":"en"},{"creatorName":"Taisuke, Izumi","creatorNameLang":"en"},{"creatorName":"Koichi, Wada","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"It is known that Byzantine consensus algorithms guarantee one-step decision only in favorable situations (e.g. when all processes propose the same value) and no one-step algorithm can support two-step decision. In this paper, we present a novel one-step Byzantine algorithm DEX based on the condition-based approach that circumvents the above impossibilities. Algorithm DEX is adaptive in the sense that it is sensitive to only actual number of failures, and hence achieves fast termination for large number of inputs when less number of processes are faulty. In addition, it also has double-expedition property, so that it allows two-step decision in addition to one-step decision by introducing two condition-based mechanisms running concurrently. To the best of our knowl edge, double-expedition property is a new concept introduced by this paper and DEX is the first algorithm having such a feature. Even though DEX takes four steps at worst in well-behaved runs while existing algorithms takes only three, it provides fast termination for large number inputs, which makes us to expect that our algorithm works faster in average in practical situations.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"It is known that Byzantine consensus algorithms guarantee one-step decision only in favorable situations (e.g. when all processes propose the same value) and no one-step algorithm can support two-step decision. In this paper, we present a novel one-step Byzantine algorithm DEX based on the condition-based approach that circumvents the above impossibilities. Algorithm DEX is adaptive in the sense that it is sensitive to only actual number of failures, and hence achieves fast termination for large number of inputs when less number of processes are faulty. In addition, it also has double-expedition property, so that it allows two-step decision in addition to one-step decision by introducing two condition-based mechanisms running concurrently. To the best of our knowl edge, double-expedition property is a new concept introduced by this paper and DEX is the first algorithm having such a feature. Even though DEX takes four steps at worst in well-behaved runs while existing algorithms takes only three, it provides fast termination for large number inputs, which makes us to expect that our algorithm works faster in average in practical situations.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"9","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2010-01-19","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"2010-AL-128"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:27:46.062362+00:00","updated":"2025-01-22T00:40:40.672455+00:00","id":67301}