Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAn Uncertainty- and Collusion-Proof Voting Consensus Mechanism in Blockchain
83
0
0.0
(
0
)
Added by
Shengling Wang
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Though voting-based consensus algorithms in Blockchain outperform proof-based ones in energy- and transaction-efficiency, they are prone to incur wrong elections and bribery elections. The former originates from the uncertainties of candidates capability and availability; and the latter comes from the egoism of voters and candidates. Hence, in this paper, we propose an uncertainty- and collusion-proof voting consensus mechanism, including the selection pressure-based voting consensus algorithm and the trustworthiness evaluation algorithm. The first algorithm can decrease the side effects of candidates uncertainties, lowering wrong elections while trading off the balance between efficiency and fairness in electing miners. The second algorithm adopts an incentive compatible scoring rule to evaluate the trustworthiness of voting, motivating voters to report true beliefs on candidates by making egoism in consistent with altruism so as to avoid bribery elections. A salient feature of our work is theoretically analyzing the proposed voting consensus mechanism by the large deviation theory. Our analysis provides not only the voting failure rate of a candidate but also its decay speed, based on which the concepts of {it the effective selection valve} and {it the effective expectation of merit} are introduced to help the system designer to determine the optimal voting standard and guide a candidate to behave in an optimal way for lowering the voting failure rate.
rate research
Read More
Miners in a blockchain system are suffering from ever-increasing storage costs, which in general have not been properly compensated by the users transaction fees. This reduces the incentives for the miners participation and may jeopardize the blockchain security. We propose to mitigate this blockchain insufficient fee issue through a Fee and Waiting Tax (FWT) mechanism, which explicitly considers the two types of negative externalities in the system. Specifically, we model the interactions between the protocol designer, users, and miners as a three-stage Stackelberg game. By characterizing the equilibrium of the game, we find that miners neglecting the negative externality in transaction selection cause they are willing to accept insufficient-fee transactions. This leads to the insufficient storage fee issue in the existing protocol. Moreover, our proposed optimal FWT mechanism can motivate users to pay sufficient transaction fees to cover the storage costs and achieve the unconstrained social optimum. Numerical results show that the optimal FWT mechanism guarantees sufficient transaction fees and achieves an average social welfare improvement of 33.73% or more over the existing protocol. Furthermore, the optimal FWT mechanism achieves the maximum fairness index and performs well even under heterogeneous-storage-cost miners.
Popular distributed ledger technology (DLT) systems using proof-of-work (PoW) for Sybil attack resistance have extreme energy requirements, drawing stern criticism from academia, businesses, and the media. DLT systems building on alternative consensus mechanisms, foremost proof-of-stake (PoS), aim to address this downside. In this paper, we take a first step towards comparing the energy requirements of such systems to understand whether they achieve this goal equally well. While multiple studies have been undertaken that analyze the energy demands of individual Blockchains, little comparative work has been done. We approach this research question by formalizing a basic consumption model for PoS blockchains. Applying this model to six archetypal blockchains generates three main findings: First, we confirm the concerns around the energy footprint of PoW by showing that Bitcoins energy consumption exceeds the energy consumption of all PoS-based systems analyzed by at least three orders of magnitude. Second, we illustrate that there are significant differences in energy consumption among the PoSbased systems analyzed, with permissionless systems having an overall larger energy footprint. Third, we point out that the type of hardware that validators use has a considerable impact on whether PoS blockchains energy consumption is comparable with or considerably larger than that of centralized, non-DLT systems.
Mining in the blockchain requires high computing power to solve the hash puzzle for example proof-of-work puzzle. It takes high cost to achieve the calculation of this problem in devices of IOT, especially the mobile devices of IOT. It consequently restricts the application of blockchain in mobile environment. However, edge computing can be utilized to solve the problem for insufficient computing power of mobile devices in IOT. Edge servers can recruit many mobile devices to contribute computing power together to mining and share the reward of mining with these recruited mobile devices. In this paper, we propose an incentivizing mechanism based on edge computing for mobile blockchain. We design a two-stage Stackelberg Game to jointly optimize the reward of edge servers and recruited mobile devices. The edge server as the leader sets the expected fee for the recruited mobile devices in Stage I. The mobile device as a follower provides its computing power to mine according to the expected fee in Stage. It proves that this game can obtain a uniqueness Nash Equilibrium solution under the same or different expected fee. In the simulation experiment, we obtain a result curve of the profit for the edge server with the different ratio between the computing power from the edge server and mobile devices. In addition, the proposed scheme has been compared with the MDG scheme for the profit of the edge server. The experimental results show that the profit of the proposed scheme is more than that of the MDG scheme under the same total computing power.
Walsh [Wal10, Wal09], Davies et al. [DKNW10, DKNW11], and Narodytska et al. [NWX11] studied various voting systems empirically and showed that they can often be manipulated effectively, despite their manipulation problems being NP-hard. Such an experimental approach is sorely missing for NP-hard control problems, where control refers to attempts to tamper with the outcome of elections by adding/deleting/partitioning either voters or candidates. We experimentally tackle NP-hard control problems for Bucklin and fallback voting. Among natural voting systems with efficient winner determination, fallback voting is currently known to display the broadest resistance to control in terms of NP-hardness, and Bucklin voting has been shown to behave almost as well in terms of control resistance [ER10, EPR11, EFPR11]. We also investigate control resistance experimentally for plurality voting, one of the first voting systems analyzed with respect to electoral control [BTT92, HHR07]. Our findings indicate that NP-hard control problems can often be solved effectively in practice. Moreover, our experiments allow a more fine-grained analysis and comparison-across various control scenarios, vote distribution models, and voting systems-than merely stating NP-hardness for all these control problems.
In this paper, we propose FedChain, a novel framework for federated-blockchain systems, to enable effective transferring of tokens between different blockchain networks. Particularly, we first introduce a federated-blockchain system together with a cross-chain transfer protocol to facilitate the secure and decentralized transfer of tokens between chains. We then develop a novel PoS-based consensus mechanism for FedChain, which can satisfy strict security requirements, prevent various blockchain-specific attacks, and achieve a more desirable performance compared to those of other existing consensus mechanisms. Moreover, a Stackelberg game model is developed to examine and address the problem of centralization in the FedChain system. Furthermore, the game model can enhance the security and performance of FedChain. By analyzing interactions between the stakeholders and chain operators, we can prove the uniqueness of the Stackelberg equilibrium and find the exact formula for this equilibrium. These results are especially important for the stakeholders to determine their best investment strategies and for the chain operators to design the optimal policy to maximize their benefits and security protection for FedChain. Simulations results then clearly show that the FedChain framework can help stakeholders to maximize their profits and the chain operators to design appropriate parameters to enhance FedChains security and performance.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
