Blockchain Papers

Divesh Sarkar, Flynn Werner

No abstract is available for this record.

A. Verma

X3Sync is a research proof-of-concept for federated cloud storage aggregation across multiple free-tier providers (Google Drive, Dropbox, Koofr). Files are chunked, compressed (zstd), and encrypted client-side using AES-256-GCM before distribution. The system introduces a dual-mode decryption architecture: Sovereign Mode, where ciphertext is relayed to the client for local decryption, and Edge Mode, where an ephemeral X25519 key exchange enables worker-side decryption. The backend runs on Cloudflare Workers with Neon PostgreSQL for metadata storage. This paper details the system architecture, security model, provider abstraction layer, and a commutative storage model for heterogeneous provider aggregation.

Naoto Yanai, Naohisa Nishida, Yuji Unagami

Backdoor attacks on Ethereum smart contracts are a kind of attack in which an adversary exploits the privileges of his/her developed smart contract to manipulate the cryptoassets generated by that contract. Although there are several countermeasures against backdoor attacks, to the best of our knowledge, no empirical study based on the source code of the backdoor attacks has been conducted so far. In this paper, we conduct an empirical study to understand how backdoor attacks on Ethereum smart contracts are performed in the real world by analyzing all smart contracts with source code. To this end, we also propose a new investigation tool for the empirical study, named BACCA. We then identify several key insights. First, we totally found 288,440 contracts for backdoors attacked, called contract backdoors, including potential ones. The most significant backdoor attack is DisableTransfer, which disables transfers of assets to other addresses, and we identify 211,687 smart contracts affected by this attack. Second, several backdoor attacks are combined with other types of backdoor attacks, called combination contract backdoors, and 90.9% of DisableTransfer are combination contract backdoors. Third, GenerateToken, which enables an adversary to generate new cryptoassets, is the largest as a backdoor without any combinations, i.e., unique contract backdoors, and 23.8% of GenerateToken are the unique contract backdoors. Fourth, when we analyze the number of transactions sent to the above contract backdoors to identify their gas consumption in the real world, we identify that about 9 trillion dollars have been consumed by them. We also found a remarkable contract backdoor that receives more than a million transactions, resulting in gas consumption of about two billion dollars. We further discuss implications for the design of analysis tools for subsequent work and the impact of compiler updates on the above backdoor attacks.

Zhang Lila, Zhen Yan

Abstract: In the era of the digital economy, establishing an efficient and compliant data asset rights confirmation system within scalable distributed infrastructures is of critical importance. However, under heterogeneous distributed ledger environments, data circulation is often trapped in a binary tension between privacy preservation and regulatory accessibility, while facing severe scalability bottlenecks. Existing studies lack a unified solution that simultaneously addresses cross-chain interoperability, post-quantum security, and low-cost verification. To this end, this paper proposes a data asset rights confirmation framework based on hybrid post-quantum zero-knowledge proofs. The framework designs a scalable recursive composition architecture combining Scalable Transparent Argument of Knowledge (STARKs) and Succinct Non-interactive Argument of Knowledge (SNARKs), leveraging off-chain compressed permutation to significantly reduce on-chain storage overhead. In parallel, a light-client-based distributed cross-chain state synchronization protocol and a regulation-friendly privacy auditing module (based on threshold encryption) are constructed to ensure transactional atomicity and conditional auditability during data circulation. Experimental evaluations conducted on two datasets, Ethereum NFT transactions and credit card fraud detection, demonstrate that, compared with cross-chain privacy-preserving solutions such as zkCross, the proposed framework reduces on-chain verification Gas costs by approximately 18.2%, compresses proof size to 0.28 kB, and achieves a peak throughput of 1,618 Transactions Per Second (TPS). Moreover, under controlled experimental conditions, the framework attains an audit success rate of 99.6% with only 14.0% performance overhead. Overall, this study alleviates the long-standing trade-offs among privacy protection, regulatory compliance, and computational scalability, and provides a verifiable technical solution for the interoperability and infrastructure development of next-generation distributed systems.

Minhui Le

The increasing demand for verifiable computation in privacy-sensitive distributed systems has driven the widespread adoption of Zero-Knowledge Proofs (ZKPs). However, the various kinds of current ZKP frameworks—which include zk-SNARKs, zk-STARKs, Bulletproofs, and folding-based systems—introduce complex trade-offs across proof size, prover cost, and trust assumptions, making system selection challenging in actual practice. This paper presents a systematic, application-oriented survey that connects ZKP design choices with real-world deployment constraints. It provides a comparative analysis of major constructions to evaluate their performance and security properties. Furthermore, these trade-offs are mapped to representative application scenarios, including Layer 1/Layer 2 blockchain scaling, Decentralized Identity (DID), and Verifiable Machine Learning (zkML), explaining how different systems are selected based on application-specific requirements. In addition, the paper discusses emerging paradigms such as hardware acceleration, binary field optimizations, and lookup-based zkVMs, which aim to address the prover bottleneck. Overall, this survey provides a structured understanding of the strengths and limitations of existing ZKP systems and offers insights for the design of scalable and privacy-preserving infrastructures.

Mircea Magureanu

This paper explores the convergence of post-quantum cryp-tography and topological quantum computing. Grounded in the founda-tional de Broglie wave-particle duality and Borneas space-time tensorformulations, we analyze the structural vulnerability of early asymmet-ric encryptions, specifically targeting legacy distributed ledger walletarchitectures. We model how the 22,000 independent address clustersof the Satoshi Nakamoto entity function as a spatial deterrent againstShor’s algorithm. Furthermore, we examine the deployment of Microsoft’sMajorana 2 architecture within nested dilution refrigerators, illustratinghow error-free topological braiding accelerates Quantum AdiabaticComputation. We conclude by formalizing the transition from sequentialgradient descent to instantaneous Quantum Synthesis, marking theparadigm shift beyond traditional machine learning.

Basheir Khan, Amizah Malip, Abid Khan

No abstract is available for this record.

Emeka Iwuagwu

<b>Abstract</b>The rapid growth of decentralized technologies has intensified the need for secure, privacy-preserving, and Sybil-resistant identity systems capable of operating without centralized authorities. Existing blockchain identity mechanisms frequently depend on trusted intermediaries, invasive biometric verification, or token-based incentives that introduce privacy risks, centralization, or economic manipulation. This paper presents the Decentralized Proof of Humanity (dPoH) Protocol, a blockchain-native identity framework designed to establish unique human identities through decentralized verification while preserving user privacy and network scalability.The dPoH protocol combines decentralized attestations, cryptographic verification, reputation mechanisms, and consensus-driven validation to ensure that each participant corresponds to a unique human identity without exposing unnecessary personal information. By eliminating reliance on centralized identity providers, the protocol significantly reduces Sybil attacks while maintaining transparency, auditability, and interoperability across blockchain ecosystems.The proposed architecture is suitable for decentralized finance (DeFi), decentralized governance (DAO), voting systems, digital identity infrastructure, token distribution, and next-generation Web3 applications. The protocol contributes to the growing field of decentralized identity by providing a scalable framework for secure human verification in trustless environments.

Kaja Masthan, Zeeshan Ahmed Mohammed, Rahmat Ali, Abdul Junaid Mohammed

The advancement of medical data handling from conventional paper documents to electronic records enabled secure data movement between authenticated legitimate users. While current identity verification algorithms offer unique solutions, they face significant limitations related to data storage scalability, potential privacy breaches, high computational costs, and the lack of standardized protocols. In order to alleviate these constraints, the research proposes a biometric–Blockchain-based authentication Scheme, a Whirlpool Secure Hash-based Biometric Integrated Key Distribution Function (WShBK) for secure data storage and access in a cloud network. The proposed strong cryptographic scheme generates two unique keys derived from the biometric trait of the patient for both encryption and authentication purposes, ensuring strong protection while accessing and storing the data. Furthermore, the advanced encryption standard WShBK (AWShBK) encryption algorithm leverages the strength of a symmetric block cipher and the unique key, offering robust protection against breaches by rendering intercepted data without the correct decryption key. Furthermore, Hybrid biometric-based zero-knowledge proof (HyBZKP) verification offers secure and private transaction validations while sustaining the blockchain integrity. These advancements of the proposed WShBK scheme improve 0.52 encryption rate and 0.53 decryption rate for 250 users analyzed with an attack compared to other cutting-edge models.

Viktoriia Shlapak, S. A. Semenyuk

The method of secure authorization of banking transaction based on the Schnorr scheme represents a cryptographic approach to verifying user authenticity using Zero-Knowledge Proof (ZKP) protocols. The proposed approach is focused at minimizing the risks of compromising confidential data during the execution of transaction in open or partially trusted environments. The method is based on the Schnorr identification protocol, which relies on the computational hardness of the discrete logarithm problem and enables authentication without transmitting the user’s secret key. The authorization model includes the interaction process between three components of the transaction, namely the client, the transaction execution environment, and the banking side. The transaction execution environment is considered to be critical and untrusted component. The protocol consists of a sequence of stages: first, the initial parameters (p, g) are generated; then the public key value (y) is formed; based on it, a proof value (t) is created; on the bank`s side, a challenge (e) is generated followed by the computation of the parameter s, and subsequently the correctness of the verification relation is checked by the bank. A distinctive feature of the approach is the absence of private key transmission and the use of random values, which prevents the recovery of secret parameters even if part of the data is intercepted. Within the scope of the study, simulations of Man-in-the-Middle (MITM) and replay attacks were performed in older to evaluate the robustness of the proposed approach. In the case of a Man-in-the-Middle attack, it is shown that modification of the parameter t leads to a violation of the verification relation, making successful transaction authorization impossible. To counter replay attacks, a timestamp (TS) mechanism and transaction parameter uniqueness were integrated into the model, eliminating the possibility of reusing intercepted data. The constructed model is based on cryptographic strength, reduction of the impact of vulnerabilities in the transaction execution environment, and ensuring the fundamental principles of digital security, namely data integrity, confidentiality, and authenticity. The proposed method demonstrates its effectiveness in scenario with a high level of threats, such as in the financial sector, where transaction protection is a critical component

Arunima Shastri

The transparency of the blockchain technology makes privacy issues acutely challenging in certain highly sensitive applications such as IP protection and contractual arguments. This chapter is an overview of privacy preserving methods and in particular Zero-Knowledge Proofs (ZKPs) and confidential evidence handling mechanisms. ZKPs are set to transform notarization by allowing parties to prove that information or statements are true without disclosing the information that they have associated with them. The study covers the concept of use of blockchain and how they can be used to combine with smart contracts for privacy-preserving IP access rights governance and dispute resolution. It also covers confidential computing, homomorphic encryption, and secure multi-party computation for processing privacy sensitive evidence on the blockchain. In regulated industries, these technologies hold the promise of increasing prevalence, but encounter challenges relating to regulations and trusted setup, as well as computational overhead issues.

Mohammad Ayoub Khan, Mohamed Chawki

Cross-border transactions with regulatory compliance have become conventional in the era of globalization. Transactions related to individuals, banking, technology, etc., are eased using Internet of Things (IoT) paradigms. Pervasive access and low interoperability due to improper administration of transaction terminals are significant problems in initiating and completing cross-border transactions. To address the problems, a novel Zero-knowledge proof Inter-Scalable Framework (ZISF) is proposed. This framework includes transaction authentication, Blockchain (BC), and a security generator to ensure security, scalability, and interoperability. The proposed framework consolidates these tasks to support diversified cross-border transactions with flexible regulatory compliance. The proposed ZISF framework achieved a 13.64% improvement in transaction throughput compared with CCMB under varying block-size and transaction-load conditions, while reducing processing latency by 13.79% relative to BETAC-IoT during miniature block scaling operations.

Tanishq Sahu, Puneet Bakshi, Pranali Nikam

India’s Unified Payments Interface (UPI) gates transaction limits behind Know Your Customer (KYC) compliance tiers mandated by the Reserve Bank of India (RBI) and National Payments Corporation of India (NPCI). Unlocking the Full KYC tier currently requires users to surrender sensitive identity documents (Aadhaar, PAN, income proofs) to Payment Service Providers (PSPs). This centralized storage creates severe breach vulnerabilities and systemically violates the data minimization principle of India’s Digital Personal Data Protection (DPDP) Act 2023, Section 8(3). We present ZKProof-eKYC, the first Zero-Knowledge Proof (ZKP) framework designed specifically for payment system tier access control. By reframing KYC eligibility as a cryptographic access token, a user’s device generates a 1.5 KB non-interactive Groth16 zk-SNARK proof asserting tier eligibility. The PSP receives only a boolean result, eliminating personal data transmission and achieving DPDP Act compliance mathematically. The primary contribution is a multi-predicate Circom 2.0 circuit (≈25,000 R1CS constraints) simultaneously enforcing eleven regulatory predicates (ϕage to ϕtier) mapped across six Indian statutes. The architecture introduces five key elements: (i) an 8-leaf depth-3 Poseidon Merkle credential tree; (ii) a dualdocument commitment scheme protecting the raw PAN (singlehash) and Aadhaar (double-hash) identifiers; (iii) an EdDSAPoseidon issuer signature; (iv) a depth-20 Sparse Merkle Tree (SMT) for real-time revocation; and (v) Poseidon nonce-binding against replay attacks. A novel branch-free finite-field formula calculates NPCI’s tier limits natively: tier = 2 · ⊮[FullKYC] + (1−⊮[FullKYC])·⊮[MinKYC]. We deploy a dual-circuit framework: UPIKYCTierProof for Full KYC and MinKYCTierProof for Min KYC. Functional correctness is validated against 12 adversarial test vectors. Performance profiling projects mobile WASM generation at <400 ms, with off-chain execution measured at ≈96 ms and on-chain verification at ≈242,000 gas. ZKProofeKYC establishes the first “one credential, multiple products” ZKP architecture for national payment infrastructure.

Md Sakibul Islam Sheikh, Md Dipu, Maksudur Rahmand, Kazi Riadul Islam · 7 authors

In today's digital environment, secure and trustworthy identity management is critical as centralized systems remain vulnerable to data breaches, identity theft, and unauthorized access.This paper presents a blockchain-based decentralized identity verification framework that enhances data security, privacy, and user control by eliminating reliance on centralized authorities.The proposed system integrates smart contracts, decentralized identifiers (DIDs), and cryptographic security to enable tamper-resistant and transparent identity verification.Sensitive user documents are encrypted using AES-256-GCM and stored off-chain on IPFS, while only cryptographic hashes and verification records are recorded on the blockchain to preserve privacy and data integrity.Key management is strengthened through HKDF-based derivation, and users can selectively disclose identity attributes using privacy-preserving techniques.Experimental analysis indicates that the system significantly reduces identity fraud, improves verification accuracy, and enhances auditability and scalability.The solution is well-suited for applications in finance, healthcare, e-governance, and secure third-party authentication platforms.

Sepideh Avizheh, Reihaneh Safavi-Naini, Shiwei Sun

Group signatures are privacy preserving signature schemes in which a group member can anonymously sign messages on behalf of the group, while providing accountability, by allowing the signature of a misbehaving group member be ``opened'' and the identity of the signer be revealed. In group signature members are admitted to the group by a (trusted) group manager. We motivate the need for a flexible mechanism in applications, such as privacy preserving access in smart environments, and propose a two-level member-join group signature that we call SPonsored Group Signature (SPGS) where group members of level 1 can ``sponsor'' new members, in level 2, to join the group. This relaxation of user join comes with additional accountability mechanisms: we require that the signature of a sponsored member can be opened to the identity of the sponsor (that is sponsor is responsible for the sponsored member), and while all signatures are anonymous, for the sponsored members, the signatures are linkable. This allows a sponsor to efficiently identify an undesirable sponsored member. We formalize SPGS scheme, define its security using a game-based approach, and give a generic construction of SPGS that uses a (dynamic) group signature scheme, a commitment scheme, and a knowledge-sound non-interactive zero knowledge proof of knowledge, and prove its security. We also give an instantiation of our construction. To show applicability of SPGS in practice, we consider the problem of providing guest access in a smart building, and introduce Anonymous Guest Access Token (AGAT) that allows a temporary guest to anonymously access (a subset of) the building resources. We show how SPGS can be used (together with an IND-CPA secure public key encryption scheme) to give a direct construction for AGAT, and show the efficiency of our guest access protocol when it is instantiated with existing schemes.

Shaimaa Akram Hassan, Adwea Naji Atewi

Over time, the security of traditional public-key infrastructures in blockchain systems and in decentralized applications is threatened by the rise of quantum-enabled adversaries.Due to incomplete protocol specifications, unclear validation semantics, and contradictory experimental reporting, it is challenging to apply lattice-based cryptography, which serves as a foundation for quantum-secure primitives, to blockchain-based AKE frameworks.For decentralized applications that use CRYSTALS-Kyber-768 as a lattice-based Key Encapsulation Mechanism (KEM), this study suggests a formally defined blockchain-enabled post-quantum authenticated key exchange and registration framework.The protocol links a public key registration based on a smart contract with an on-chain Groth16 zk-SNARK proof-of-possession verification, which makes for an efficient and authenticated public key registration that is replay-resistant, protects against key-substitution attacks, and establishes a safe session under a well-established adversarial model.To improve traceability, resolvability, and auditability, the suggested protocol separately identifies cryptographic assumptions, block chain consensus assumptions, smart contract validity semantics, and more.To allow for independent verification of the framework's operation, the complete message flows, contract-level validation rules, and on-chain/off-chain boundaries for interactive protocols are all clearly specified.The experiment was conducted on a private Ethereum Proof-of-Stake test network with 50 validators, a gas block limit of 60,000,000, and a block interval of 12 seconds.A set of tests, each consisting of 30 independent runs, was conducted to produce a total of 30,000 registration transactions for the same workload circumstances.The average end-to-end delay is 24.73 seconds, and the registration process includes an average of 275,555 gas.The actual interval of batch-finalization, which is the period between the first batch submitting a transaction and the last batch's finality confirmation in each round of experiment, was used to determine throughput.The throughput that results from running the experiment within the constraints of the blockchain restrictions is comparable to the theoretical, gas-limited processing speed of around 18. 1 tps.Additionally, the lightweight authenticated key exchange phase, which on the tested network settings, carried out about 41 complete bilateral exchange cycles every second, was also accomplished.The outcomes demonstrate that the post-quantum authenticated key establishment can be realistically incorporated into the blockchain-assisted infrastructure with the reproducible system-level behaviors, while maintaining provable proof-of-possession and preserving structured validation semantics.

Kanan Huseynov, Ali Shahzaib, István András Seres, János Tapolcai

From a user's perspective, perhaps the most significant difference between traditional banking services and widely used blockchain-based financial systems is that, in the latter, transactions and, either directly or indirectly, account balances and transaction histories are publicly observable. Therefore, a growing number of cryptographic solutions have been proposed to add a privacy layer to such systems. However, the privacy that users actually obtain does not depend solely on the security of the underlying cryptographic protocol: user behavior, transaction amount patterns, and timing decisions can substantially reduce anonymity. In this work, we study behavioral leakage in cryptocurrency mixers, focusing on Railgun on Ethereum. We aim to heuristically estimate the probability that a given deposit and withdrawal transaction belong to the same user. We consider five sources of leakage: characteristic timing patterns, address reuse, proximity in the transaction graph induced by prior public transactions, amount fingerprints that preserve distinctive digit patterns across transaction values, and knapsack type matches in which groups of transaction amounts add up in revealing ways. Our results show that even cryptographically strong privacy systems may suffer substantial anonymity loss due to user behavior and transaction patterns. Our five heuristics are able to uniquely link 17.65% of Railgun withdraw transactions to deposit transactions. We also applied a knapsack solver algorithm that was able to produce a 3.42 bit median anonymity loss for withdraw transactions. This work contributes to a better understanding of the practical privacy limits of mixers and anonymity pools, and points toward safer usage practices and design principles.

Christoph Lenzen, Julian Loss, Kecheng Shi, Benedikt Wagner

Byzantine Agreement and Broadcast are traditionally studied in one of two extremes: the authenticated setting, where a public key infrastructure (PKI) enables universally verifiable signatures and yields higher fault tolerance, and the unauthenticated setting, where no PKI is available and resilience necessarily drops. Motivated by Proof-of-Stake blockchains, where only a stable subset of participants (e.g., validators) have registered long-term keys while others do not, we initiate a systematic study of consensus in the \emph{partially authenticated} setting, where a subset of parties are \emph{registered} in a PKI and the remaining parties are \emph{unregistered}. We provide a nearly complete feasibility characterization of the resilience as a function of the number $s$ of registered parties among $n$ total parties. First, we show that Byzantine Agreement or Byzantine Broadcast with an \emph{unregistered} sender is possible if and only if $t \le \max\{\lceil s/2\rceil,\lceil n/3\rceil\}-1$, matching a simple protocol and an impossibility bound. Second, for Byzantine Broadcast with a \emph{registered} sender, we give a deterministic synchronous broadcast protocol tolerating up to $t \le s + \lceil (n-s)/3\rceil - 1$ Byzantine faults (equivalently, $3t

Authors unavailable

Non Fungible Token (NFT) Industry has been witnessing 16 million dollar trade in recent times.The following is the development of the decentralized NFT marketplace divided into three principal phases: smart contract development on the Ethereum blockchain using Solidity, creation of the frontend using React.js,Next.js,Node.js,HTML, CSS, and JavaScript, and backend development using Express.jsand MongoDB.The aim of this project is to offer a transparent and safe digital marketplace to mint, buy, and trade NFTs.The project employs ERC-721 standards for the uniqueness of tokens, Web3.js for interaction with smart contracts, and off-chain metadata storage with the help of REST APIs and MongoDB.Results indicate that the marketplace functions securely and efficiently, with seamless user interaction and successful on-chain transaction execution.Challenges related to deployment cost, metadata storage, and smart contract gas optimization were addressed during development.The final product demonstrates a fully functional, scalable, and decentralized NFT marketplace platform.

Pham Van Huong, Nguyen Ngoc Tuyen, D. H. Long, Trần Quốc Toanh · 5 authors

The paper proposes a comprehensive data security model for blockchain-based web applications. This model can be used as a general template for Web3 applications. The model consists of two parts: a blockchain core with integrated database encryption modules, replacing Fabric CA; and an application part that also integrates file encryption, database encryption, and digital signatures. The proposed model was tested on a VBCC management website using Hyperledger Fabric. File and database encryption uses AES, and digital signatures use ECDSA. To improve performance, we also replaced the GolevelDB database management system with LevelDB. Experimental results confirm the accuracy and good performance.

Zhe Zhang

This paper investigates Ethereum-based smart contracts as a decentralized cybersecurity governance layer for Electronic Medical Records (EMRs). It addresses challenge of fragmented healthcare data silos and strict compliance requirements for electronic protected health information (ePHI), such as HIPAA and GDPR by analyzing how blockchain technology enables explicit, patient-centric access control. Current legacy systems often centralize authorization, creating vulnerablilities. Through topic analysis and a Solidity-based Proof of Concept (PoC), the study demonstrates a hybrid architecture that uses on-chain execution for permission management while storing sensitive clinical data off-chain. The PoC shows how immutable ledger entries enforce least-privilege principles, block unauthorized queries, and provide tamper-evident auditability. The architecture’s trade-offs between enhanced accountability, patient sovereignty, and practical limitations in scalability, governance, and costs are assessed. It concludes that while blockchain offers a robust trust layer, integration with off-chain interoperability standards remains essential for clinical adoption.

Urvashi Rahul Saxena, R. W. Kadel, Yogita Khatri, Aakanksha Sharma · 6 authors

No abstract is available for this record.

Valerio Mandarino, Giuseppe Pappalardo, Emiliano Tramontana

Authentication is essential to hold users accountable across online services. Conventional authentication systems rely on centralized architectures or third-party identity providers, which, however, introduce single points of failure, privacy concerns, and limited user autonomy. Conversely, fully decentralized authentication frameworks often struggle to provide reliable identity attestation mechanisms. This makes them vulnerable to Sybil attacks and self-asserted claims, while limiting their interoperability with trust-based systems. This paper presents dAuth, a hybrid blockchain-based authentication architecture based on Ethereum smart contracts to provide cryptographic tokens that enable authentication to services. These tokens, anchored to the smart contract, are derived by users from institutionally certified base credentials issued by an accredited verifying authority and enable authentication to services without further involvement of the authority. Each token is cryptographically bound to a specific service, constrained in scope and duration, and verifiable off-chain through data and cryptographic commitments provided by the user. No plaintext personal information is published on-chain: identity attributes are committed as cryptographic digests, which anchor certified identity data on-chain while keeping the underlying personal information private and auditable. This design removes the verifying authority from the authentication process, as all authentication steps are assisted by the user-controlled smart contract. The verifying authority’s role is limited to initial identity certification and exceptional update procedures. The result is a privacy-preserving and verifiable hybrid authentication framework that leverages the cryptographic security properties of the underlying blockchain infrastructure and inherits its scalability characteristics. The proposed design has been implemented and experimentally evaluated on the Ethereum platform, addressing public blockchain-specific challenges such as scalability constraints and transaction costs to ensure practical deployment.

K. Ananthalakhsmi, S. Benila

No abstract is available for this record.