1. NCCU Academic Hub
  2. 學術產出
  3. 商學院
  4. 會議論文
  5. Item

學術產出-會議論文

文章檢視/開啟

書目匯出

Google ScholarTM

政大圖書館

引文資訊

TAIR相關學術產出

題名 A probability model for analysis of attacks on blockchain
作者 謝明華
季延平
Hsieh, Ming Hua
Chung, Ming Tao
Chi, Yan Ping Jeffery
貢獻者 風管系
關鍵詞 Chains; Distributed computer systems; Electronic commerce; Markov processes; Peer to peer networks; Random processes; Stochastic systems; Block-chain; Computing power; Probability modeling; Proof of work; Transaction data; Two-state; Probability
日期 2016-12
上傳時間 22-八月-2017 16:34:45 (UTC+8)
摘要 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.
關聯 Proceedings of the International Conference on Electronic Business (ICEB), 352-355
資料類型 conference
dc.contributor 風管系
dc.creator (作者) 謝明華zh_tw
dc.creator (作者) 季延平zh_tw
dc.creator (作者) Hsieh, Ming Huaen_US
dc.creator (作者) Chung, Ming Taoen_US
dc.creator (作者) Chi, Yan Ping Jefferyen_US
dc.date (日期) 2016-12
dc.date.accessioned 22-八月-2017 16:34:45 (UTC+8)-
dc.date.available 22-八月-2017 16:34:45 (UTC+8)-
dc.date.issued (上傳時間) 22-八月-2017 16:34:45 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/112079-
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 177 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) Proceedings of the International Conference on Electronic Business (ICEB), 352-355
dc.subject (關鍵詞) Chains; Distributed computer systems; Electronic commerce; Markov processes; Peer to peer networks; Random processes; Stochastic systems; Block-chain; Computing power; Probability modeling; Proof of work; Transaction data; Two-state; Probability
dc.title (題名) A probability model for analysis of attacks on blockchainen_US
dc.type (資料類型) conference