Blockchain Papers

Luca Bassil

No abstract is available for this record.

Riham Badra, Lazhar Hamel, Layth Sliman

The rapid evolution of 5G and the growing complexity of digital services have increased the need for robust, transparent, and automated Service Level Agreement (SLA) management. Traditional management methods across different sectors like telecommunications and cloud computing frequently suffer from a lack of transparency and a heavy reliance on centralized third parties, which can lead to disputes and delayed enforcement. To address these challenges, smart contracts using blockchain technology offer a transformative solution, automating SLA execution and ensuring decentralized, tamper-proof enforcement. This paper provides a comprehensive survey and critical analysis of existing traditional SLA management systems and smart contract-based management. By studying and examining various frameworks across 5G, cloud computing, IoT, and telecommunications, we highlight common strategies, technical trade-offs, and existing gaps in current research. Through a structured classification and comparative analysis, this study offers an overview of blockchain-based SLA management current state while providing a strategic roadmap for the future of SLA representation and automated lifecycle management.

Zhibo Wang, Chuankai Li, Guoming Liu, Guoyun Zhong · 7 authors

No abstract is available for this record.

Leanne Ngo, Tran Tien Nhat, anon anon, Triet Huynh Minh Le · 7 authors

No abstract is available for this record.

Janice Author

No abstract is available for this record.

Mohit Tiwari

This registration documents the creation, structure, and validation workflow of SARMF-Bench, a minimal reproducible benchmark dataset for smart contract vulnerability analysis. SARMF-Bench consists of five intentionally engineered Solidity contracts representing canonical vulnerability classes: Reentrancy, Arithmetic Overflow Behavior, Access Control Weakness, Unchecked External Call, and Denial-of-Service Pattern. Each contract is paired with machine-readable static analysis outputs generated using Slither v0.11.5. The objective of this dataset is to provide a controlled experimental baseline for evaluating static analyzers, symbolic execution engines, fuzzers, and AI-assisted smart contract security tools. All artifacts were created in a controlled Linux environment and validated for reproducibility through consistent detector metadata (impact and confidence levels). No synthetic mutation frameworks or automated vulnerability generators were used. This registration serves as a timestamped, immutable research record documenting dataset structure, methodology, and reproducibility protocol.

Arnita Sur

The cryptocurrency has represented a revolutionary force in the financial market, with a wide variety of available digital assets that can serve different technological and financial needs. Cryptocurrencies vary considerably. It, therefore, goes without saying that this paper should focus on the wide array of cryptocurrencies, grouping them according to their underlying technology, use cases, and functionalities. It refers to the major classification, including Bitcoin, the first digital currency designed primarily as a unit of store and medium of exchange; altcoins, including alternative cryptocurrencies like Ethereum and Ripple, that should introduce new features and functions such as smart contracts and fast processing of transactions; and tokens, which can be issued and managed on existing blockchain platforms and may range from utility in decentralized applications to representing assets. Such categories of analysis are intended to make it possible to distinguish between the roles and technological innovations connected with each type of cryptocurrency. This research adventure offers insight into how the digital currency landscape is emerging and will impact financial systems, investment strategies, and the regulatory approach. This research goes into a comprehensive review of current literature and case studies, engaged with all types of diverse functionalities and applications of cryptocurrencies, providing foundational understanding to stakeholders and policymakers entering this dynamic field. DOI - https://doi.org/10.65525/SVUP.9788199651548.2026.130-141

Sean Hash

No abstract is available for this record.

Xiaopeng Dai, Qianhong Wu, Mingming Wang, Bo Qin · 7 authors

Transaction propagation delay limits the block interval and is one of the main bottlenecks in improving Bitcoin throughput. However, transaction relay in Bitcoin is entirely voluntary, which results in low bandwidth and high transaction propagation delay. Improving relay motivation by introducing incentives can effectively reduce delay, but it still faces challenges such as Sybil attacks during reward allocation, leakage of network layer privacy, and high on-chain/off-chain overhead. Therefore, this paper proposes Txtail, a practical transaction relay incentive scheme for Bitcoin, based on continuously attaching relay evidence representing the relays’ identity and contribution during transaction propagation. We employ a free pricing mechanism based on the game between relays to allocate rewards fairly. We design an order-insensitive relay evidence structure based on aggregate signatures and public key mapping, which reduces off-chain data overhead while alleviating the leakage of relay paths by obfuscating the relay order. We construct a verifiable lottery mechanism based on Merkle tree commitments to reduce the data that needs to be uploaded to the chain. Both theoretical and experimental results show that Txtail reduces the per-hop off-chain overhead and the overall on-chain overhead by 96.6% and 79.8%, respectively, compared with state-of-the-art baselines, while remaining practical for deployment.

Layal Youssef, Juan Páez‐Farrell

No abstract is available for this record.

Mohd. Rahimie Abd. Karim, Saizal Pinjaman, Izaan Jamil, Azmi Abd. Majid · 5 authors

This study examines the weak-form efficiency and international price integration of Malaysia’s regulated Bitcoin market. Daily closing prices for Bitcoin traded in Malaysian ringgit (BTC/MYR), the international Bitcoin price in US dollars (BTC/USD), and the USD/MYR exchange rate are analysed over the 2021–2026 period using secondary market data. The international Bitcoin price is converted into ringgit to provide a currency-consistent benchmark for the local market. Random-walk behaviour is evaluated using the runs test, Ljung–Box test and variance-ratio test. Market integration is examined through unit-root tests, Engle–Granger cointegration analysis and an error-correction model. The daily results provide mixed evidence regarding weak-form efficiency. Although the runs test does not reject randomness in return signs, the Ljung–Box and variance-ratio results indicate dependence at selected horizons. This dependence becomes weaker in the weekly analysis, suggesting that the efficiency assessment is sensitive to data frequency. The local and international Bitcoin prices are cointegrated, with a long-run coefficient close to unity. The error-correction results further show that deviations from the long-run relationship are corrected over time and that international Bitcoin returns significantly influence short-run local price movements. Nevertheless, a small local price premium and residual volatility clustering remain. Overall, Malaysia’s Bitcoin market is closely integrated with the international market but is not perfectly efficient at all horizons. The findings support policies promoting transparent benchmark pricing, market surveillance, adequate liquidity and volatility-risk controls among Malaysian digital asset exchanges.

Murray Rudd

No abstract is available for this record.

Tolegen Korabayev

No abstract is available for this record.

Margi Desai, Yash Vasava

The rapid growth of IoT devices has increased security risks, particularly in firmware updates and device authentication. Traditional approaches are vulnerable to attacks such as unauthorised access and data breaches. This study proposes a blockchain-based framework using smart contracts and a proof-of-authority (PoA) consensus mechanism to ensure secure firmware verification and decentralised authentication. The system leverages distributed ledger technology to enhance integrity, trust, and scalability in IoT environments. Experimental results demonstrate reduced latency, improved throughput, and strong resistance to common cyber threats, making the framework suitable for large-scale IoT deployments.

Oluwaseye A. Fawale

No abstract is available for this record.

Ryan Lavelle

No abstract is available for this record.

Seita Namba

No abstract is available for this record.

Mohammad Muavia

No abstract is available for this record.

Laurane Chloé Angélina Marco

We explore the design and analysis of post-quantum cryptographic primitives with an emphasis on two angles. First, diversity of assumptions, by building and analysing cryptography that does not rely on structured lattices. Second, diversity of functionalities, focusing on various primitives that extend beyond standard encryption. Motivated by the rapid development of quantum computing and the consequent threat to classical public-key cryptography, we therefore consider two families of post-quantum assumptions: isogeny-based and code-equivalence problems from which we build and analyse various primitives. In the first part, we focus on isogeny-based cryptography. We start our study with digital signatures derived from SIDH squares and investigate their security by analysing a range of attack vectors, including higher-dimensional attack strategies (known as SIDH attacks), and consequently propose suitable parameters. Building on the powerful constructive tools that the SIDH attacks became, we design an updatable public-key encryption scheme from a variant of FESTA, a public-key encryption scheme by Basso, Maino and Pope, enabling an efficient instantiation of this primitive that allows an unbounded number of updates. Finally, we investigate isogeny-based group actions and propose a framework for general-purpose zero-knowledge proofs. The second part focuses on code-based cryptography, particularly tensor group actions and code-equivalence problems. We first analyze and break a commitment scheme based on a structured tensor isomorphism problem, and we propose a secure fix. Then, we study variants of code-equivalence problems that underlie the security of two blind signature schemes. For one variant, we provide a reduction to a standard problem, whilst for another one we show that its security has been largely over-estimated. Overall, this thesis contributes to the development of a diverse suite of post-quantum primitives by providing new constructions, security analyses, and insights into the use of alternative assumptions beyond lattice-based systems.

Lian Yang, Shujiang Xu, Pingping Song, Jian Zhu · 6 authors

No abstract is available for this record.

Dinis Araujo, Ian Scott, Miguel de Castro Neto

No abstract is available for this record.

Gregory Komansky

No abstract is available for this record.

Weimin CHEN, Xiapu Luo

Decentralized finance (DeFi) is an emerging financial service on blockchain, enabling automatic and anonymous transactions.Within DeFi, decentralized exchanges (DEXs) maintain reserves of a pair of tokens and determine the exchange rate to swap tokens.However, DEXs also create opportunities for Maximal Extractable Value (MEV), where attackers include, exclude, or reorder DEX transactions to exploit price discrepancies of tokens and extract profit.Uncovering MEV opportunities requires high throughput, as the 12-second block interval and the vast search space impose strict time constraints.However, existing tools suffer from low throughput, as they rely on CPU-bound execution, which is hindered by frequent state forking and slow DEX execution.In this paper, we take the first step in leveraging GPU parallel computing power to boost MEV-search throughput in arbitrage and sandwich strategies.More precisely, we compile an MEV bot into a GPU application and then launch thousands of GPU threads to search for profit in parallel.To this end, we design new solutions to address three major challenges: designing cheatcodes to simulate transactions on GPU, proposing a memory manager to reduce GPU memory usage, and designing strategyaware mutations to improve input diversity.We implement a prototype named MeVisor that runs DEXs on GPUs and searches for MEV using a parallel genetic algorithm.Evaluated on 3,941 real MEV cases from Ethereum, MeVisor achieves 3.3M-5.1Mtransactions per second, outperforming the CPU baseline by 100,000x.In a large-scale study of Q1 2025 data, MeVisor estimates MEV opportunities ranging from 2 to 14 transactions, yielding at most $1.1 million in MEV profit.

Julius Juette

No abstract is available for this record.