Blockchain Papers

Cong Shen, Guofeng Zhang, Yue Wang

No abstract is available for this record.

José F. D. Venturini, Alex E. G. Leite, Fabiano Hessel

No abstract is available for this record.

Puneet Bakshi, Siddhant Bopche, M. Vinodh Kumar

No abstract is available for this record.

Rajshree Srivastava, Yugal Kumar, Kunal Kumar, Usha K · 5 authors

Disasters and pandemics have adverse effects on both lives and economies, requiring timely and adequate funding for relief efforts. However, traditional donation systems often face challenges such as funding delays and public distrust. This paper proposed Funding Blocks (FunB)s, a decentralized donation software built on the Tezos blockchain (TzBlockchain). It ensures transparency, accountability, and security in a trustless environment. Smart contracts powered by the Tezos network’s proof-of-stake consensus algorithm facilitate automatic tamper-proof execution of donation transactions. This helps in eliminating intermediaries and reducing administrative costs. The platform’s decentralized nature enhances scalability and resilience, enabling swift response to global calamities. It offers a user-friendly interface for direct contributions, incorporating mechanisms to verify and validate charitable organizations. It also provides real-time tracking of funds, ensuring transparent visibility to donors. By leveraging blockchain technology, FunBs addresses funding challenges, accelerates response times, and enhances the efficiency of disaster relief efforts. This model contributes to creating a sustainable and resilient funding ecosystem that empowers individuals and organizations to make secure and transparent contributions during crises

Talanya Nallamothu, Sriramulu Bojjagani, Shaik Shakeel Ahamad, Anup Kumar Maurya

No abstract is available for this record.

R. Gurunath, Debabrata Samanta, B. P. Etemi

In this paper, a scalable interoperable hybrid blockchain systems based on a novel seven-layer architecture is proposed. The model thereby solves the three problems that have restricted the development of traditional blockchains, i.e., low transaction throughput, inability of cross-chain communication, architectural rigidity, by clearly dividing responsibilities into separate layers dedicated to core infrastructure, operation systems, and application ecosystems. It applies a hybrid consensus approach where Proof of Stake (PoS) is adopted for global finality and Practical Byzantine Fault Tolerance (PBFT) is employed for shard-level consensus, offering energy efficiency as well as fault tolerance. With rollups, sharding, and interoperability protocols e.g. Polkadot, and IBC, it boasts high performance, modular extensibility and app-ability for real-world use-cases such as finance, IoT and healthcare. The proposed architecture would act as a basis for development in AI-driven smart contracts, privacy-preserving computation and quantum-secured consensus.

Giuliano Losa, Yifan Mao, Shaileshh Bojja Venkatakrishnan, Yunqi Zhang

No abstract is available for this record.

J. Pushpa, Dr.K. Suneetha, M.R. Padmapriya, N. Arun

No abstract is available for this record.

Amrutanshu Panigrahi, Amaresh Parida, Abhilash Pati, Bibhuprasad Sahu · 6 authors

No abstract is available for this record.

Steven Paul Nohr

Proof-of-Stake (PoS) consensus protocols commonly employ epochs as temporal abstractions to simplify validator accounting, reward distribution, and slashing enforcement. These designs assume clean and synchronized state transitions across epoch boundaries. In practice, distributed systems exhibit asynchronous execution, delayed finality, and implementation divergence.This paper introduces and analyzes <b><i>Validator Epoch Reset Collisions</i></b>, a class of temporal desynchronization vulnerabilities in which validator state resets, reward counters, slashing windows, or participation flags become inconsistently applied across epoch boundaries. We demonstrate how such collisions create exploitable enforcement gaps that can be leveraged to evade penalties, duplicate rewards, or bypass participation requirements—without violating protocol rules. We argue that epoch-based accounting introduces structural risks to economic security unless continuity-enforcing safeguards are applied.

Asma Graja

No abstract is available for this record.

Andrea Esposito, Francesco P. Rossi, Marco Bernardo, Francesco Fabris · 5 authors

Algorand is a scalable and secure permissionless blockchain that achieves proof-of-stake-based consensus via binary Byzantine agreement and cryptographic self-sortition. In this paper we present a process algebraic model of the Algorand consensus protocol, which captures the behavior of participants in terms of the alternation of steps toward a committee-based agreement. We use the model to study the robustness of the protocol with respect to malicious participants, which may try to boy- cott the commitment of the proposed block, as well as the probabilities of committing the proposed block or an empty one after a boycott attempt. Our process algebraic model is translated into LNT, the language of the CADP toolset, to investigate robustness via a novel application of equivalence-checking-based noninterference analysis, which we have implemented in CADP through its script verification language SVL.

Andrea Esposito, Francesco P. Rossi, Marco Bernardo, Francesco Fabris

Algorand is a scalable and secure permissionless blockchain that achieves proof-of-stake-based consensus via binary Byzantine agreement BBA∗and cryptographic self-sortition. In this paper we present a process algebraic model of the Algorand consensus protocol with the aim of enabling formal verification. Our model captures the behavior of participants in terms of the structured alternation of consensus steps toward a committee-based agreement. We verify the robustness of the protocol in the presence of coordinated malicious participants that may try to force the commitment of an empty block instead of the proposed one. The verification of our pure process algebraic model translated in the LNT language is conducted through a novel application of equivalence- checking-based noninterference analysis, which we have implemented in the CADP toolkit through its script verification language SVL.

Daniel J. Moroz

A key scientific question underlying the blockchain ecosystem is to what extent the core security properties of the protocols hold when assuming rational validators in the presence of capable economic attackers. To what degree and at what cost can these systems be disrupted? In this thesis, I analyze the underlying economic security properties of three of the most fundamental decentralization consensus algorithms: proof of work (PoW), proof of stake (PoS), and oracle information aggregation. In Chapter 2 of this work, I counter a prominent narrative that PoW is inherently flawed in an environment in which double-spend attacks are possible. By considering counterattacks, I recover PoW robustness against reorganization attacks through a game-theoretic model. In particular, I consider hashrate markets as a potential vector of attack and show that PoW remains robust in this case. In Chapter 3 of this work, I show novel chain reorganization and finality-delay attacks on the PoS mechanism of Ethereum. These attacks are deviations from the ’honest’ staking strategy, and I show that for participants staking a substantial percentage of the network’s staked assets, these attacks can be cheap and destructive to the network. In Chapter 4 of this work, I design an incentive mechanism for the information aggregation of noisy signals that is highly resilient to bribery. I establish the asymptotic strength and limitations of this mechanism against various classes of bribery including an attacker able to condition bribes on individual reports and on the outcome of the information aggregation. I achieve strong protection even in the latter case. To do this, I assume the presence of a source of truth (SoT) that is prohibitively expensive for typical use but can be invoked infrequently. This robustness to bribes is achieved even while in equilibrium there is no invocation of the SoT.

Joshua Shen

Blockchain as a promising technology is gaining its popularity ever since proof-of-work based Bitcoin came to the world. Nevertheless, Bitcoin achieves consensus at an expensive cost of energy. Proof-of-stake is one of the solutions for such a problem. Participants of PoS protocols achieve dynamic-availability in permissionless settings. Parties can join and leave the protocol at their will without notifying others. However, such protocol relies heavily on a central clock, providing the function of synchrony by collecting the finish status of every honest participant. In our protocol, the global function maintains the round information for each participant no longer needed. We analyze and modify the round into real-time based round model. Message delivery delay is also taken into consideration of the round length. However, participant need the connection of a real-world time global clock which is crucial to calculate the current round. And round length also is adjusted due to the changing network situation at the start of every new epoch.

Christos Makridis, Soulla Louca, Roman Beck

Blockchain, originally developed to solve the double-spending problem in digital currencies like Bitcoin, has evolved into a foundational technology with broad applications across public and private sectors.Its key features-immutability, decentralized trust, and cryptographic security-enable authenticated data sharing without the need for a central authority.This is particularly valuable in systems like supply chains, where participants may not know or trust each other.Smart contracts further enhance blockchain's utility by automating agreements through code, reducing uncertainty and fostering trust among stakeholders.The rise of the decentralized web, combined with emerging technologies like IoT, AI, and AR/VR, signals a wave of disruptive innovation whose full impact is yet to be seen.Given the rapid pace of development, academic research is essential to understand and guide blockchain's evolution.Conferences are especially important for timely knowledge dissemination, as they can keep up with the fast-moving nature of the field better than traditional journals.This mini-track builds on a series of successful sessions from HICSS conferences (HICSS-51 through HICSS-58), which have focused on blockchain's impact in areas such as fintech, transformation, and innovation.Over the years, it has served as a valuable forum for exploring blockchain technology and its implications for process improvement and innovation.For the current edition, six accepted papers contribute to expanding the academic understanding and supporting broader adoption of blockchain solutions.The first paper, "Playing Strategic Games in The Open Network (TON): Analyzing the Robustness of Proof-of-Stake Slashing Incentives", by Sascha Hgele, analyzes how rational validators in the TON blockchain respond to slashing penalties in a proof-of-stake system.Using a game-theoretic model, it reveals that when penalty enforcement is uncertain, validators strategically weigh risks and rewards, which impacts

Nayma Akther Jahan, Shahana Afrose Chowdhury

No abstract is available for this record.

Pankhuri Gupta, Akshat Sinha, Harsh Rawat, Aaditya Kumar Jha · 5 authors

No abstract is available for this record.

Prince Solanki, Sanjay Nakharu Prasad Kumar, Amogh Sharma, Dhruv Mehta · 6 authors

No abstract is available for this record.

Dr.A.Swetha Dr.A.Swetha, GADDAM KARTHIKEYA, GADDAM KARTHIKEYA, DHARAVATHU NITHIN

No abstract is available for this record.

Divesh Sarkar, Manish Sarkar

No abstract is available for this record.

Zulkarnain Muhamad Sori, Damar Hulan Osman, Mohamad Nazzeer Hamzah

No abstract is available for this record.

John Edmunds

No abstract is available for this record.

Parshva Jain

The proliferation of distributed multi-agent systems in industrial and healthcare domains highlights fundamental limitations of centralized authentication architectures. These systems, comprising autonomous agents operating across organizational boundaries, require authentication mechanisms that eliminate single points of failure, preserve data sovereignty, protect privacy during data aggregation, and enable trust establishment without central authorities. Central identity providers, however, introduce systemic risks by concentrating trust and control, enabling privacy-invasive observation of authentication events and, in the event of compromise, facilitating large-scale credential breaches, challenges that are particularly acute in scalability- and privacy-sensitive deployments. This thesis presents the design, implementation, and evaluation of the Distributed Authentication and Privacy System (DAPS), a decentralized authentication framework for multi-agent systems based on W3C Decentralized Identifiers (DIDs) and Verifiable Credentials (VCs). The research adopts a Design Science Research (DSR) methodology and contributes a reference architecture together with a corresponding implementation on Hyperledger Fabric, a permissioned enterprise blockchain platform that does not natively support Self-Sovereign Identity (SSI). DAPS implements a three-component architecture comprising autonomous agents, fusion centers as data aggregators, and credential issuers. Agents generate cryptographic keys and DIDs, obtain issuer-signed Verifiable Credentials, and authenticate with fusion centers using a decentralized authentication protocol that does not require contacting credential issuers at the time of verification. Credential integrity and revocation status are validated through blockchain-anchored proofs, enabling decentralized and offline-capable authentication. To mitigate inferential privacy risks during data aggregation, DAPS integrates a modular ε-differential privacy mechanism based on the Laplace distribution, allowing configurable privacy-utility trade-offs for aggregated sensor data. The framework is evaluated through functional, performance, security, and privacy analyses. Functional evaluation verifies the correct realization of DID management, VC lifecycles, and authentication workflows. Performance analysis characterizes the behavior of critical operations under concurrent load, highlighting the impact of architectural choices such as synchronous and asynchronous blockchain interactions. Security evaluation assesses the system against an explicit threat model, examining resistance to impersonation, replay, and tampering within the assumed trust boundaries. Privacy evaluation empirically validates the behavior of the differential privacy mechanism, illustrating the trade-off between privacy guarantees and analytical utility. The results demonstrate how W3C-compliant decentralized authentication, integrated with differential privacy mechanisms, can be realized as a reference system on enterprise blockchain platforms without native SSI support, providing a reusable architectural and implementation blueprint for large-scale multi-agent environments.