Aoxuan Li, Gabriele D'Angelo, Su-Kit Tang, Frank Fang, Baron Gong
{"title":"An auditable confidentiality protocol for blockchain transactions","authors":"Aoxuan Li, Gabriele D'Angelo, Su-Kit Tang, Frank Fang, Baron Gong","doi":"10.1016/j.bcra.2025.100380","DOIUrl":"10.1016/j.bcra.2025.100380","url":null,"abstract":"<div><div>Blockchain technology inherently exposes user payment details, including account balances, asset holdings, and transaction histories, posing significant security and privacy risks. Moreover, no existing cross-chain bridges support private transactions that protect users' trading histories. This paper introduces a novel confidentiality protocol that conceals user payments while ensuring auditability. The protocol employs a privacy committee, where encrypted secret shares of transaction data are distributed among committee members. Auditors can access private transaction data only with majority approval from the committee. Additionally, the protocol utilizes a zero-knowledge rollup scheme, batching multiple transactions to reduce private transaction costs by 90% compared to non-batched approaches. Implemented using ZoKrates and Solidity, the proposed scheme has been evaluated on the Ethereum test network, demonstrating a one-to-one private transaction latency of approximately 5 s. The protocol's security is rigorously analyzed using the standard real/ideal world paradigm.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 5","pages":"Article 100380"},"PeriodicalIF":6.5,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149211213","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}
Yi Guo, Yuying Wang, Jinyue Huang, Tiantian Duan, Linpeng Jia, Hanwen Zhang, Yi Sun
{"title":"CAVer: Compacting accumulation to reduce cross-chain verification overhead","authors":"Yi Guo, Yuying Wang, Jinyue Huang, Tiantian Duan, Linpeng Jia, Hanwen Zhang, Yi Sun","doi":"10.1016/j.bcra.2025.100381","DOIUrl":"10.1016/j.bcra.2025.100381","url":null,"abstract":"<div><div>The data silos between heterogeneous blockchain platforms have given rise to cross-chain protocols. These cross-chain protocols enable secure interoperability between multiple distinct blockchains. Security requires that the target chain has the ability to verify whether cross-chain messages have been finalized on the source chain. Existing cross-chain protocols first synchronize source chain block headers to the target chain and validate them, then verify cross-chain messages included in the header's commitment value using native accumulators, like a Merkle tree. Cross-chain verification incurs significant on-chain overhead. Existing solutions primarily focus on optimizing header verification, while neglecting verification overhead for messages. It is worth noting that as the number of on-chain states increases, the number of elements in the accumulator multiplies, leading to a larger proof size that escalates message verification overhead on the target chain. To reduce message verification overhead on the target chain, we present CAVer. It removes non-cross-chain states from accumulators to minimize message proof size. CAVer incorporates three schemes: Fill-Weak, Fill-Mid, and Fill-Pro. Fill-Weak abandons blockchain's native accumulators by creating a new contract-based compacting accumulator exclusively for cross-chain messages on the source chain. Based on Fill-Weak, Fill-Mid, and Fill-Pro employ block-isolation and target-isolation, respectively, to further reduce verification overhead. Additionally, we design the algorithm <span>AppendAndTailor</span> to reduce storage cost on the source chain. It aims at trimming historical states when accumulating cross-chain messages. Evaluations on Ethereum-like blockchains demonstrate that CAVer reduces message verification overhead on the target chain by 76% compared to the existing state-of-the-art scheme.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 5","pages":"Article 100381"},"PeriodicalIF":6.5,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149211224","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":"Corrigendum to “PSVDF: A Data Protection Framework for Vehicular Digital Forensics Integrating Blockchain Views and Cross-Platform Secure Spaces” [Blockchain: Research and Applications Volume 7, Issue 3, June 2026, 100393]","authors":"Mingxuan Li, Wenqing Liu, Qing Xia, Yucheng Li, Zhen Xu","doi":"10.1016/j.bcra.2026.100547","DOIUrl":"10.1016/j.bcra.2026.100547","url":null,"abstract":"","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 5","pages":"Article 100547"},"PeriodicalIF":6.5,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149251642","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}
Fausto Neri da Silva Vanin, Blanda Helena de Mello, Rodrigo da Rosa Righi, Cristiano André da Costa, Rodolfo Stoffel Antunes
{"title":"Enhancing health data integrity through on-chain verification and cryptographic proofs","authors":"Fausto Neri da Silva Vanin, Blanda Helena de Mello, Rodrigo da Rosa Righi, Cristiano André da Costa, Rodolfo Stoffel Antunes","doi":"10.1016/j.bcra.2025.100373","DOIUrl":"10.1016/j.bcra.2025.100373","url":null,"abstract":"<div><div>The integration of blockchain technology in healthcare has gained significant attention due to its potential to address critical challenges such as data privacy, interoperability, and health record integrity. Although electronic health record (EHR) standards such as health level 7 fast healthcare interoperability resources (HL7 FHIR) and OpenEHR provide frameworks for data consistency and interoperability, concerns persist regarding the privacy and security of sensitive patient information, particularly in compliance with regulations. Existing solutions often store only hashed representations of data on blockchain nodes, making direct on-chain validation impossible and increasing the risk of invalid or malicious data entering the system. This paper introduces maximize, encrypt, prove, comply and adapt (MEPCA), a novel blockchain-based framework designed to enhance on-chain EHR data processing using cryptographic techniques. The model incorporates an innovative method to generate cryptographic proofs of data validity, enabling direct on-chain verification of hash digests. We present practical use case implementations and perform a technical evaluation of a fully on-chain MEPCA approach within the HL7 FHIR ecosystem. Our analysis examines the processing time of the hash proof algorithm, comparing it with existing methods based on transactions per second (TPS), latency, and computational efficiency in a multi-host network environment. The experimental results show that the MEPCA framework achieves a maximum of 83.2 TPS, with a latency below 1.5 s and the hash-proof computation taking 1.6 ms. Our primary contribution is to demonstrate viable healthcare scenarios for a fully on-chain approach, providing strategic guidance for the adoption of decentralized solutions in healthcare through technical evaluation and real-world applications.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 5","pages":"Article 100373"},"PeriodicalIF":6.5,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149211212","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":"Secure and adaptive prediction of post-TAVR outcomes: Integrating federated learning and blockchain for enhanced patient care","authors":"Lilia Tightiz, Abdulkhamidov Akbarjon Sobitkhon Ughli, Joon Yoo","doi":"10.1016/j.bcra.2025.100404","DOIUrl":"10.1016/j.bcra.2025.100404","url":null,"abstract":"<div><div>This paper presents a novel health data analysis platform for improved individualized risk forecasting of permanent pacemaker implantation (PPI) following transcatheter aortic valve replacement procedures. Specifically, we introduce XGBoost-federated adaptive interpolation transfer learning —a platform that integrates heterogeneous hospital data sets via adaptive output-level interpolation and performance-weighted model ensembling. This approach facilitates federated learning across institutions with different feature spaces and prediction targets, such as time-to-event and binary models, eliminating structural and semantic mismatches prevalent in regular federated transfer learning. To ensure secure, privacy-preserving, and General Data Protection Regulation (GDPR)-compliant data exchange, we propose a dual-chain blockchain architecture integrating proof of authority, zero-knowledge proofs, and chain-specific smart contracts, and off-chain encrypted storage through Filecoin. Experimental evaluation proves that the PrimaryChain handles average 300 tx/s with an average latency of 500 ms, and the Filecoin storage configuration with three redundant copies offers 99.8% data availability and decentralized access control. The system is scalable to handle up to 2500 tx/h, and the federated learning pipeline classifies PPI risk with an area under the receiver operating characteristic curve (AUC) of 0.91. These results support the effectiveness of our system in delivering real-time, regulation-compliant, and clinically actionable cardiac care in distributed environments.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 5","pages":"Article 100404"},"PeriodicalIF":6.5,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149251641","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":"Virtual influence, real impact: Deciphering social media sentiment and its effects on cryptocurrency market dynamics","authors":"Iheb Ghazouani, Ines Ghazouani, Abdelwahed Omri","doi":"10.1016/j.bcra.2025.100375","DOIUrl":"10.1016/j.bcra.2025.100375","url":null,"abstract":"<div><div>This research investigates the effect of social media sentiment on the cryptocurrency market, particularly focusing on Bitcoin and Ethereum. Using TensorFlow as a machine learning tool, we developed a sentiment index from 66,582 Reddit posts about Bitcoin and 23,231 about Ethereum, collected in 2022. The sentiment scores, ranging from −1 (negative) to 1 (positive), were categorized into positive, neutral, and negative classes and analyzed alongside daily return and volatility metrics for both cryptocurrencies using a Vector Autoregression (VAR) model. Our study identifies significant impacts of social media sentiment on cryptocurrency markets. Specifically, Bitcoin’s returns show a heightened sensitivity to negative sentiment, whereas Ethereum’s returns remain unaffected by any sentiment type. However, the volatility of both cryptocurrencies is affected by neutral sentiment. These findings highlight distinct behavioral patterns across cryptocurrencies and uncover a bidirectional relationship between market dynamics and social media sentiment. This study offers novel insights into how public perception influences digital asset markets, thereby contributing to the behavioral finance literature and providing practical implications for investors and policymakers.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 5","pages":"Article 100375"},"PeriodicalIF":6.5,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149159523","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}
Hina Binte Haq, Syed Taha Ali, Asad Salman, Patrick McCorry, Siamak F. Shahandashti
{"title":"Carbyne: An ultra-lightweight DoS-resilient mempool for Bitcoin","authors":"Hina Binte Haq, Syed Taha Ali, Asad Salman, Patrick McCorry, Siamak F. Shahandashti","doi":"10.1016/j.bcra.2025.100391","DOIUrl":"10.1016/j.bcra.2025.100391","url":null,"abstract":"<div><div>The Bitcoin mempool plays an integral role in transaction processing and propagation through the network. Frequent transaction congestion events, as well as spam and dust attacks, can clog the mempool, leading to dropped transactions, processing delays, and increased transaction fees. Moreover, increasing transaction loads on the network result in higher resource costs to operate full nodes, thereby restricting Bitcoin's network footprint and negatively impacting its overall health and performance. In this paper, we present Carbyne, a novel mempool optimization scheme, which uses counting bloom filter constructions to adapt to increased transaction flows, thereby making nodes resilient to congestion, spam, and dust attacks. We implement Carbyne in C++ and benchmark its performance using a novel dataset of Bitcoin mempool activity over a 90-day period. We dramatically reduced the mempool's memory consumption by up to two orders of magnitude (from 300 MB to 3 MB) while verifying and forwarding transactions with 99.9% fidelity and a slight increase in computational load. We simulate extensive spam attacks on Carbyne and demonstrate that mempool loads of 1 GB can be accommodated in as little as 10 MB. Carbyne does not necessitate a hard fork; it will help deploy high-functioning nodes on resource-constrained platforms, and it may also be adapted to other cryptocurrencies.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 5","pages":"Article 100391"},"PeriodicalIF":6.5,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149346678","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":"Security checklists for Ethereum smart contract development: Patterns and best practices","authors":"Lodovica Marchesi, Livio Pompianu, Roberto Tonelli","doi":"10.1016/j.bcra.2025.100367","DOIUrl":"10.1016/j.bcra.2025.100367","url":null,"abstract":"<div><div><strong>Context:</strong> Smart contracts and decentralized applications (DApps) are becoming increasingly important and widespread. DApps are often business-critical, and strong security guarantees must be ensured. However, developing safe and reliable smart contracts remains a challenging task. Despite growing literature, simple and actionable tools to address security issues are still lacking. <strong>Objective:</strong> This study identifies design patterns and best practices for DApp security. We categorize them into twelve critical areas based on their security goals and map them to the architecture of decentralized applications. For each item, we define concrete actions to support secure implementation. These are further structured into three security assurance checklists. <strong>Method:</strong> We analyze existing literature and manually review 224 security items, consolidating duplicates and harmonizing terminology. This process results in 84 unique items, divided into 36 design patterns and 48 best practices, further grouped into 12 categories. We also map the items into three checklists based on the development phase of the DApp lifecycle. Finally, for each pattern and practice, we derive 374 actionable security tasks to guide secure development. <strong>Results:</strong> To the best of our knowledge, this is the most comprehensive and structured collection of DApp security items to date. The proposed framework and checklists help developers ensure the consistent and complete application of secure design principles. <strong>Conclusion:</strong> Focusing on Ethereum and Solidity, we present a comprehensive framework for improving DApp security. Our work supports ongoing efforts to reduce vulnerabilities in decentralized applications and provides developers with practical tools to build safer, more reliable systems.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 4","pages":"Article 100367"},"PeriodicalIF":6.5,"publicationDate":"2026-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148738727","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}
Hasan Falah Hasan, Mohd Najwadi Yusoff, Je Sen Teh, Shams Mhmood Abdali
{"title":"EMCPF: Efficient multi-party conditional payment flow payment protocol on lightning payment channel network","authors":"Hasan Falah Hasan, Mohd Najwadi Yusoff, Je Sen Teh, Shams Mhmood Abdali","doi":"10.1016/j.bcra.2025.100359","DOIUrl":"10.1016/j.bcra.2025.100359","url":null,"abstract":"<div><div>Payment channel networks are cryptocurrency-era scaling solutions designed to function atop the lightning network. They aim to address the blockchain scalability trilemma by offering low transaction fees and nearly instantaneous processing confirmation times. However, security and privacy remain as adoption growth obstacles. The hashed timelock contract is the well-known conditional payment transfer protocol designed for payment channel networks. However, it can disclose identities and exchange histories, making it vulnerable to wormhole attacks. Additionally, current solutions rely either on the ideal anonymous communication channel assumption or fail to provide complete path privacy protection. In this paper, we propose the efficient multi-party conditional payment flow (EMCPF) protocol. It is a lightning network-compatible and privacy-preserving payment protocol designed to protect all user identities, reduce collateral locking time, and resist wormhole attacks. Moreover, it does not rely on ideal routing assumptions and instead employs layered encryption. Security analysis conducted under the universal composability model shows that no information can be disclosed if there is at least one honest user within the payment path. Functional analysis was also provided to support our privacy and security claims. We also performed theoretical analyses that compare EMCPF with other existing payment protocols based on complexity, efficiency, and the phases involved. Our simulations using lightning network snapshots show that EMCPF outperforms the current state-of-the-art solutions in terms of computational time and communication overhead.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"7 4","pages":"Article 100359"},"PeriodicalIF":6.5,"publicationDate":"2026-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148776301","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}