Blockchain Papers

Xuecheng Lin, Decun Luo, Qianhong Wu, Bo Qin

No abstract is available for this record.

Steven Paul Nohr

<b><i>Proof-of-Stake (PoS)</i></b> blockchain networks replace energy-intensive mining with validator-based block production and transaction ordering. While this design improves efficiency and scalability, it introduces a largely unexamined structural vulnerability: deterministic or predictable validator sequencing. This paper defines <b>Sequential Validator Front-Running</b><b> </b>as a validator-level exploit whereby participants leverage foreknowledge of execution slots to extract economic advantage, manipulate outcomes, or preempt competing transactions. Unlike classical Miner/Maximal Extractable Value (MEV), this exploit arises from consensus scheduling itself rather than transaction visibility alone. We analyze the structural causes of this vulnerability, demonstrate why conventional mitigations such as governance controls, slashing, and post-hoc monitoring are insufficient, and propose a logic-layer sequencing constraint framework enforced at block construction time. The proposed approach neutralizes sequencing abuse while preserving throughput, finality, and protocol compliance.

Simona Češková

Tato diplomová práce se zaměřuje na problematiku MEV útoků, které jsou provedené v prostředí blockchainu postaveném na proof-of-stake protokolu. Tyto MEV snižují tak bezpečnost, stabilitu a důvěru sítě. Práce se nejprve se zabývá teoretickým úvodem do problematiky, spolu s analýzou jednotlivých MEV útoků: front-running, back-running, sandwich útok a arbitráž. Jednotlivé útoky jsou ohodnoceny podle jejich vlivu na síť, uživatele, transakce a konsensus. Dále se práce věnuje existujícím mitigačním technikám a jejich kombinacím, zahrnující řešení permutace, šifrování transakcí, opožděná exekuce bloků a jejich rozšíření. Zároveň se zabývá i aktuální proposal-builder separation architekturou, která je aplikovaná v Ethereum blockchainu. Práce se poté koncentruje na konkrétní návrhy využití těchto mitigačních technik jako je BlindPerm, MEVade a MEV-Boost řešení. Dále se zabývá simulací a analýzou vlivu MEV útoků na tyto mitigační metody. Simulace je rozdělena do několika oddělených experimentů, které se zaměřují na jednotlivé klíčové vlastnosti. Výsledky těchto experimentů na sebe navzájem navazují a tvoří robustní analýzu slabých i silných bodů návrhů mitigačních technik. Tyto výsledky jsou porovnány a diskutovány pro možné další rozšíření práce.

Arda Hacıfevzioğlu, Kübra Kalkan

No abstract is available for this record.

Swaminathan Balasubramaniam, Jorge Sabat, Luana Zaccaria

Proof-of-stake networks implement incentive-compatible transaction verification by requiring validators to post collateral, or stake, that can be forfeited upon failure. While the resilience of these networks rests on decentralization, validation activity is increasingly delegated to few professional operators. Motivated by the September 2025 Kiln security incident, where professional-but not solo-validators experienced a sharp decline in effectiveness, we develop a model of delegated validation. Delegation expands access by pooling collateral and lowering the operational burden borne by individual validators, and can improve efficiency through professional expertise and scale. At the same time, delegated validation concentrates operational infrastructure, increasing exposure to common shocks. The protocol therefore faces a tradeoff: tighter collateral requirements strengthen discipline, but can shift activity toward intermediated providers, raising concentration and correlated losses in stress states. Liquid staking tokens amplify this tradeoff by adding private liquidity and collateral-use benefits to delegation, and can move the system from a low-delegation equilibrium to a self-sustaining high-delegation equilibrium. Anti-correlation penalties mitigate this force by pricing correlated failures more directly and can reduce reliance on high collateral requirements.

Ali Ahmadian, Ashok Kumar Yadav, Om Pal, Массимилиано Феррара

No abstract is available for this record.

Mohammad Pishdar, Jawad Manzoor

ABSTRACT Blockchain technology has emerged as a foundational infrastructure for decentralized applications, where consensus protocols play a critical role in ensuring security, consistency and trust among distributed participants. This paper presents a comprehensive comparative analysis of nine widely adopted consensus protocols across public (proof of work [PoW], proof of stake [PoS], delegated proof of stake [DPoS]) and private (practical Byzantine fault tolerance [PBFT, Raft, Kafka, proof of elapsed time [PoET], yet another consensus [YAC], Paxos) blockchain systems. Unlike prior surveys, this work integrates workflow‐level operational modelling, quantitative performance comparison and application‐driven decision support within a unified analytical framework. Our analysis shows that PoW achieves strong decentralization at 3–15 transactions per second (TPS) with 10–60 min finality, whereas PoS improves throughput to tens to thousands of TPS with seconds‐to‐minutes finality while reducing energy consumption by approximately 99%. Private blockchain protocols such as PBFT and Kafka achieve sub‐second latency and throughput exceeding 10,000 TPS by trading off decentralization for performance and control. Furthermore, we develop a decision‐support framework that maps consensus mechanisms to application requirements and provides a critical synthesis of security risks, scalability limitations, and emerging solutions. The findings highlight that no single protocol satisfies all design goals, reinforcing the necessity of context‐aware consensus selection.

Michael J. Freedman

Distributed Ledger Technology (DLT) has revolutionized how digital transactions are recorded and verified, enabling decentralized trust without intermediaries. Cryptography plays a foundational role in ensuring the integrity of data within these ledgers by providing mechanisms for secure data hashing, digital signatures, and consensus protocols. This paper explores the cryptographic techniques essential to maintaining integrity in DLT, including hash functions, public-key cryptography, and Merkle trees. We analyze how these tools mitigate tampering and fraud while supporting transparency and immutability in distributed environments. A comparative overview of cryptographic primitives in popular blockchain platforms is also provided. The study concludes by highlighting future challenges and potential advancements in cryptographic methods for enhancing DLT integrity.

Hojung Lim, Dong-Myung Shin

No abstract is available for this record.

Alsaadah Saif Mohammed ALabri, Shahd Ibrahim Ali AL Balushi

Blockchain is a distributed database used to store an unchangeable, permanent record of all transactions. It is operated by processors that are a member of a peer-to-peer (P2P) network and functions as a decentralized database. Demand for decentralized applications (DApps), which provide accountability, safety, and independence beyond conventional centralized systems, is rising as a result of the quick development of blockchain technology. However, combining frontend, back end, and blockchain components into a unified and effective framework might be difficult for DApp designers. In order to simplify the creation of decentralized applications, this study suggests a full-stack blockchain framework that connects various levels. The framework creates an end-to-end development environment designed for compatibility and scalability by utilizing contemporary technologies, such as Solidity, with Web3.js for smart contract integration, React.js for the front-end, and Node.js/Express.js for the backend. Using cryptographic methods and decentralized storage (like IPFS), a layered architecture is intended to provide modularity, effective data flow, and increased security. The suggested framework streamlines DApp development processes, lowers latency in blockchain interactions, and boosts developer efficiency, according to implementation data. By offering a thorough architectural blueprint and execution method for full-stack DApp creation, this study advances the area of blockchain engineering and opens the door for safe, effective, and user-focused decentralized ecosystems.

Павло Жержерунов, Oleksandr Shmatko

Dockerised blockchain solution can mitigate the low levels of distributed technology adoption in small and medium enterprises. It can be done via designing and implementing an environment which inherits ease of deployment and scalability of containerized systems with safety and transparency of distributed applications. Practical implementation of a dockerized blockchain solution designed as a demonstrative implementation for existing client–server architecture is described in this paper. This solution uses Docker containers to simplify the setup and deployment of a private blockchain network, a mediator server and a reverse proxy. Implementation of this system on a low scale demonstrates feasibility of integrating blockchain technology into existing business processes without fundamental architectural changes and acknowledges deployment and maintaining challenges that usually accompany distributed systems using private blockchain. Discussed implementation is a demonstration of designed architecture being potentially a reproducible and easily maintainable environment for logging and validating data through an immutable ledger on a smaller scale. Proof of concept successfully validates the core idea. The implementation shows a mediator server intercepting client request, recording them on a private Ethereum blockchain via a JSON-RPC interface, and then forwarding them to the original server. This confirms the solution’s ability to introduce a trusted, intermediate layer for data immutability. The project demonstrates a working framework for embedding distributed ledger technologies into client–server ecosystems. While the current Proof of Work consensus mechanism presents scalability limitations, the architecture provides a strong foundation for future research, including migrating to more efficient consensus mechanisms and integrating smart contracts.

Pavlo Zherzherunov, Olexandr Shmatko

Dockerised blockchain solution can mitigate the low levels of distributed technology adoption in small and medium enterprises. It can be done via designing and implementing an environment which inherits ease of deployment and scalability of containerized systems with safety and transparency of distributed applications. Practical implementation of a dockerized blockchain solution designed as a demonstrative implementation for existing client–server architecture is described in this paper. This solution uses Docker containers to simplify the setup and deployment of a private blockchain network, a mediator server and a reverse proxy. Implementation of this system on a low scale demonstrates feasibility of integrating blockchain technology into existing business processes without fundamental architectural changes and acknowledges deployment and maintaining challenges that usually accompany distributed systems using private blockchain. Discussed implementation is a demonstration of designed architecture being potentially a reproducible and easily maintainable environment for logging and validating data through an immutable ledger on a smaller scale. Proof of concept successfully validates the core idea. The implementation shows a mediator server intercepting client request, recording them on a private Ethereum blockchain via a JSON-RPC interface, and then forwarding them to the original server. This confirms the solution’s ability to introduce a trusted, intermediate layer for data immutability. The project demonstrates a working framework for embedding distributed ledger technologies into client–server ecosystems. While the current Proof of Work consensus mechanism presents scalability limitations, the architecture provides a strong foundation for future research, including migrating to more efficient consensus mechanisms and integrating smart contracts.

Marko Vukolić, Orestis Alpos, Jakov Mitrovski, Themis Papameletiou · 6 authors

This paper introduces Bitcoin-IPC, a protocol that scales Bitcoin through a network of permissionless, interconnected, programmable Proof-of-Stake (PoS) Layer-2 chains, called subnets, whose stake is denominated in L1 BTC. These subnets rely on Bitcoin L1 for the communication of critical information, settlement, and security. Subnets can communicate with each other and with Bitcoin: users deposit BTC from Bitcoin to a subnet and withdraw it back, and transfer wBTC directly between subnets. We provide formal definitions of these bridge protocols, incorporating a firewall property that limits the impact of malicious subnets on the security of the broader network. Our design, inspired by SWIFT messaging and embedded within Bitcoin's SegWit mechanism, enables seamless value transfer across L2 subnets. Uniquely, this mechanism reduces the virtual-byte cost per transaction (vB/tx) by up to 23x, compared to transacting natively on Bitcoin L1, effectively increasing monetary-transaction throughput from 7 tps to over 160 tps, without requiring any modifications to Bitcoin L1.

Kichang Lee, Sungmin Lee, Jaeho Jin, JeongGil Ko

Modern cloud-based AI training relies on extensive telemetry and logs to ensure accountability. While these audit trails enable retrospective inspection, they struggle to address the inherent non-determinism of deep learning. Stochastic operations, such as dropout, create an ambiguity surface where attackers can mask malicious manipulations as natural random variance, granting them plausible deniability. Consequently, existing logging mechanisms cannot verify whether stochastic values were generated and applied honestly without exposing sensitive training data. To close this integrity gap, we introduce Verifiable Dropout, a privacy-preserving mechanism based on zero-knowledge proofs. We treat stochasticity not as an excuse but as a verifiable claim. Our approach binds dropout masks to a deterministic, cryptographically verifiable seed and proves the correct execution of the dropout operation. This design enables users to audit the integrity of stochastic training steps post-hoc, ensuring that randomness was neither biased nor cherry-picked, while strictly preserving the confidentiality of the model and data.

Tarik Ouardi

Temporal-Angular Quantum Addressing (TAQA) specifies a practical coordination layer for distributed quantum systems that operationalizes cycle-anchored phase-window execution. TAQA is designed for architectures where long-horizon absolute timestamp synchronization cannot be guaranteed and where continuous external timing infrastructure (GNSS, dedicated timing links, etc.) is undesirable, unavailable, or untrusted. Core idea Instead of scheduling actions at an absolute time, TAQA schedules actions by phase conditions on a shared cyclic phase convention \( \phi(t)\in[0,1)\cong \mathbb{S}^1 \) together with an explicit cycle index. Nodes execute when their locally estimated phase enters an agreed wrap-around-safe acceptance window within the intended cycle. This avoids “same phase / wrong cycle” ambiguity and supports deterministic coordination under explicit short-horizon error assumptions. What TAQA defines TAQA defines how to express and execute distributed quantum-network actions using classical metadata: Execution primitive (Q-Address style): TAQA expresses each executable action as a macro window + micro slot instruction. The macro window encodes the intended cycle and phase acceptance window; the micro slot provides local sequencing/offset ordering within that window using local hardware timing. Tick-canonical semantics: For interoperability and verification, TAQA adopts fixed-point ticks (integers) as canonical semantics (no floating-point boundary checks). Human-facing displays (HS degrees, HS index, SWT labels, etc.) are derived-only and must not be used for verification or boundary gating. Cycle anchoring: Every executable instruction is explicitly anchored to an intended cycle index to prevent ambiguous interpretation across repeated cycles. Optional audit hook: TAQA supports an optional post-execution signed audit receipt (TSAE-style) using the same tick-canonical context fields, suitable for optional anchoring (e.g., a ledger/Clockchain pattern). What TAQA does NOT define TAQA is a control-plane / metadata layer and does not modify quantum mechanics: It does not introduce a quantum time operator and does not change the Hilbert space. It does not define bootstrapping or clock-parameter estimation algorithms (offset/drift). These are handled by external initialization/tracking layers (e.g., bootstrapping protocols). It does not define cryptographic primitives or threat models. Security is defined by external, versioned security profiles. Applications enabled by TAQA TAQA provides a deterministic coordination layer for common distributed-quantum workflows, including: Phase-aligned distributed gate execution: remote node actions are triggered in the same cycle-anchored window; micro timing is local. Entanglement distribution scheduling: photon emission windows and BSM windows can be scheduled to coincide without continuous absolute-time synchronization. Temporal routing labels: cycle-anchored contexts can be used as temporal labels for routing, prioritization, and scheduling in repeater networks and distributed workflows. Security model (plug-in interface) TAQA treats Timeverse/Q-Address/TSAE fields as public context (not secrets). Security (signatures, nonce policy, anti-replay rules, canonical encoding, algorithm suites) is provided by an external Security Profile selected via a suite identifier (e.g., security_profile_id). TAQA fields may be bound as associated data (domain separation), but confidentiality and integrity are provided by the security layer. Normative dependencies (DOIs) TAQA is interoperable by construction and relies on the following published normative specifications: Phase-Coordination Series Conventions:https://doi.org/10.5281/zenodo.18068999 Q-Address: Macro Phase + Micro Slot:https://doi.org/10.5281/zenodo.18068997 Timeverse Security Profile:https://doi.org/10.5281/zenodo.18069423 Related context Theorem of Temporal Resolution Limitation and the Phase-Coordination Principle (v1.1):https://doi.org/10.5281/zenodo.17955430 Quantum Bootstrapping Protocol (QBP) v1.2:https://doi.org/10.5281/zenodo.18064435 Keywords: TAQA, distributed quantum computing, quantum networks, phase coordination, phase windows, cycle anchoring, Q-Address, ticks, interoperability, control plane, audit receipts, security profiles.

Sinka Gao, Guoqiang Li

Abstract In the realm of blockchains, synchronization challenges are two-folded. First, smart contracts from different blockchains cannot communicate with each other, making it hard to establish a trustworthy communication channel to share and maintain a universal state between each other. Second, transactions on different blockchains can hardly be ordered. Hence interference is expected. We need a novel way to handle interference. Traditional solutions involving third parties have safety and liveness issues and thus compromise between safety, permissionless, and liveness. ZK Multi-Blockchain Aggregatoris a multi-blockchain execution layer that leverages the power of zero-knowledge proof to minimize the trust base of multi-blockchain communication, which does not compromise safety, liveness, permissionless, and atomicity. In contrast to traditional blockchain bridges performing transactions on different blockchains separately and using a relay system to enforce the order of transactions and prevent interference, our method uses an entirely new approach, such that for each multi-blockchain transaction, it simulates the multi-blockchain transaction in its aggregator chain. Our aggregator uses zero-knowledge proofs of the simulation to convince involved blockchains to update their local state accordingly. On top of this layer, rich applications over multi-blockchains can run safely and efficiently.

Xi Lin, Junfeng Tian

Blockchain consensus mechanisms are fundamental to the security and decentralization of distributed ledgers. In Proof-of-Stake (PoS) systems, which are lauded for their energy efficiency, the fair and unpredictable selection of block proposers is paramount and relies heavily on secure random number generation. The RANDAO random number generation mechanism in the Gasper protocol is susceptible to hash collision attack, which can introduce adversarial bias in the block proposer selection process. From the perspective of resisting adversarial bias attacks, this paper examines the optimization of the Gasper consensus protocol, focusing on security issues such as vulnerabilities to hash collisions in RANDAO and high latency in asynchronous network environments. By analyzing the spatial–temporal distribution of historical block hashes, we propose a dual-round random number verification mechanism that enhances reliability through multiple validation models. We develop a dynamic game-theoretic model under incomplete information to analyze node strategy selection and interaction dynamics. Our experimental results demonstrate that the improved protocol (RABA-Gasper) offers superior resistance to attacks, fairness, and efficiency compared to conventional protocols. RABA-Gasper outperforms conventional ones, achieving a 6.8% attack success rate (vs. 32.7% for RANDAO and 18.2% for Two Look-Back) with 94.3% hash collision detection, a proposer Gini coefficient below 0.23, 2.3x higher throughput retention than RANDAO in asynchronous networks, and a slightly increased random number generation latency of 125 ms. Supported by a game-theoretic model, it guarantees security when honest nodes account for ≥2/3 of the total.

Ali Farahbakhsh, Giuliano Losa, Youer Pu, Lorenzo Alvisi · 5 authors

Permissionless blockchains achieve consensus while allowing unknown nodes to join and leave the system at any time. They typically come in two flavors: proof of work (PoW) and proof of stake (PoS), and both are vulnerable to attacks. PoS protocols suffer from long-range attacks, wherein attackers alter execution history at little cost, and PoW protocols are vulnerable to attackers with enough computational power to subvert execution history. PoS protocols respond by relying on external mechanisms like social consensus; PoW protocols either fall back to probabilistic guarantees, or are slow. We present Sieve-MMR, the first fully-permissionless protocol with deterministic security and constant expected latency that does not rely on external mechanisms. We obtain Sieve-MMR by porting a PoS protocol (MMR) to the PoW setting. From MMR we inherit constant expected latency and deterministic security, and proof-of-work gives us resilience against long-range attacks. The main challenge to porting MMR to the PoW setting is what we call time-travel attacks, where attackers use PoWs generated in the distant past to increase their perceived PoW power in the present. We respond by proposing Sieve, a novel algorithm that implements a new broadcast primitive we dub time-travel-resilient broadcast (TTRB). Sieve relies on a black-box, deterministic PoW primitive to implement TTRB, which we use as the messaging layer for MMR.

Carlos Melo, José Miqueias, Johnnatan Messias, Glauber Gonçalves · 7 authors

No abstract is available for this record.

P. Jeba Santhiya, Fackrudeen Ali Ahamed, Absalamova Gulmira Sharifovna, Christo Ananth · 6 authors

AQBCP is an Adaptive Quantum Byzantine Consensus Protocol that allows for trustless, scalable consensus in post-classical quantum blockchain systems. AQBCP has the capability of using hybrid quantum/classical methods (including dynamic pruning and quantum routing) to improve the reliability of its network and also improve how well it performs. AQBCP will have more than 50% BFT - which is greater than most classical algorithms - and can adapt to any changes in the network topological structure or the conditions of the quantum channels it uses. The analytical and simulation data shows AQBCP converges at a rate of O(log(n)), provides information theoretic security from classical and quantum enabled attacks and has better performance metrics for throughput and fault tolerance when run on current NISQ devices. The benchmarking of AQBCP with other post-quantum and quantum-classical protocols provides evidence that AQBCP is the best option and sets a base for future quantum secure distributed ledgers.

Lionel Beltrando

Blockchain technology, and more broadly distributed ledger systems, hold the promise of transforming financial infrastructures by enabling more transparent, auditable, and tamper-resistant systems. It is used to facilitate cross-border payments, bond issuance, and insurance processes. This technology has also fostered the emergence of decentralized finance (DeFi), which allows financial operations, such as lending and asset tokenization, to be conducted without relying on traditional financial intermediaries. However, beyond this ambition of disintermediation, the economic and technical reality reveals a more nuanced landscape. While the original promise of blockchain was to eliminate trusted third parties, in practice we are witnessing a transformation rather than a disappearance of their role. The landscape of trust has been reshaped around new intermediaries, such as cryptocurrency exchanges, digital asset custodians, and stablecoin issuers, which now play central roles within the ecosystem. The adoption of blockchain technology nonetheless remains constrained by energy costs, scalability limitations, and strict regulatory requirements. Achieving a sustainable balance between performance, security, and compliance therefore represents a key challenge for blockchains in financial applications. In this context, this thesis explores how the judicious integration of trusted components can enhance the efficiency and resilience of financial blockchains. It makes three main contributions. First, we demonstrate that adding a trusted component to each node is insufficient to improve Byzantine Reliable Broadcast resilience: even with attestations preventing equivocation, the threshold remains at n >= 3t+1 because malicious processes retain the selective omission strategy. This negative result establishes that naive integration of trusted hardware is ineffective and that a fundamental protocol redesign is necessary. Second, it introduces new Byzantine Reliable Broadcast protocols that leverage a minimal trusted component, a Trusted Monotonic Counter at the initiator, to achieve optimal resilience with only n >= 2f+1 processes, while reducing message complexity by nearly half compared to classical approaches. Third, it introduces TenderTEE, a new consensus protocol extending Tendermint (recently renamed Ignite) through TEE attestations, thereby reducing the number of required validators and communication costs while maintaining both safety and liveness. TenderTEE not only decreases the number of necessary nodes (or, for a given number of nodes, increases Byzantine fault tolerance) but also enables governance schemes characteristic of financial systems, such as tripartite structures, which were previously infeasible under classical consensus protocols tolerating one-third of Byzantine nodes. In addition to that, the thesis provides broader design guidelines for building efficient blockchains in the financial sector, highlighting the complementary role of trusted components alongside Proof-of-Stake mechanisms, sharding, and optimistic protocols.

Jiayong Chai, Jun Guo, Muhua Wei, Mo Chen · 5 authors

Blockchain systems have been widely adopted in today’s society, with consensus algorithms serving as their core component to ensure all participants in the network agree on a specific data state. Existing consensus algorithms such as Proof of Work (PoW), Proof of Stake (PoS), and the Practical Byzantine Fault-Tolerant Algorithm (PBFT) exhibit certain limitations in terms of scalability, security, and efficiency. To address these limitations, this paper proposes a novel Network-based Reputation Consensus (NRC) algorithm. The main research contributions of this work include the following: (1) An intelligent grouping mechanism that dynamically groups nodes based on network awareness, forming consensus groups with low internal latency and high bandwidth utilization, significantly reducing intra-group communication overhead. (2) A dynamic reputation system incorporating a “diminishing returns” reward function and a “multiplicative penalty” mechanism, effectively incentivizing honest node participation while preventing power monopoly. (3) A two-phase model of “intra-group BFT consensus + global communication committee ordering” that decomposes complex global consensus into parallel intra-group processing and coordination among a small set of elite nodes, thereby drastically improving efficiency. (4) Comprehensive simulations comparing the NRC algorithm with mainstream consensus algorithms, demonstrating its superior performance in communication overhead, throughput, latency, and tolerance to malicious nodes, thereby laying the foundation for large-scale applications.

D Shobana

With the billions of devices that are connected in 5G-enabled Internet of Things (IoT) networks, industries have been revolutionized, due to high-speed data transmission, ultra-low latency as well as large scale connectivity that 5g offers. Yet, the growing number of IoT devices also creates serious security and privacy issues like unauthorized access, data breaches, and cyber-attacks. Security frameworks are dependent, centralized, and they cannot establish trust, scalability, and resilience against attack. With its potential to offer decentralized validation, secure authentication, and tamper-proof data storage, blockchain technology has therefore emerged as a promising solution to these concerns. Through this work, we investigate the combination of blockchain-based validation mechanisms with $\mathbf{5 G}$ Internet of Things networks to allow more secure, private, and integritypreserving networks. This usually involves lightweight consensus mechanisms like Proof-of-Stake (PoS) and Byzantine Fault Tolerance (BFT) to enhance transaction efficiency while lowering energy consumption. Edge computing along with blockchain also helps in processing of data at the spot while waiting to be encoded which saves time and decrease latency of IoT applications. Beyond that, AI-driven security models provide higher accuracy in threat detection and anomaly identification in $\mathbf{5 G}$ IoT networks available in blockchain. However, notwithstanding the benefits, issues such as privacy, scalability, regulatory compliance, and computational overhead are still emergent areas of research. In contrast, on the other hand, enhancing the security frameworks of $\mathbf{5 G ~} \mathbf{~ I o T}$ ecosystems built on blockchain through post-quantum cryptography, federated learning, and self-sovereign identity management will lay a crucial role in the developments of computer-based solutions coming in the future. Upon learning the state-of-the-art blockchain validation methods and their contributions to the Internet of Things security, we analyze and evaluate the future works and threats on the secure 5G Internet of Things in this study.

Kevin Wooldridge, Stephen Ashurst

It’s now time to look at the “keeping” aspects of ledger-keeping on the distributed ledger: the processes that amend the data in the ledger.