Blockchain Papers

Oluwatobiloba Olutunmbi

No abstract is available for this record.

B Srinivas, N Rukma Rekha, Subba Rao Y.V

Wireless Sensor Networks (WSNs) are widely used in critical applications such as environmental monitoring, healthcare, industrial automation, and military surveillance; however, their resource constraints, wireless communication, and unattended deployment make them highly vulnerable to node capture attacks.In such attacks, adversaries physically compromise sensor nodes to extract cryptographic keys and sensitive information, leading to key leakage, node impersonation, communication disruption, and large-scale network compromise.Existing key management schemes often rely on static key structures, they lack forward secrecy, and fail to identify structurally vulnerable nodes, resulting in weak resilience against progressive node capture attacks.To address these limitations, this paper proposes a threshold-based ECDHE-TSSS key management framework to detect vulnerable nodes and mitigate node capture attacks in WSNs.The proposed scheme introduces an attack matrix based on graph-theoretic metrics to identify high-risk nodes and provide adaptive protection through decentralized masking of secret shares.The Proposed Scheme integrates Elliptic Curve Diffie-Hellman Ephemeral (ECDHE) with Threshold Shamir Secret Sharing (TSSS) to achieve forward secrecy and strong resistance against node compromise while maintaining lightweight operations suitable for resource-constrained environments.A layered security architecture incorporating Schnorr-based Non-Interactive Zero-Knowledge Proof (NIZKP) authentication and distributed key revocation further enhances network resilience and secure communication.Simulation results demonstrate that the proposed scheme significantly reduces key compromise probability and improves overall network robustness compared with existing approaches.

Nirmalkumar S. Benni, G. C. Jagan, C. Tamizhselvan, Manjunath G. Asuti

Mobile Ad Hoc Networks, also known as MANETs, are complex Cyber-Physical Systems which require a reliable and secure infrastructure due to the enormous amounts of data that are generated by users. MANETs are a collective term that refers to all Internet-enabled gadgets, sensors, and actuators, regardless of whether or not each of these components is linked to mobile networks. There is the potential for even a single high-tech mobile device to generate enormous volumes of data. During the course of this research, Distributed Ledger Technology is investigated, and information is gathered on consensus procedures and the possible applications of these techniques in MANETs, which are the basis of wireless networks. At the moment, there are a number of distributed ledger networks that are operational. There are a variety of decentralized applications; some are more often seen in the financial sector or supply chains. The blockchain may be decentralized and safe, but there are costs and benefits to using any of these networks. A consensus method that meets the needs of MANETs may be designed using the results of this investigation.

Rithika S, Thrisha S, Uma Mageshwari M, Vaishali D · 5 authors

Peer-to-peer (P2P) interaction forms a foundational layer of Web3 ecosystems, enabling participants to exchange data directly without depending on centralized brokers. In practical deployments, however, end-to-end reachability is often obstructed by network address translation, firewalls, and transient routing paths, which pushes architects toward the use of intermediate relay nodes. Unfortunately, relays that behave inconsistently or act maliciously can introduce a range of undesirable effects, including dropped packets, elevated latency, selective forwarding, and denial-of-service conditions. To mitigate these risks, this work presents a reputation-aware relay selection framework that lever-ages a blockchain substrate to govern trust. Every participant in the overlay is issued a cryptographic identity; the quality of service delivered by each relay is then tracked at runtime through metrics such as delivery ratio, round-trip delay, and transmission failure rate. A smart contract layer aggregates these observations into a dynamic reputation score that is recorded on an immutable ledger. When a communication session is being established, relays with higher reputation are preferred, while those exhibiting suspicious or degraded behavior are deprioritized or excluded. Experimental results indicate that, compared with conventional relay-selection strategies, the proposed approach delivers higher reliability, lower effective latency, and stronger resistance to malicious participation, making it a practical candidate for secure Web3 P2P communication.

Lyudmila Kovalchuk, Mariia Rodinko, Roman Oliynykov, Volodymyr Artemchuk

This paper studies the probability of a double-spend attack in an Ouroboros-like Proof-of-Stake (PoS) setting when confirmation decisions must be made for a finite number of blocks. Existing security analyses of Ouroboros-family protocols are mainly asymptotic and therefore do not directly provide the attack probability for a fixed confirmation depth. We consider an analytically tractable model that allows empty slots and multiple slot leaders, and assumes fixed stake distribution within an epoch, one-block growth of the public longest chain in any slot containing at least one honest leader, and next-slot block visibility. These assumptions hold when the time slot length is much greater than the network delay, and are applicable to practical deployment scenarios such as Cardano. Under these assumptions, for the first time, an exact closed-form solution for the success probability of a double-spend attack considering a realistic model with multiple leaders and empty time slots. Numerical examples illustrate how the required confirmation depth depends on the adversarial stake ratio and the active slot coefficient. The results apply to the stated analytical model and do not yet cover delayed fork resolution or the full protocol-level fork-choice and finality mechanisms of Ouroboros Praos.

C. Selvan, M. A. Gunavathie, Sini Anna Alex, Shaik Jaffar Hussain

ABSTRACT Appropriate routing strategies are necessary for mobile ad hoc networks (MANETs) in order to facilitate effective data transfer. In order to counter the prevailing problems, the correct routing schemes will need to be selected as the default configurations are used. In this paper, a special optimal link state routing (OLSR) protocol is proposed to incorporate a deep learning methodology to facilitate efficient video streaming in MANETs. This study presents a new improved variant of the OLSR protocol, which is specially tailored to achieve efficient video streaming in MANETs. It is a radical approach that combines a deep‐learning model with blockchain technology to overcome security and reliability issues. It starts with the gathering of video content that is available publicly. In order to detect black‐hole nodes, a special twin‐attention‐based Elman spiking neural network model is applied. The reliability of the neighboring nodes is then measured by means of trust values. The pufferfish optimization algorithm, or the accuracy‐aware energy‐efficient multipath routing algorithm (AEMRAP), which takes into account node‐ and link‐stability degrees, is used in making routing decisions. Interplanetary file system (IPFS) technology is used to store the data on blockchain and increase its security. The authentication of the blockchain architecture is conducted via the delegated proof‐of‐stake (DPoS) method that also delivers an extra protection of MANETs against unauthorized access. The study demonstrates superior performance in securing and optimizing video transmission, confirming that the extended OLSR protocol is highly effective for MANET video streaming applications. The proposed model exceeds the current approaches with a throughput of 2100 Kbps, an average end latency of 20.2 s, and a packet‐delivery ratio of 92.3%.

Yu Gao, Carlo Campajola, Nicolò Vallarano, Andreia Sofia Teixeira · 5 authors

IOTA is a distributed ledger technology that relies on a peer-to-peer (P2P) network for communications. Recently an auto-peering algorithm was proposed to build connections among IOTA peers according to their “Mana" endowment, which is an IOTA internal reputation system. This paper’s goal is to detect potential vulnerabilities and evaluate the resilience of the P2P network generated using IOTA auto-peering algorithm against eclipse attacks. In order to do so, we interpret IOTA’s auto-peering algorithm as a random network formation model and employ different network metrics to identify cost-efficient partitions of the network. As a result, we present a potential strategy that an attacker can use to eclipse a significant part of the network, providing estimates of costs and potential damage caused by the attack. On the side, we provide an analysis of the properties of IOTA auto-peering network ensemble, as an interesting class of homophile random networks in between 1D lattices and regular Poisson graphs.

Rekha K S, Bhat Geetalaxmi Jairam, Jagruthi H, Shashank Dhananjaya · 8 authors

The Internet of Things (IoT) has made secure and reliable data communication more difficult due to its dynamic topologies, energy constrictions, and intelligent and sophisticated adversaries.To address these difficulties in IoT networks, we propose G-TrustChain, an integrated hybrid framework based on Graph Neural Networks (GNNs) for intelligent and dynamic routing and a light Blockchain for distributed trust.G-TrustChain makes use of node-level parameters including latency, remaining energy, and behavioural trust scores derived from a Graph Attention Network (GAT) for routing paths.A lightweight Directed Acyclic Graph (DAG)-structure Blockchain maintains trust scores with a distributed, scalable, and tamper-proof ledger that minimizes dependency on a centralized authority.Experimentation is done for 10,000 rounds, G-TrustChain demonstrated superior routing performance to other protocols such as Trust-based Routing, BBTR, and ROUTENET.It is achieving 95.6% packet delivery ratio, 91.2% detection rate of attacks, and energy consumption as low as 0.0110 J/bit.Also achieving more accurate and reliable trust scores despite energy constraints and higher/extensive attacks.These outcomes demonstrated G-TrustChain provides energy-efficient, secure, and intelligent data communication for the next generation of IoT networks.

C. Aparna, S. Radha, C. Aarthi, K. M. Karthick Raghunath

ABSTRACT Mobile Ad hoc networks (MANETs) are key for applications in which flexibility and organization are paramount, but the security of such networks entails threats that can exploit the vulnerability of their open architecture, resulting in various attacks. To address such issues, a novel architectural framework is always required. One such framework is introduced, namely, the HoneyFed Secure Architecture (HFSA), which provides the combination of an advanced honey encryption system with federated learning‐based decentralized security to improve the security of MANET. Honey encryption, on the other hand, employs adaptive deception techniques to generate plausible decoy data on decryption failure, employs dynamic key management for tamper resistance, and provides perfect authentication through multi‐factor methods and zero‐knowledge proofs. We found that federated learning offers decentralized model training, where nodes jointly train local models while exchanging progress updates without exposing raw data, enabling 81.4% more detections of emerging threats while preserving data privacy. Using the proposed HFSA approach achieves a 78% protection improvement against attacks and a 71% reduction in unauthorized access. HFSA offers a robust and scalable framework of security that uses continuous learning and adaptation to the vulnerabilities of the MANETs to enhance network resilience.

Suale Yakubu, Agnes Mindila, Peter K. Kihato

ABSTRACT The emergence of wireless technology brought about enhanced communication across various devices, resulting in the demand for efficient and reliable wireless networks, like wireless mesh networks (WMNs) and mobile Ad‐hoc Networks (MANETs). MANETs are known for their decentralized nature, rapid deployment, infrastructure‐less operation, adaptability, and ease of use in several applications and outdoor events. Despite their flexibility, they often face challenges relating to security vulnerabilities, together with blackhole and grayhole attacks, and trade‐offs in terms of performance relating to reliability and integrity. This paper proposes an improved, innovative routing protocol for Ad‐hoc On‐Demand Distance Vector (AODV) by infusion of blockchain's proof of stake (PoS) consensus mechanism named PoSAODV, whose objective is to enhance security, energy‐efficiency, and adaptability while reducing packet loss rate, routing overheads, and increasing throughput. Smart contract‐based validator selection was utilized to ensure fairness and reduce blackhole and grayhole attacks. The result obtained through simulation demonstrates that PoSAODV outperforms the original AODV by reduced latency of 0.79 ms , average throughput of 45 Mbps , and packet delivery ratio of 80%–100% in both unsafe and safe environments. This makes PoSAODV suitable for resource‐constrained ad‐hoc networks with dynamic topologies.

Vijayan Sugumaran, E. Dinesh, R. Ramya, Elangovan Muniyandy

This research work proposes a Distributed Blockchain-Assisted Secure Data Aggregation (Block-DSD) technique for MANETs, ensuring high security and energy efficiency in disaster management scenarios. A Zone-based Clustering Approach (ZCA) is employed to segment the network into secure zones, with optimal Cluster Heads (CHs) selected using the Artificial Neuro-Fuzzy Inference System (ANFIS). Data aggregation is secured through a Two-Step Secure (STS) method and Elliptic Curve Cryptography (ECC), while optimal routing is achieved using the Improved Elephant Herd Optimization (IEHO) algorithm. Simulations using ns-3.25 demonstrate a 97% Packet Delivery Ratio (PDR), 20% lower energy consumption compared to existing methods, and minimal latency of 0.0012 s for emergency data, validating the proposed framework's efficiency and robustness in dynamic MANET environments.

Sayan Majumder, Debika Bhattacharyya, Swati Chowdhuri

Mobile ad hoc networks (MANETs) facilitate data communication across multiple nodes and hop stations, characterized by their dynamic topology. This inherent flexibility, however, makes MANETs vulnerable to various security threats, notably blackhole and wormhole attacks, where malicious nodes can intercept and manipulate data. This study investigates the security vulnerabilities of MANETs, particularly against blackhole, Sybil, and wormhole attacks, and introduces the Advanced Blockchain Dynamic Source Routing (ABCD) algorithm to address these challenges. Motivated by the need for robust and decentralized security solutions in MANETs, the proposed algorithm integrates blockchain technology and homomorphic encryption to secure data communication without intermediate decryption. The ABCD algorithm leverages Dijkstra’s algorithm for optimal routing and employs a tamper-proof, decentralized data storage approach. Comparative analysis under attack scenarios reveals that the ABCD algorithm outperforms the standard DSR protocol across multiple quality of service metrics, demonstrating a significant improvement in MANET security over equivalent studies. The packet delivery rate is also improved from 81 to 92% using the modified ABCD algorithm.

Scott Seidenberger, Anindya Maiti

We hypothesize that peer-to-peer (P2P) overlay network nodes can be attractive to attackers due to their visibility, sustained uptime, and resource potential. Towards validating this hypothesis, we investigate the state of active reconnaissance attacks on Ethereum P2P network nodes by deploying a series of honeypots alongside actual Ethereum nodes across globally distributed vantage points. We find that Ethereum nodes experience not only increased attacks, but also specific types of attacks targeting particular ports and services. Furthermore, we find evidence that the threat assessment on our nodes is applicable to the wider P2P network by having performed port scans on other reachable peers. Our findings provide insights into potential mitigation strategies to improve the security of the P2P networking layer.

S. Gopalakrishnan, E. D. Kanmani Ruby, D. Hemanand, R. Anitha · 6 authors

The incorporation or combination of Artificial Intelligence (AI) and blockchain technology into Mobile Ad Hoc Networks (MANETs) shows important factor for modern and advance smart city infrastructure and autonomous vehicular networks. This paper describes the complementary potential of the technologies to help the built-in difficulties of MANETs includes flexibility, protection, and data integrity. AI techniques such as machine learning and reinforcement learning, are emphasized to improve routing protocols to optimize data transmission rates, and decrease latency. Blockchain technology using Practical Byzantine Fault Tolerance (PBFT) and other consensus mechanisms, gives a tight and decentralized architecture for data handling assuring trust and integrity amidst network nodes. The appeal of these incorpoarted technologies is especially related for smart cities which depand on collection of data and evaluation for effective handling of urban operations such as flow of traffic, environmental observing, and consumption of energy. Autonomous vehicular networks needing rigd and strong communication and data transfer between vehicles and infrastructure, also help from the enhanced network functions and security provided by AI and blockchain incorpoaration. Experimental evaluation denotes improvements in crucial performance metrics. Sensor 2 persists the highest data transmission rate of 12 Mbps. Sensor 4 had the decreased at 9 Mbps. Latency measurements observed that Sensor 2 recorded the lowest latency at 45 ms, with Sensor 3 having the highest at 55 ms.

Huda A. Ahmed, Hamid Alasadi

A mobile ad-hoc network (MANET) necessitates appropriate routing techniques to enable optimal data transfer. The selection of appropriate routing protocols while utilizing the default settings is required to solve the existing problems. To enable effective video streaming in MANETs, this study proposes a novel optimized link state routing (OLSR) protocol that incorporates a deep-learning model. Initially, the input videos are collected from the Kaggle dataset. Then, the black-hole node is detected using a novel twin-attention-based dense convolutional bidirectional gated network (SA_ DCBiGNet) model. Next, the neighboring nodes are analyzed using trust values, and routing is performed using the extended osprey-aided optimized link state routing protocol (EO_OLSRP) technique. Similarly, the extended osprey optimization algorithm (EOOA) selects the optimal feature based on parameters such as node stability and link stability. Finally, blockchain storage is included to improve the security of MANET data using interplanetary file system (IPFS) technology. Additionally, the proposed blockchain system is validated utilizing a consensus technique based on delegated proof-of-stake (DPoS). The proposed method utilizes Python and it is evaluated using data acquired from various mobile simulator models accompanied by the NS3 simulator. The proposed model performs better with a packet-delivery ratio (PDR) of 91.6%, average end delay (AED) of 23.6 s, and throughput of 2110 bytes when compared with the existing methods which have a PDR of 89.1%, AED of 22 s, and throughput of 1780 bytes, respectively.

Pradeep Bonumaddi, Murugan Ramalingam

Nodes in Mobile Ad Hoc Networks (MANETs) are limited battery powered. That’s why energy efficient routing has become an important optimization criterion in MANETs. The conventional routing protocols do not consider energy of the nodes while selecting routes which leads to early exhaustion of nodes and partitioning of the network. This paper attempts to provide an energy aware routing algorithm. The proposed algorithm finds the transmission energy between the nodes relative to the distance and the performance of the algorithm is analyzed between two metrics Total Transmission energy of a route and Maximum Number of Hops. The proposed algorithm shows efficient energy utilization and increased network lifetime with total transmission energy metric.

Xiaoqin Feng, Fuliang Lin, Tao Feng, Jianfeng Ma · 6 authors

Secure and efficient identity authentication is a fundamental requirement in vehicular ad-hoc networks (VANETs); however, it remains challenging due to the highly dynamic network topology, stringent latency constraints, and the need for conditional privacy preservation. Existing authentication schemes either rely on public key infrastructures (PKI) with complex certificate management or introduce partially decentralized designs that still depend on trusted authorities, leading to inefficiencies and single points of failure. In this paper, we propose EBDA, an Ethereum-based fully distributed authentication mechanism for VANETs. The core innovation of EBDA is to replace the traditional PKI certificate system with a blockchain-maintained Graph of Trust (GoT). Through three dedicated smart contracts, EBDA fully decentralizes the management of vehicle identities and pseudonyms. Vehicles use pseudonyms to preserve privacy in Vehicle-to-Vehicle communications, while authentication is achieved certificate-free via transitive trust within the GoT. Importantly, latency-sensitive operations like message verification are executed off-chain through local checks, meeting VANETs’ strict real-time requirements. A prototype implementation and extensive evaluations demonstrate that EBDA significantly reduces authentication latency by at least 22.93% compared with representative blockchain-assisted and PKI-based baselines while maintaining low computational and storage overhead. These results confirm the feasibility of deploying GoT-based decentralized authentication in practical VANET environments.

Marija Mikić, Mihajlo Srbakoski

Protecting the privacy of blockchain transactions is extremely important for users. Stealth address protocols (SAP) allow users to receive assets via stealth addresses that they do not associate with their stealth meta-addresses. SAP can be generated using different cryptographic approaches. DKSAP uses an elliptic curve multiplication and hashing of the resulting shared secret. Another approach is to use a elliptic curve pairing. This paper presents four SA protocols that use elliptic curve pairing as a cryptographic solution. ECPDKSAPs are pairing-based protocols that include viewing key and spending key, while ECPSKSAP is a pairing-based protocol that uses a single key with which spending and the viewing key are derived. We find that ECPDKSAPs give significantly better results than DKSAP with the view tag. The best results are achieved with Protocol 3 (Elliptic Curve Pairing Dual Key Stealth Address Protocol), which is Ethereum-friendly. ECPSKSAP is significantly slower, but it provides an interesting theoretical result as it uses only one private key.

Samaneh Rashidibajgan, Thomas Hupperich

Opportunistic networks (OppNets) are usually a set of smart, wearable, and portable devices or entities with mobility that connect wirelessly without requiring infrastructure. Such a network is of great importance in data transmission, particularly in incidents and disasters, whether man-made or natural. However, message integrity and confidentiality are of concern when it deals with vital and physiological data transmission with strict privacy regulations. In this work, we offered a structure to classify messages based on their priority in different queues. Furthermore, due to the decentralized architecture of OppNets, we proposed a blockchain-based structure for providing security for high-priority messages. It contains three sequences of functional blocks with a light and simplified implementation that makes it suitable for battery-powered wearable devices that are limited in energy consumption and computational units. The simulation results showed that by increasing the number of nodes in the network, the average of the changes in block sizes are neglectable which addresses the computation bottleneck. Furthermore, we analyzed the performance of the proposed structure in terms of message delivery and network overhead compared with Epidemic and Prophet routing algorithms. These results indicated advancing the overall performance of the proposed algorithm.

Ruilin Lai, Gansen Zhao, Yale He, Zhihao Hou

Blockchain establishes security and trust in mobile ad hoc networks (MANETs). Due to the decentralized and opportunistic communication characteristics of MANETs, hashgraph consensus is more applicable to the MANET-based blockchain. Sharding scales the consensus further through disjoint nodes in multiple shards simultaneously updating ledgers. However, the dynamic addition and deletion of nodes in a shard pose challenges regarding robustness and efficiency. Particularly, the shard is vulnerable to Sybil attacks and targeted attacks, and dishonest gossip reduces the efficiency of hashgraph consensus. Therefore, we proposed a behavior-based sharding hashgraph scheme. First, dishonest behaviors of nodes are recorded in a decentralized blacklist. Gossip information is sent to a reliable neighbor, and gossip information from another reliable neighbor is received. Second, a tree-assisted inter-sharding consensus is proposed to prevent Sybil attacks. The combination of shard recovery and reconfiguration based on node state is devised to prevent targeted attacks. Finally, we conducted the performance evaluation including security analysis and experimental evaluation to reveal the security and efficiency of the proposed scheme.

Hamza Sohail, Mahmood ul Hassan, M. A. Elmagzoub, Adel Rajab · 9 authors

A vehicular ad hoc network (VANET) is a technique that uses vehicles with the ability to sense data from the environment and use it for their safety measures. Flooding is a commonly used term used for sending network packets. VANET may cause redundancy, delay, collision, and the incorrect receipt of the messages to their destination. Weather information is one of the most important types of information used for network control and provides an enhanced version of the network simulation environments. The network traffic delay and packet losses are the main problems identified inside the network. In this research, we propose a routing protocol which can transmit the weather forecasting information on demand based on source vehicle to destination vehicles, with the minimum number of hop counts, and provide significant control over network performance parameters. We propose a BBSF-based routing approach. The proposed technique effectively enhances the routing information and provides the secure and reliable service delivery of the network performance. The results taken from the network are based on hop count, network latency, network overhead, and packet delivery ratio. The results effectively show that the proposed technique is reliable in reducing the network latency, and that the hop count is minimized when transferring the weather information.

N. Ilakkiya, A. Rajaram

MANETs aredecentralized network that involves mobile nodes. As the overall network is mobile and has no centralization, network management, routing, and security become very challenging. Though many works have been presented, still there is a lack in organizing the network due to unauthorized access, centralized security schemes, and the dynamic nature of the nodes. This paper proposed a novel Blockchain-assisted Secure Routing (Block-Sec) protocol for MANETs. All mobile nodes are authenticated by Distributed One-Time Passcode (DOT) based authorization scheme. All authorized nodes are segregated into multiple clusters based on Weight based Dynamic Clustering (WDC) algorithm in which multiple metrics are considered in clustering and re-clustering processes. After cluster formation, each cluster is elected with optimal Cluster Head (CH) by Strawberry Optimization (SBO) algorithm with a new objective function. After cluster formation, the optimal route is selected by Fast Neural Net-assisted Fuzzy (FNNF) algorithm by combining multiple variables. Data transmission is secured by Efficient Elliptic Curve (E2C2) algorithm. With the combined algorithms, the proposed approach obtainedimproved efficiency in packet delivery ratio (PDR), throughput, time analysis, and security level.

Nitesh Ghodichor, Raj Thaneeghavl, Dinesh Kumar Sahu, Gautam M. Borkar · 5 authors

MANET is a collection of mobile nodes that communicate through wireless networks as they move from one point to another. MANET is an infrastructure-less network with a changeable topology; as a result, it is very susceptible to attacks. MANET attack prevention represents a serious difficulty. Malicious network nodes are the source of network-based attacks. In a MANET, attacks can take various forms, and each one alters the network's operation in its unique way. In general, attacks can be separated into two categories: those that target the data traffic on a network and those that target the control traffic. This article explains the many sorts of assaults, their impact on MANET, and the MANET-based defence measures that are currently in place. The suggested SRA that employs blockchain technology (SRABC) protects MANET from attacks and authenticates nodes. The secure routing algorithm (SRA) proposed by blockchain technology safeguards control and data flow against threats. This is achieved by generating a Hash Function for every transaction. We will begin by discussing the security of the MANET. This article's second section explores the role of blockchain in MANET security. In the third section, the SRA is described in connection with blockchain. In the fourth phase, PDR and Throughput are utilised to conduct an SRA review using Blockchain employing PDR and Throughput. The results suggest that the proposed technique enhances MANET security while concurrently decreasing delay. The performance of the proposed technique is analysed and compared to the routing protocols Q-AODV and DSR.

Wenpin Tang, David Yao

We study a mechanism design problem in the blockchain proof-of-stake (PoS) protocol. Our main objective is to extend the transaction fee mechanism (TFM) recently proposed in Chung and Shi (SODA, p.3856-3899, 2023), so as to incorporate a long-run utility model for the miner into the burning second-price auction mechanism $\texttt{BSP}(γ)$ proposed in Chung and Shi (where $γ$ is a key parameter in the strict $γ$-utility model that is applied to both miners and users). First, we derive an explicit functional form for the long-run utility of the miner using a martingale approach, and reveal a critical discontinuity of the utility function, namely a small deviation from being truthful will yield a discrete jump (up or down) in the miner's utility. We show that because of this discontinuity the $\texttt{BSP}(γ)$ mechanism will fail a key desired property in TFM, $c$-side contract proofness ($c$-SCP). As a remedy, we introduce another parameter $θ$, and propose a new $\texttt{BSP}(θ)$ mechanism, and prove that it satisfies all three desired properties of TFM: user- and miner-incentive compatibility (UIC and MIC) as well as $c$-SCP, provided the parameter $θ$ falls into a specific range, along with a proper tick size imposed on user bids.