T. Nguyen, Long Vuong, Son-Lam Nguyen, Cam Pham, Tu Nguyen
{"title":"Uniform Randomization for Block Double Validation","authors":"T. Nguyen, Long Vuong, Son-Lam Nguyen, Cam Pham, Tu Nguyen","doi":"10.1145/3320154.3322133","DOIUrl":null,"url":null,"abstract":"TomoChain1 is a blockchain based on Ethereum framework with the following advantages points: low transaction fee, fast confirmation time, double validation and randomization for security guarantees. In our previous technical white paper, we proposed Proof-of-Stake Voting (PoSV) consensus protocol, a Proof-of-Stake (PoS)-based blockchain protocol with a fair voting mechanism, rigorous security guarantees and fast finality. One of the key parts of PoSV is the double validation process, which requires randomization to generate the list of block verifiers (with uniform distribution and unpredictability) for each epoch. In other words, randomization of block verifiers in double validation is the key factor of reducing risks coming from paired hand-shaking attackers trying to commit malicious blocks. In this paper, we focus on studying methods for randomization of block verifiers. In particular, we study combinatorial and probability theory, and then apply the fixed-point-free permutation method for randomization. With this approach, we show that the contributions and benefits of verifiers are fair in the sense that the probability distribution function is uniform eventually. Finally, we implement the proposed protocol and conduct experiments on TomoChain public blockchain.","PeriodicalId":227520,"journal":{"name":"Proceedings of the 2019 International Conference on Blockchain Technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 International Conference on Blockchain Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3320154.3322133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
TomoChain1 is a blockchain based on Ethereum framework with the following advantages points: low transaction fee, fast confirmation time, double validation and randomization for security guarantees. In our previous technical white paper, we proposed Proof-of-Stake Voting (PoSV) consensus protocol, a Proof-of-Stake (PoS)-based blockchain protocol with a fair voting mechanism, rigorous security guarantees and fast finality. One of the key parts of PoSV is the double validation process, which requires randomization to generate the list of block verifiers (with uniform distribution and unpredictability) for each epoch. In other words, randomization of block verifiers in double validation is the key factor of reducing risks coming from paired hand-shaking attackers trying to commit malicious blocks. In this paper, we focus on studying methods for randomization of block verifiers. In particular, we study combinatorial and probability theory, and then apply the fixed-point-free permutation method for randomization. With this approach, we show that the contributions and benefits of verifiers are fair in the sense that the probability distribution function is uniform eventually. Finally, we implement the proposed protocol and conduct experiments on TomoChain public blockchain.