Blockchain Papers

Wulf A. Kaal

No abstract is available for this record.

Christian Nielsen Garcia

No abstract is available for this record.

K. Meenakshi, Kirti Singh, Deepshikha Bhargava

No abstract is available for this record.

P. Mary Jeyanthi

No abstract is available for this record.

Kexin Chen, Chao Huang, Jianwei Huang

Information Elicitation Without Verification (IEWV) refers to eliciting high-accuracy solutions from crowd members when the ground truth is unverifiable. While prior research on IEWV has focused on central entities providing incentives to motivate effort exertion, this work explores the less-studied decentralized setting, which is increasingly relevant in machine learning, crowd decision-making, and autonomous organization applications. We model members’ strategic interactions as a two-stage game, where each member decides her incentive contribution strategy in Stage I and her effort exertion strategy in Stage II. We examine two types of incentive allocation mechanisms: Equal Allocation (EA), where each member receives an equal proportion of the total incentives, and Output Agreement (OA), where a member receives incentives if her solution matches a reference solution generated by other members. This paper first analyzes the two-member case and provides closed-form equilibrium results. For more than two members, we use a binomial approximation to simplify the combinatorial computation of the majority voting problem and characterize the symmetric Nash equilibrium under EA. For OA, we derive equilibrium results for effort exertion and propose an algorithm for the incentive contribution game due to discontinuous payoffs. Our results show that OA outperforms EA in the aggregated team solution accuracy at equilibrium. Furthermore, we reveal that higher member ability beyond a certain threshold may lead to reduced effort exertion under EA, and that smaller teams achieve better accuracy when the effort cost is high due to less free-riding behavior. Numerical and empirical simulations validate our theory.

Balram P, Lakshmi Rai, Mansi Kodag

No abstract is available for this record.

Qingshui Xue, Sida Fan, Mengyao Shi

No abstract is available for this record.

Qianqian Pan, Jun Wu

In the coming 6G era, Internet of Consumer Electronics (ICE) is promising in academia and daily life. To improve the intelligence and reliability of ICE devices with limited resources, a cloud-edge-end collaborative intelligent architecture is designed. However, the current collaborative intelligent ICE system faces multiple security threats, e.g., illegal access to the intelligent data/model resources and poisoning/backdoor attacks during collaborative intelligent model training. The security of the intelligent collaborative ICE is still an open issue. To solve this problem, we propose a zero-knowledge proof (ZKP)-driven zero trust method to protect the security of the intelligent collaborative ICE. First, a zero-trust intelligent collaborative ICE security framework is established for the confidentiality and availability protection of data/model resources. Second, we propose a zero-trust multi-factor access control mechanism for mutual authentication and trust evaluation-based resource access authorization. Third, the ZKP-driven collaborative intelligent ICE mechanism is designed. In this mechanism, the selective differential privacy-based data preservation scheme and the zero-knowledge collaborative intelligent model training scheme are devised. Finally, experimental results demonstrate the effectiveness and efficiency of the proposed secure intelligent collaborative ICE.

Ping Ji, Haijie Wang

In the face of the regulatory failure problem caused by blockchain hidden addresses, existing solutions often fall into a dilemma where 'privacy protection' and 'compliance review' are either one or the other.This paper proposes an innovative integration framework that transforms the behavioural elements in anti-money laundering and other legal provisions (such as 'high-frequency and small-scale transactions') into computable logic.Based on zero-knowledge proof technology, it generates verifiable credentials to determine whether the transaction behaviour is compliant without revealing the true identity of the address.Experiments on a public blockchain transaction dataset (elliptic) show that this framework achieves an average improvement of over 15% in core identification performance compared to traditional non-private rule-based methods, while maintaining an acceptable performance overhead.As a proof-of-concept validation conducted on a transparent dataset with simulated concealment, the actual performance may differ in native privacy-preserving chains.This research provides a new approach that combines legal rigor with technical feasibility for achieving effective on-chain behaviour supervision while protecting user privacy.

Subhasis Thakur

No abstract is available for this record.

Dharmesh Dhabliya, Aditya Lavhale, Sunil Thakur, R. M. Gomathi · 6 authors

In modern cryptography, improving the cryptographic security of Zero-Knowledge Proofs (ZKP) has become a compelling trend. Traditional models like the zk-SNARK and zk-STARK has shown strong security but are accompanied by the inherent issues of computational complexity and proof size. This work presents the Algebraic Zero-Knowledge Proof (AZKP) framework, using algebraic structures and integration of elliptic curves to optimize proof creation and verification. The suggested approach fills in key gaps found in the current methodologies, such as huge computational overhead and enormous proof sizes. Prime factorization in algebraic groups and ring homomorphisms of the AZKP framework is used to achieve small proof size without sacrificing computational efficiency. Comparing AZKP with zk-SNARK and zk-STARK models, experimental evaluation was applied to four critical performance metrics. generation time of proof, verification time, size of proof, and computational overhead. Results show that the AZKP is able to make a 48% decrease in proof generation duration and 20% increase in verification speed in comparison to zk-SNARK. Also, AZKP incurred lower computational cost than zk-STARK, with a proof size that is manageable. These results highlight the prospect of AZKP in cryptographic use where high-speed low-latency verification operations are desired. Further research will integrate AZKP in blockchain environments in order to increase real-time transaction validation.

Koustav Kumar Mondal, Amritesh Kumar, Debasis Das

Decentralized energy trading among electric vehicles (EVs) and charging stations (CSs) still suffers from high energy consumption, low throughput, and heavy consensus overheads. We present Reputation-Aware Proof-of-Energy (RPoE), a lightweight consensus that combines an energy score (ES) and a reputation score (RS); nodes with RPoE above a threshold participate in validation, and the highest-scoring node proposes the block. To sustain participation, we introduce a budget-balanced incentive with a guaranteed participation floor and a proportional share derived from concave weights of normalized RPoE and exchanged energy; tunable parameters trade fairness for efficiency. Our security analysis provides formal guarantees of double-spend resistance, Sybil resistance (trust-authority-backed identities), liveness under bounded delays, and resilience to DDoS/eclipse through eligibility gating. On a multi-node Raspberry Pi (RPi) testbed, RPoE reduces CPU workload by 47%, bandwidth by 5%, and energy consumption by 10% relative to Practical Byzantine Fault Tolerance (PBFT), Proof-of-Stake (PoS), and Proof-of-Authority (PoA), while achieving higher throughput and lower confirmation latency. The incentive remains fair and balanced. In a 10-node study with a participation floor of 20%, Jain's Fairness Index (JFI) is 0.853 (values closer to 1 indicate more fair splits) and the Gini coefficient is 0.221 (values closer to 0 indicate more equal splits), demonstrating equitable and budget-balanced rewards that avoid dominance.

Christos A. Makridis

Abstract Cheap, disposable online identities make abuse easier to externalize. Users can harass, evade bans, amplify content through fake accounts, or abandon a damaged reputation at low cost, while other users, moderators, and platforms bear the consequences. This paper examines verified pseudonymity as an institutional response to that problem. First, I model online communities as club-governed informational commons in which incivility degrades the shared environment and raises enforcement costs. The model shows that conduct can improve when sanctions attach to a persistent pseudonymous identity and when users have future access, reputation, or governance rights at stake. Second, I compare verified pseudonymity with open pseudonymity, real-name mandates, centralized know-your-customer verification, algorithmic moderation, and no intervention. Decentralized identifiers, verifiable credentials, proof of personhood, and non-transferable standing credentials matter because they can separate authentication from public identification. Third, I add a community-currency layer that separates access to scarce attention from governance rights. The result is a governance framework in which accountability depends less on public naming than on durable standing, credible sanctions, and reusable privacy-preserving credentials.

L. V. Kovalchuk, M.S. Kondratenko

The paper investigates the issues of secure functioning of a two-level blockchain with a complex mixed consensus protocol — Proof-of-Work in the main blockchain (mainchain) and Proof-of-Stake in the secondary (sidechain). The principle of building such a blockchain is based on the Proof-of-Proof protocol, where a stable blockchain (mainchain) is used to ensure the stability of the sidechain, by referring the mainchain blocks to the sidechain blocks using special transactions. Such a structure allows for faster block generation in the sidechain and, accordingly, faster processing of transactions without reducing stability and without increasing the block size. In turn, such a two-level blockchain is of the greatest interest for the creation of a cascade system of state registers, which will be guaranteed to be protected against the substitution and forgery of documents. The main results of the work areexplicit analytical expressions for estimates of the probability of double spend attack on such a two-level blockchain, under the condition of an adversary in the sidechain and in the mainchain. The expressions obtained allow finding the number of confirmation blocks in the sidechain, which guarantees security against the attack with a probability no less than a preset value. Keywords: blockchain, mainchain, sidechain, cryptocurrencies, mining, Proof-of-Proof consensus protocol, double spend attack.

Ferit Gezgil

We propose Proof of Witness (PoWit), a novel consensus mechanism for digital currency that replaces energy-intensive mining and capital-based staking with independent third-party witness verification. In PoWit, each transaction requires cryptographic signatures from three parties: sender, receiver, and a randomly selected witness. The witness validates the sender’s balance and transaction history before signing, eliminating the need for global consensus while maintaining security guarantees. Our simulation with 10,000 users demonstrates 100% double-spending prevention (n = 10, 000, 99% CI [99.93%, 100%]), 113.9 transactions per second, and complete chain integrity. The non-selective witness assignment achieves theoretical randomness with only 0.27% deviation, making collusion attacks impractical. PoWit offers a sustainable alternative to Proof of Work and Proof of Stake, with significantly lower energy consumption and fairer participation model.

Saurabh Jain, Adarsh Kumar

No abstract is available for this record.

Amrendra Singh Yadav, Mihir Bhatt, Sameer Yadav, Sanjeev Kumar Dwivedi · 5 authors

The rapid evolution of the Internet of Vehicles (IoV) necessitates secure, scalable, and low-latency route navigation mechanisms that can operate in highly dynamic vehicular environments. Emerging paradigms such as Vehicular Digital Twins (VDTs) further enhance IoV ecosystems by enabling real-time virtual representations of physical vehicles, facilitating predictive analytics, intelligent decision-making, and context-aware routing. However, conventional VANET-based approaches suffer from centralized trust dependencies, high computational overhead, and limited adaptability to real-time traffic conditions. This paper proposes BFRN-IoV, a blockchain- and fog-enabled route navigation framework that integrates lightweight ECC-HMAC-based mutual authentication, RSU-assisted fog routing, and global route validation via a Geo-Location Provider (GLP), while leveraging VDTs for enhanced situational awareness and dynamic route optimization. The framework ensures key security properties-including confidentiality, integrity, pseudonymity, unlinkability, and non-repudiation-using ECDH-derived session keys, HKDF-based key expansion, and HMAC verification, while preserving privacy through pseudonym-based identity management. A permissioned blockchain provides immutable and auditable logging of routing interactions without exposing vehicle identities. Simulation results using SUMO and implementation via Web3 demonstrate significant improvements in routing accuracy, along with reduced communication and computational overhead compared to existing approaches. Formal verification using the Scyther tool confirms robustness against replay, impersonation, and man-in-the-middle attacks. The proposed framework delivers a unified, secure, and efficient solution for real-time IoV route navigation, further strengthened by the integration of VDTs in next-generation intelligent transportation systems.

Benito Samuel López Razo, José Israel Campero Domínguez, Victor Hugo de la O. Martinez, Nicolás Trejo de la Cruz

Objetivo: El objetivo de esta investigación es desarrollar un sistema basado en tecnología Blockchain y la red Ethereum para la emisión y validación de certificados digitales en una institución de educación superior, garantizando seguridad, trazabilidad e inmutabilidad mediante contratos inteligentes. Marco teórico: La investigación se fundamenta en el uso de Blockchain como una tecnología distribuida que permite el registro transparente y seguro de transacciones, aplicando los estándares X.509 y ERC-721 para la autenticación y unicidad de los certificados digitales. Método: Se diseñó un prototipo funcional utilizando el lenguaje de programación Python, la biblioteca web3.py y la infraestructura de Ethereum. El sistema integra firmas digitales y códigos QR para facilitar la verificación en tiempo real. Resultados y discusión: Los resultados preliminares muestran un uso promedio de gas de 221,189 y un consumo de 0.00442378 ETH por transacción, con una reducción del 43% en los costos de verificación respecto a sistemas tradicionales. Esto demuestra la viabilidad técnica y económica del modelo propuesto. Implicaciones de la investigación: El sistema puede aplicarse en contextos educativos e industriales, fortaleciendo la confianza en la emisión y validación de documentos digitales. Originalidad/Valor: La propuesta contribuye al campo de la certificación digital al integrar estándares abiertos y contratos inteligentes, ofreciendo una solución escalable, segura y de bajo costo.

QJ Wang, Simon Kim

No abstract is available for this record.

Timothy T. Hsieh

No abstract is available for this record.

Marc Herdina

No abstract is available for this record.

Lauren E. Diaz

No abstract is available for this record.

Aaditya Chomal, Snehil Gamit, Sidharth Panda, Aqsa Rangrez · 6 authors

In the modern digital landscape, traditional cen- tralized storage models are increasingly vulnerable to security breaches, suffer from single points of failure, incur high main- tenance costs, and present scalability limitations. The Decen- tralized Storage System (DSS) is proposed as an alternative solution, utilizing distributed ledger technologies, peer-to-peer (P2P) networks, and advanced cryptographic mechanisms to establish a fault-tolerant, secure, and highly available data storage infrastructure. This paper presents the design and imple- mentation of a decentralized storage framework that integrates key blockchain concepts—such as immutability, transparency, and consensus validation—to enhance data integrity and security. The system enables users to store, retrieve, and share data in a fully decentralized manner while ensuring confidentiality through encryption. The work includes a comprehensive architectural and functional analysis of a full-stack, decentralized file storage platform built specifically on the Filecoin Protocol, leveraging the InterPlanetary File System (IPFS) for distributed content addressing and efficient data retrieval. The platform employs a hybrid architecture combining Web2 technologies—Next.js for the frontend, Node.js/Express for the backend, and MongoDB for centralized metadata management—with core Web3 protocols. The analysis confirms the project's success in creating a practical, non-custodial storage solution that abstracts the complexities of the decentralized web. However, a key architectural trade-off is identified: the system's reliance on provider-centric tooling (Boost CLI) and third-party Remote Procedure Call (RPC) endpoints (Glif API) simplifies development but introduces dependencies that compromise the ideal of full, end-to-end decentralization.

S. Anuswethaa, Akshaya Hariharan, Yash Puthalath, Uma Jothi

No abstract is available for this record.