Blockchain Papers

Jing Ge, Rui Ge

No abstract is available for this record.

G. Muhiuddin, Aroona Hashmi, Muhammad Akram

The performance of cryptocurrency stocks is essential in shaping the growth of digital assets, which have gained significant popularity in the modern era as they offer various benefits to the public, such as reduced fees and hassle-free staking. Therefore, it’s essential for companies to focus on key factors like durability, accessibility, speed, regulation, and efficient management. More investigation is necessary to truly unlock the potential of virtual staking. In order to address this question and conduct a comprehensive and insightful analysis of optimal digital equity, this study presents a ground-breaking, unified approach of entropy- Measurement of Alternatives and Ranking according to the Compromise Solution (MARCOS) approach implemented on comprehensive systems of picture fuzzy rough numbers. Picture fuzzy rough entropy technique is executed for the purpose of analyzing the worth of each crypto stake. Then, a picture fuzzy rough-MARCOS method is carried out for the alternatives prioritizing purposes. The estimation mechanism of digital shares involves the analysis of several famous crypto exchanges active in Türkiye depending upon seven crucial elements affecting the capability of each alternative. Further, the sensitivity and comparative analysis are performed for the purpose of assuring the versatility and durability of the proposed method. The shareholders may be able to follow the path built by the discoveries of the research in order to take suitable manoeuvres without enduring steep expenses.

Jiaxin Zhang, Bolin Zhang

With the rapid advancement of blockchain technology and modern cryptographic methods, achieving efficient privacy preservation while maintaining robust security has become a critical challenge. To address this issue, this paper proposes a blockchain-based aggregated zero-knowledge proof (ZKP) scheme tailored for electronic voting applications. The proposed scheme leverages zero-knowledge proof techniques to authenticate voter identities while preserving privacy by preventing the disclosure of any sensitive voter information. Furthermore, it supports the aggregation of multiple ZKPs, significantly enhancing verification efficiency. To improve system synchronization and security, the scheme incorporates the Chinese cryptographic algorithm ZUC for dynamic updates of shared secret information. A comprehensive security analysis demonstrates that the scheme is secure under the Computational Diffie-Hellman (CDH) assumption. Performance evaluation indicates that, under the condition of updating shared secrets twice every 24 hours and with a voting population of 20, the proposed approach reduces communication overhead by 33.3% and computation overhead by 37.1% to 89.5% compared to existing methods. These results demonstrate that the proposed scheme outperforms comparable solutions in both communication and computational efficiency, making it well-suited for electronic voting scenarios that demand frequent identity verification and strong privacy guarantees.

Jiaxin Wang

No abstract is available for this record.

Ling Zhang, Jianguo Chen, Lian Ding

Mining rewards are significantly influenced by consensus and incentive mechanisms, resulting in diverse returns based on the strategies employed by miners. While numerous studies have explored Bitcoin mining strategies, this paper focuses on the selfish mining strategy proposed by Eyal and Sirer. We establish a mathematical model to analyze the probability distributions of honest and selfish nodes. By transforming the problem of optimizing relative rewards into a decision-making problem within an infinite-state Markov process framework, this study aims to offer insights for future quantitative analyses of returns from selfish mining strategies and assist in optimizing mining strategies.

Yushu Li, Ying Xing, Siqi Lu, Xiang Deng · 6 authors

Smart contracts have brought new developments to Blockchain technology, quickly finding widespread application in finance, law, and business sectors upon their emergence. However, security vulnerabilities in smart contracts have limited their growth. The existing methods for detecting vulnerabilities in smart contracts primarily focus on Ethereum's Solidity, lacking of vulnerability detection tools based on other smart contract languages such as C/C++. Therefore, this paper investigates the current state of vulnerability detection research for smart contract languages other than Ethereum's Solidity and proposes a vulnerability detection method for C/C++ smart contracts based on intermediate value transformation. This method combines Clang technology with the symbolic execution tool KLEE[l], utilizing the Intermediate Representation (IR) from LLVM (Low Level Virtual Machine) for research, andproduces a detection method capable of identifying eight types of code level vulnerabilities. Finally, it summarizes the current shortcomings of smart contract vulnerability detection methods and future research directions.

Kedi Niu, Zhongyuan Yao, Xueming Si

Blockchain, as a decentralized distributed ledger technology, offers secure data exchange and reliable identity authentication for Internet of Things (IoT) devices, introducing new ideas for IoT development. Practical Byzantine Fault Tolerance (PBFT) is a widely used consensus algorithm that is well-suited for the IoT environment due to its low computing power requirements. However, the vast number of devices in the IoT presents a challenge. PBFT necessitates inter-node communication, which leads to decreased scalability as the number of devices grows. To overcome these IoT limitations, this paper proposes an improved PBFT algorithm based on reputation value. Nodes are evaluated and assigned levels according to their reputation values, with higher level nodes being chosen to engage in the consensus process, thereby minimizing the risk of malicious nodes participating. The primary node is unpredictably chosen from high-reputation nodes using random numbers. This approach also simplifies the consensus algorithm process and reduces communication complexity. Experimental findings indicate that the reputation value-based improved PBFT algorithm can diminish communication overhead and consensus delay.

Lin Ni, Qiukai Ye, Jun Yang, Shuai Zhang · 5 authors

Blockchain has the characteristics of decentralisation, security, reliability and non-tampering, and its core is to reach consensus reliably and quickly through a suitable consensus mechanism. The Raft consensus algorithm in blockchain has advantages such as high performance and high availability, which is suitable for asset management business, but the existing Raft algorithm improvement strategy still has the problems of possible voting divergence and insufficient consideration of malicious node shielding, so the paper proposes a Raft algorithm election improvement scheme and potential malicious node defence improvement scheme, which has more rigorous logic, and is able to reduce the election failure rate, verify the correctness of the leader node, for all the malicious nodes in the system can be accurately identified and shielded, to protect the security of the system, so that the Raft algorithm has a wider range of applications.

Monika Parmar, Navneet Kaur, Ramamani Tripathy, Hakam Singh · 5 authors

With improved applications in a variety of industries, the Internet of Things (IoT) and distributed ledger innovation are captivating services and industrial advancements. The IoT and blockchain industries are expected to grow by a factor of three by 2025. As computational power increases, many IoT applications confront substantial challenges with regard to data security and scalability. Additionally, Proof-of-work suffers from a number of problems that make it impractical for IoT applications, therefore Practical Byzantine Fault Tolerance (PBFT) is a widely utilized type of decentralized agreement. Nevertheless, the network node's trust in PBFT is not assured, and the approach to achieving consensus consumes a substantial quantity of network resources. This research proposes a new consensus mechanism known as a Hybrid consensus blockchain algorithm. This includes the features that provide safety into the clustering algorithm for identifying and classifying attackers. To promote cluster diversity in wireless ad hoc networks, a technique called Hybrid fuzzy Possibility C Means Clustering (HFPCM) is developed. For detecting and organizing the intruders in order to create the organization more attack resilient, a Byzantine agreement based cooperative methodology is used.

Mehran Hajiaghapour‐Moghimi, Omidreza Heydaritafreshi, Ehsan Hajipour, Mehdi Vakilian · 5 authors

Cryptocurrency has become a pivotal player in global financial transactions due to its decentralized mining process, which eliminates the need for intermediaries. However, the operation of cryptocurrency mining devices (CMDs) requires significant electrical power, leading to an increase in network-connected cryptocurrency mining loads (CMLs) that pose challenges for power grid operators. This paper evaluates the integration of CMLs into power grids, focusing on distribution network performance. A technology-accepted model for assessing cryptocurrency mining performance is presented, along with an analysis of the impacts of high CML penetration on power grid planning and operation. Findings reveal that high CML penetration can complicate load forecasting, congest transmission lines, and increase the coincident peak load in distribution networks. A case study of Iran’s power network indicates that CMLs account for approximately 2.8% of the nation’s electricity consumption. Furthermore, if 5% of residential customers in Tehran install CMDs, the average coincident peak demand for this group rises by 26.81%. Additionally, the average power factor of a sample CMD is about 0.99, while total current distortion and third harmonic current exceed permissible limits, indicating potential power quality issues. This study highlights the challenges posed by CMLs and proposes strategies for their sustainable integration into power grids.

Byeongchan Park, Se‐Young Jang, Seok-Yoon Kim, Youngmo Kim

Due to the Corona-19 pandemic phenomenon, various video service platforms that provide OTT (Over The Top) services such as 'Netflix' have achieved rapid growth.OTT platforms that provide such video content do not disclose the viewing time of the content watched by users due to various issues such as personal information protection, so stakeholders are conducting third-party research on usage patterns.While an objective and reliable third-party method of investigating usage patterns is needed, efforts to protect personal information are also needed in the process.The information required for viewership surveys to investigate usage patterns only requires information about what content is used and to what extent, and does not require personal information about users.In this paper, we propose a method to generate and verify the generated usage information by de-identification using zero-knowledge proof protocol when a user selects a specific OTT platform and uses content through an OTT player agent that provides OTT services.

Zelin Qiu

As a traditional equivalent, gold has long been a symbol of wealth, traded by countless people. However, with the progress of science and technology, virtual currency has gradually entered our vision and has a great impact on people's life. The purpose of this paper is to accurately predict the price of gold and bitcoin on the premise that the initial conversion is only $1,000, and ultimately maximize the asset. Therefore, the grey model is established to make the prediction. Its advantage is that it improves the long-term dependence problem in RNN; GM generally outperforms temporal recurrent neural networks (RNN) and Hidden Markov models (HMM). By calculation, the price of gold in 2016 was $1,325 and the price of bitcoin was $622; Five years from now, the forecast price for gold is $1,788 and the forecast price for bitcoin is $46,192, with an average margin of error of just 1.7%. According to the model built in this article, investors can predict the next three days based on today's data, so that they can adjust our portfolios based on the forecast results.

Jing Li, Wenjing Zhang, Lei Zhang

To solve the concerns of malicious node removal and node corruption caused by idle node voting and long election cycles of the Delegated Proof of Stake (DPoS) consensus process, a new solution is proposed. First, we design a time-cost-based incentive mechanism that provides commensurate compensation to all nodes participating in the consensus strive system nodes to participate in voting actively. Second, we present a reward and punishment scheme based on trust value that sets the node status and corresponding trust value for nodes and dynamically adjusts the node status and associated trust value by monitoring node behavior and provides the function Optimization is performed to make it more difficult for bad nodes to get votes, to speed up the removal of wicked nodes, and to resist node bribery attacks. Finally, a list of alternate witness nodes is included to address the issue of system security weakening caused by the vacancy of hostile nodes once their proxies are revoked. The experimental results before and after the mechanism modification are compared to validate the usability and effectiveness of the improvement scheme.

Yuan Wang

No abstract is available for this record.

Xiaoli Du, Deng-Feng Li, Kairong Liang

In proof-of-work (PoW)-based blockchain network, the blockchain miners publish blocks by contributing computing power to solve crypto-puzzles.Due to the weak computing power of single miner, miners tend to join a mining pool and share the profits from the mining pool according to the contribution proportions of the miners.However, some miners may initiate block withholding attack which may result in wasting computing power, even threatening the efficiency of the blockchain network.To address this problem, in this paper, we use the biform game model to optimize the miners' strategy choices.We firstly formulate the mining process as a non-cooperative-cooperative biform game model.We use the model to exhibit miners' strategy choices (non-cooperation stage) and the cooperation mining process (cooperation stage).Then we set the conditions to maintain the voluntary honest behavior of miners.After that, we employ the semi-CIS (semi-the center of imputation set value) value to compute the solutions of the cooperative games in the cooperation stage, and optimize miners' strategy choices to prevent the block withholding attack.Hence we can ensure the blockchain network is secure.Finally, the validity and applicability of the proposed model and method are verified by a numerical example.

Marlen S Bissaliyev, Adlet Nyussupov, Sh. Zh. Mussiraliyeva

Mining a cryptocurrency is profitable on someone’s resources. It is becoming increasing problem in the enterprise to control the operations of its infrastructure while in idle or “off-work” time. In this paper we present enterprise security assessment framework for cryptocurrency mining based on Monero cryptocurrency. The framework consists from surveying power consumption on GPU mining farms and traditional desktop PCs, analysis of web resources for browser-based mining on both internal and external domain names, the handy network logs analysis tool based on the regular expressions. While there had been significant difference between GPU and traditional desktop PC’s power consumption, computational ratio of the idle PCs after working time remains questionable. In the browser-based cryptocurrency mining, there were no data on public domains, however there had been a possibility for using the private domain names, thus further research and different tools are required. In the network analysis, there were not enough evidences on the network mining, and this leads to the different research question that attackers may use proxy techniques to bypass traffic filtering and network analysis.

Yingyu Pan

By using block chain technology, bitcoin has realized a real de centralization and point to point digital currency system, which effectively solved the problems of "double payment" and "curbing inflation". Bitcoin has the value and function of money, therefore, in practical application, we need to consider one problem --"malicious attack", whose success probability affects the basic security performance of the system. This paper is based on the mathematical derivation and analysis of the model and formula given by the "Bitcoin: A peer-to-peer electronic cash system" in the original paper of Satoshi Takemoto's paper. And verify the theoretical guarantee that the success of attack needs the following conditions: Mastering the calculation power of "50%".

Atefeh Mashatan, Zachary Roberts

We discuss the current state of the Canadian real estate market and the impact blockchain technology could have on it. We start with a review of the current popular and scholarly literary landscape relating to blockchain technology and its real estate applications. Special focus is given to the impact the technology could have on transaction costs, transaction times and fraud deterrence in this market. Preliminary recommendations are provided in the form of blockchain based bidding and transaction systems.

Authors unavailable

Bitcoin transaction fee is an important kind of transaction costs that can be observed. In this paper, we address that the long-term effects of the demand are greater than that of the supply through empirical analyses of the influence degree of computational power, the number of transactions and the price of bitcoin. Based on the theory of supply and demand, there is a trend upward for bitcoin transaction fee in the future.

Huixin Wu, Feng Wang, Mo Duo

No abstract is available for this record.

Wang Yu-Zhu

A new scheme of identity authentication that has zero-knowledge characteristics is established based on RSA algorithm.The analysis of the scheme shows that the algorithm is legible,the mutual time and the opportuni-ty be cheated is less.Only one time proof,it can meet the reliability demands for which other zero-knowledge proof algorithms need much more time proof.