Blockchain-Research and Applications最新文献

{"title":"Blockchain-enabled smart contracts and prioritized delegated proof-of-stake paradigm for secure and scalable electronic voting systems","authors":"Abdul Razaque,&nbsp;Gulnara Bektemyssova,&nbsp;Joon Yoo,&nbsp;Meenhoon Khan,&nbsp;Aziz Alotaibi,&nbsp;Satybaldiyeva Ryskhan,&nbsp;Zhyldyz Kalpeyeva,&nbsp;Majid Alshammari,&nbsp;Jaeryong Hwang","doi":"10.1016/j.bcra.2025.100348","DOIUrl":"10.1016/j.bcra.2025.100348","url":null,"abstract":"<div><div>Existing electronic voting systems suffer from security concerns, identity theft, electoral fraud, and insufficient transparency in digital voting systems, which pose significant challenges to electoral integrity. Blockchain-based electronic voting systems provide immutability and decentralization. However, they are inappropriate for large-scale elections because of their inadequate consensus mechanisms, scalability issues, and security weaknesses. To provide an equitable electoral process, an electronic voting system must be scalable, secure, and efficient. This method requires real-time vote verification, secure vote recording to avert fraud, and voter authentication.</div><div>This study introduces a blockchain-based smart contract electronic voting system (BCVS) to improve the security and efficiency of electronic voting. The three algorithms are employed by the proposed BCVS to safeguard and improve the electronic voting process via the utilization of smart contracts. These algorithms ensure the precise tabulation of results and establish a robust foundation for electronic voting by resolving disputes. The proposed approach ensures transparency, immutability, and a minimal likelihood of manipulation through the utilization of the prioritized delegated proof-of-stake (PDPoS) consensus mechanism. The PDPoS functions on Tier 3 scalable networks and diligently documents transactions on the blockchain to resolve critical challenges associated with electronic voting. The scalability and integrity of the proposed e-voting system are ensured through the implementation of a practical Byzantine fault tolerance algorithm. Improved voter authentication is accomplished by multi-factor authentication and elliptic curve digital signatures, reducing the dangers of unwanted access. Additionally, Nightshade sharding from the NEAR algorithm enhances scalability by partitioning the blockchain network into numerous smaller shards, facilitating parallel transaction processing. Consequently, throughput is markedly enhanced, and latency is diminished. The testing results indicate that the proposed BCVS achieves 100% confirmed transactions, 98% compatibility, 95% accuracy, and 95% audited votes. The proposed BCVS outperforms existing state-of-the-art systems in multiple essential domains, such as the volume of votes cast within a specified timeframe, precision, interoperability with other systems, quantity of confirmed transactions, auditability, and duration of vote counting.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 4","pages":"Article 100348"},"PeriodicalIF":6.5,"publicationDate":"2026-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148636832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"PureQuantum: Towards a scalable blockchain channel security in IoT networks","authors":"Collins Izuchukwu Okafor,&nbsp;Love Allen Chijioke Ahakonye,&nbsp;Jae Min Lee,&nbsp;Dong-Seong Kim","doi":"10.1016/j.bcra.2025.100372","DOIUrl":"10.1016/j.bcra.2025.100372","url":null,"abstract":"<div><div>Integrating Internet of Things (IoT) networks with blockchain technology has introduced transformative potential for secure, decentralized applications. However, with expanding IoT networks and the rapid advancements in quantum computing, which can break the classical encryption mechanism employed in these networks, securing validator communications in blockchain consensus mechanisms becomes increasingly challenging. This study presents PureQuantum, a novel quantum-enhanced framework that integrates quantum key distribution (QKD) into a proof-of-authority and association consensus mechanism. Our experimental evaluation demonstrates that PureQuantum records an approximate key generation time of 2.315<em>s</em> (BB84), maintaining a minimal error rate of 0.2493, thereby ensuring robust resistance to classical and quantum computational threats. Exploring the architecture, design, and performance of PureQuantum, this concept highlights its ability to balance scalability, energy efficiency, and quantum-resilient security. By integrating QKD into validator communication protocols, PureQuantum provides a future-proof framework capable of supporting the demands of IoT-enabled decentralized systems.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 4","pages":"Article 100372"},"PeriodicalIF":6.5,"publicationDate":"2026-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148738728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Lightweight honeypot contract detection method based on tree pruning and graph auto-encoder","authors":"Youwei Wang,&nbsp;Yudong Hou,&nbsp;Lizhou Feng","doi":"10.1016/j.bcra.2025.100352","DOIUrl":"10.1016/j.bcra.2025.100352","url":null,"abstract":"<div><div>To address the high complexity of current honeypot contract detection methods, a lightweight honeypot contract detection method based on pruning and graph auto-encoder (called CSSDetector) is proposed. First, the contract source code is converted into an XML parse tree, and the tree is pruned using term frequency-inverse document frequency (TF-IDF) to reduce the number of nodes. Then, to improve training efficiency while guaranteeing detection accuracy, the pruned XML parse tree is converted into a graph, and the Solidity source code is learned using the Word2vec model and the graph auto-encoder to reduce the node dimension. Finally, to reduce the impact of the dataset imbalance problem, three data augmentation methods that can improve model robustness and classification accuracy are used to increase the diversity of the training samples. The experimental results show that the CSSDetector significantly reduces the model training time and storage space while ensuring honeypot contract detection performance. Compared with the CSGDetector, the CSSDetector reduces the temporal cost by more than 70% and the spatial cost by more than 90%, verifying the execution efficiency and classification accuracy of the proposed method.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 4","pages":"Article 100352"},"PeriodicalIF":6.5,"publicationDate":"2026-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148738729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Towards decentralized cybersecurity: A novel privacy-preserving federated learning approach for botnet attack detection","authors":"Md. Alamgir Hossain,&nbsp;Md. Samiul Islam","doi":"10.1016/j.bcra.2025.100355","DOIUrl":"10.1016/j.bcra.2025.100355","url":null,"abstract":"<div><div>The exponential proliferation of IoT devices has led to an alarming surge in botnet-based cyberattacks, necessitating advanced, privacy-preserving, and scalable detection mechanisms. Traditional centralized machine learning approaches for botnet detection face critical challenges, including data privacy risks, communication overhead, and model generalization issues. To address these concerns, this research presents a privacy-preserving Federated Learning (FL) approach for decentralized cybersecurity, using SHapley Additive exPlanations (SHAP)-based feature selection to enhance interpretability and model efficiency. The proposed method enables local models to be trained on edge devices without sharing raw data, preserving user privacy while maintaining robust detection capabilities. Using the MedBiot dataset, we evaluate the effectiveness of FL under both non-Independent and Identically Distributed (non-IID) and IID settings, where botnet attack types (e.g., Bashlite, Mirai, and Torii) are distributed across multiple federated clients. The experimental results indicate that the non-IID federated models achieved exceptional detection recall (99.98%), with high precision, accuracy, and F1-score across all clients, demonstrating resilience even in highly heterogeneous environments. The IID setting, where data were randomly distributed among clients, also maintained high classification accuracy (≈99.98%), highlighting the significance of localized attack patterns in federated cybersecurity. Additionally, SHAP-based feature selection optimizes performance by identifying the most critical features, reducing computational overhead while preserving explainability. The findings underscore the efficacy of FL for real-world IoT botnet detection, offering a scalable, secure, and interpretable solution to modern cybersecurity challenges.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 4","pages":"Article 100355"},"PeriodicalIF":6.5,"publicationDate":"2026-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148843957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"SmartML: Enhancing security and reliability in smart contract development","authors":"Adele Veschetti,&nbsp;Richard Bubel,&nbsp;Reiner Hähnle","doi":"10.1016/j.bcra.2025.100362","DOIUrl":"10.1016/j.bcra.2025.100362","url":null,"abstract":"<div><div>Smart contracts, as integral components of blockchain technology, play a pivotal role in automating and executing agreements in a trust-free manner. However, ensuring the correctness and reliability of smart contracts remains a significant challenge due to their complex nature and potential vulnerabilities. To address this challenge, we propose <span>SmartML</span>, a novel modeling language tailored specifically to smart contracts. This paper presents an in-depth exploration of the features, advantages, and applications of the proposed modeling language. By providing a precise and intuitive means of describing smart contract behaviors, <span>SmartML</span> aims to support the development, verification, and validation of smart contracts, ultimately reinforcing trust and confidence in them. Furthermore, we discuss the relation of existing blockchain technologies to our modeling language and highlight its potential to streamline integration efforts. We posit <span>SmartML</span> as a versatile tool to advance interoperability, reliability, and security of smart contracts in blockchain ecosystems.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 4","pages":"Article 100362"},"PeriodicalIF":6.5,"publicationDate":"2026-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148843958","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"EVMLiSA: Sound static control-flow graph construction for EVM bytecode","authors":"Vincenzo Arceri,&nbsp;Saverio Mattia Merenda,&nbsp;Luca Negrini,&nbsp;Luca Olivieri,&nbsp;Enea Zaffanella","doi":"10.1016/j.bcra.2025.100384","DOIUrl":"10.1016/j.bcra.2025.100384","url":null,"abstract":"<div><div>Ethereum enables the creation and execution of decentralized applications through smart contracts that are compiled into the Ethereum Virtual Machine (EVM) bytecode. Once deployed on the blockchain, the bytecode is immutable; therefore, ensuring that smart contracts are bug-free before their deployment is of utmost importance. A crucial preliminary step for any effective static analysis of EVM bytecode is the extraction of the control flow graph (CFG): This presents significant challenges due to potentially statically unknown jump destinations. In this paper, we present a novel approach, based on abstract interpretation, aiming to build a sound CFG from EVM bytecode smart contracts. Our analysis, which is implemented in our static analyzer Ethereum Virtual Machine Library for Static Analysis (EVMLiSA), is based on a parametric abstract domain that approximates concrete execution stacks at each program point as an <em>l</em>-sized set of abstract stacks of maximal height <em>h</em>; the results of the analysis are then used to resolve the jump destinations at jump nodes. Furthermore, EVMLiSA includes a checker for reentrancy detection, working on the constructed CFG. Our experiments show that, by fine-tuning the analysis parameters, EVMLiSA is able to build sound CFGs for all real-world smart contracts in the considered benchmark suite. Moreover, EVMLiSA successfully detects all reentrancy vulnerabilities in EVM bytecode smart contracts, while producing a small number of false positives.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 4","pages":"Article 100384"},"PeriodicalIF":6.5,"publicationDate":"2026-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148738726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Learning from Terra-Luna: A simulation-based study on stabilizing algorithmic stablecoins","authors":"Federico Calandra,&nbsp;Francesco P. Rossi,&nbsp;Francesco Fabris,&nbsp;Marco Bernardo","doi":"10.1016/j.bcra.2025.100364","DOIUrl":"10.1016/j.bcra.2025.100364","url":null,"abstract":"<div><div>This paper investigates the dynamics behind the catastrophic collapse of the Terra-Luna ecosystem in May 2022, where the TerraUSD stablecoin de-pegged and lost nearly all its value. Using a custom-built simulation environment, we reproduce the free-market interactions and protocol mechanisms that triggered the crash, offering a new perspective on the vulnerabilities of algorithmic stablecoins based on the dual-token seigniorage model. Building on this analysis, we propose four stabilization strategies: Two purely algorithmic mechanisms, designed to prevent de-pegging and mitigate token hyperinflation, and two hybrid approaches, introducing partial collateralization through <em>Tether USD</em> (USDT) and <em>bitcoin</em> (BTC) reserves. Our simulations show that these strategies significantly reduce collapse events under extreme market conditions, with the best improvements ranging from 60.6% to 95.8%. Additionally, we gained better control over LUNA's circulating supply. Our simulation environment showcases how each proposal effectively mitigates systemic risks and enhances stability, thus providing valuable insights for designing future decentralized algorithmic stablecoins that can withstand market crises.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 4","pages":"Article 100364"},"PeriodicalIF":6.5,"publicationDate":"2026-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148636829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Exploring risk and return profiles of funding rate arbitrage on CEX and DEX","authors":"Warodom Werapun,&nbsp;Tanakorn Karode,&nbsp;Jakapan Suaboot,&nbsp;Tanwa Arpornthip,&nbsp;Esther Sangiamkul","doi":"10.1016/j.bcra.2025.100354","DOIUrl":"10.1016/j.bcra.2025.100354","url":null,"abstract":"<div><div>Perpetual futures, non-expiring swap contracts, dominate cryptocurrency markets with over $100 billion in daily trades. This instrument provides leveraged exposure to cryptocurrencies without rollover or direct holding requirements. A pivotal mechanism in this market is the funding rate, a periodic payment between buyers (longs) and sellers (shorts) in perpetual futures contracts to keep the contract price close to the market value of the asset. This study scrutinizes the risk and return profiles of funding rate arbitrage in cryptocurrency perpetual futures markets, leveraging data from major exchanges such as Binance and Bitmex, alongside decentralized platforms like ApolloX and Drift. Key assets, including Bitcoin (BTC), Ethereum (ETH), Ripple (XRP), Binance Coin (BNB), and Solana (SOL) are examined. Empirical analysis of arbitrage strategies, contrasted with the Hold-On-for-Dear-Life (HODL) approach, uncovers diversification benefits as funding rate arbitrage exhibits a weak correlation with HODL strategies for XRP. Moreover, the impact of leverage on arbitrage efficiency is assessed, revealing the nuanced nature of leverage's influence on gains. Evaluation of 60 arbitrage scenarios underscores the potential range of returns, positioning funding rate arbitrage as a stable yet rewarding alternative to HODL strategies. This study presents evidence that the best-performing funding rate arbitrage can generate substantial returns of up to 115.9% over six months while limiting the maximum drawdown to 1.92%, as demonstrated by the Drift XRP strategy with 7x leverage. These results underscore the attractiveness of funding rate arbitrage strategies for investors and call for further scholarly inquiry into the area.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 4","pages":"Article 100354"},"PeriodicalIF":6.5,"publicationDate":"2026-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148636831","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Data redaction in smart-contract-enabled permissioned blockchains","authors":"Gennaro Avitabile,&nbsp;Vincenzo Botta,&nbsp;Daniele Friolo,&nbsp;Ivan Visconti","doi":"10.1016/j.bcra.2025.100363","DOIUrl":"10.1016/j.bcra.2025.100363","url":null,"abstract":"<div><div>Balancing immutability and compliance with regulations stands as a significant challenge in the realm of blockchain technology applications. Due to the increase of data-protection requirements (e.g., the GDPR in the EU), it is essential to address the problem of deleting data from a blockchain without compromising the security and transparency of the blockchain itself. Several works proposed techniques to address the data redaction problem. In their seminal work, Ateniese et al. (IEEE EuroS&amp;P 17) were the first to propose a redactable blockchain. Their approach focuses on permissioned blockchains, and they showed how to change the content of a transaction without breaking the chaining among blocks by using special cryptographic hash functions (i.e., chameleon hash functions) and secure multi-party computation. We observe that the redaction technique of Ateniese et al. does not take into account the possibility that the blockchain supports smart contracts and that a redaction of a transaction might leave inconsistencies in the logic of the contracts, making some remaining non-redacted transactions invalid, and, more in general, the state of a smart contract inconsistent with the content of transactions. We find this choice rather limiting since decentralized and publicly verifiable computation guaranteed by smart-contract-enabled blockchains is necessary for modern (i.e., Web3) applications. To overcome the above limitations of the applicability of the redaction techniques of Ateniese et al., we propose a redaction technique with wider applicability that leverages succinct non-interactive arguments of knowledge to realize what we call a <em>proof-of-consistency</em>.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 4","pages":"Article 100363"},"PeriodicalIF":6.5,"publicationDate":"2026-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148843959","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Unleashing the potential: Advancements and innovations in blockchain technology","authors":"Yuhong Liu,&nbsp;Shifeng Sun,&nbsp;Joseph Liu,&nbsp;Jiangshan Yu,&nbsp;Xueqin Liang","doi":"10.1016/j.bcra.2026.100513","DOIUrl":"10.1016/j.bcra.2026.100513","url":null,"abstract":"","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 4","pages":"Article 100513"},"PeriodicalIF":6.5,"publicationDate":"2026-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148776300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}