| dc.contributor | 風管系 | |
| dc.creator (作者) | 謝明華 | |
| dc.date (日期) | 2019-01 | |
| dc.date.accessioned | 18-Jun-2026 13:22:45 (UTC+8) | - |
| dc.date.available | 18-Jun-2026 13:22:45 (UTC+8) | - |
| dc.date.issued (上傳時間) | 18-Jun-2026 13:22:45 (UTC+8) | - |
| dc.identifier.uri (URI) | https://ah.lib.nccu.edu.tw/item?item_id=183024 | - |
| dc.description.abstract (摘要) | 在區塊鏈 (blockchain) 中，具最長區塊的鏈 (擁有著目前最多的計算工作證明)，代表了所謂的多數決定。為了改變區塊 (block) 中的交易資料數據，攻擊者必須控制比其他誠實節點更多的計算能力。如果攻擊者可以侵入到誠實節點的系統中，則可能發生這種情況。為了分析這種事件的機率，我們提出了一種分析區塊鏈攻擊的隨機模型。該模型的建置是基於對等網絡 (P2P network) 的結構。我們假設每個誠實節點的狀態遵循兩種可能狀態（被侵佔或是正常）的馬可夫鏈。假設被侵佔的節點由攻擊者控制，其計算能力屬於攻擊者。另一方面，正常節點的計算能力屬於誠實的最長鏈。我們應用此模型來研究攻擊者控制多數決定的機率和此類事件的持續時間。此外，我們也分析這種事件可能損失的大小。 | |
| dc.description.abstract (摘要) | In a blockchain, the longest chain, which has the greatest proof-of-work effort spent in it, represents the majority decision. To change the transaction data of a block, an attacker has to control more computing power than other honest nodes. This situation can happen if the attacker can hack into the systems of honest nodes. To analyze the probability of such event, we propose a probability model for analysis of attacks on blockchain. The model is based on the structure of a peer-to-peer network. We assume the state of each honest node follows a two-state (hacked or normal) Markov chains. A hacked node is assumed to be controlled by the attacker and its computing power belongs to the attacker. On the other hand, the computing power of a normal node belongs to the honest longest chain. We apply the model to study the probability of the majority decision is controlled by the attacker and the duration of such event. In addition, we analyze the magnitude of the loss for such event. | |
| dc.format.extent | 116 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | 科技部, MOST106-2410-H004-056, 106.08-107.07 | |
| dc.title (題名) | 分析區塊鏈遭受惡意攻擊之隨機模型研究 | |
| dc.title (題名) | A Stochastic Model for Analysis of Attacks on Blockchain | |
| dc.type (資料類型) | report | |
