Blockchain consensus rule based dynamic blind voting for non-dependency transaction

초록

As in 2009 the first encrypted electronic currency Bitcoin is introduced, the block chain technology has received attention. Bitcoin is a currency issued without a trusted third party, in peer-to-peer (Peer-to-Peer) network and gives a guarantee of the reliability of money transactions, ensures the integrity of transactions. There is a back end-technique called block-chain that guarantees these without trusted third party. Block chain is a public ledger that all nodes to verify transactions and maintain integrity with the same ledger. Block chain technology applies not only electronic currency but also in various industries such as contract document integrity, cloud storage service, internet of thigns, supply chain for transaction integrity. However, there are problems to be solved if the bitcoin block chain consensus rule is applied to these industry. First, there is problem of low transaction throughput and block generation rate by an inefficient consensus rule. Second, There is problem of tampered block broadcast with non-dependency (internet of things data, food history data) transactions when applying the block chain consensus rule, which is proof-of-work of bitcoin's competitive system. To solve these problems, we propose new blockchain consensus algorithm for non-dependency transactions. In this paper, the blockchain transactions targeted internet of things data and food history. We propose consensus rule based voting for the efficiency, also propose method of imposing difficulty of block generation according to the voting result in order to prevent malicious node attacks. We provide experimental results on attack malicious node in the block chain implemented by the proposed consensus algorithms and the result is analyzed. © 2017 SERSC Australia.

키워드