Jul 2026· Annual International Computer Software and Applications Conference· pp. 930-935· 0 citations· 17 references
Abstract
The introduction of blockchain technology has revolutionized decentralized systems. Blockchain enables peer-to-peer (P2P) transactions to be trustworthy and transparent. However, existing traditional consensus mechanisms such as Proof of Work (PoW) and Proof of Stake (PoS) have significant issues regarding computational costs, efficiency, and centralization, which severely limit their adoption in resource-constrained environments. For instance, in an industrial Internet of Things (IoT) network or a smart metering infrastructure, devices operate on strict energy budgets and cannot participate in compute-heavy PoW mining. They also lack the capital to lock up financial stakes for PoS. To address those limitations, randomized consensus mechanisms such as Pure Proof of Stake (PPoS) and Proof of Luck (PoL) were introduced. Yet these methods have issues with fairness, secure randomness generation, and cost efficiency. This paper proposes a new randomized proposer selection mechanism for blockchain consensus called Proof of Proximity (PoP) that enhances unpredictability, fairness, decentralization, and security. PoP replaces cryptographic randomness beacons with transaction-derived entropy and distance minimization. This enables fair, unpredictable proposer selection without relying on Verifiable Random Functions (VRFs), trusted hardware, or stakebased weighting, maintaining low computational overhead. The mechanism is ideal for IoT networks where resource consumption and security are critical. Experimental and comparative analysis results prove that PoP achieves improved fairness, decentralization, security, and low resource consumption, making it suitable for resource-constrained decentralized systems.
This study qualitatively examines ten widely used consensus algorithms within the research context of Bintan, Riau Islands, Indonesia and indicates that DAG/IOTA and Hashgraph achieve the highest throughput with minimal latency, making them suitable for IoT and enterprise-scale applications.
Dodi Setiawan¹, Sri Sutjiningtyas², A. Eka et al.· West Science Information Sys...· 0 citations
Elastic Proof-of-Location Byzantine Fault Tolerance is proposed, a privacy-preserving and location-aware blockchain consensus framework for IoT systems that reduces communication overhead and improves consensus efficiency compared with conventional PBFT-based approaches while strengthening resilience against location-based and identity-based attacks.
Yunus Kareem, D. Djenouri, Essam Ghadafi· Future Internet· 0 citations
Modern supply chain management systems increasingly rely on distributed architectures to ensure transparency, integrity, and trust between participants. Blockchain technology provides a promising foundation for such systems; however, traditional consensus mechanisms introduce high computational overhead, energy inefficiency, and privacy risks. These limitations are particularly critical for small and medium-sized enterprises (SMEs) with constrained computational resources, that they are using to expand on their traditional informational systems and not to integrate distributed technologies into the work process, as setup process for blockchain tools is more complex than centralized approach. This paper proposes a private, dockerized blockchain architecture for supply chain management that combines the Proof of Friendship (PoF) consensus mechanism with Zero-Knowledge Proofs (ZKP). By integrating a private, dockerized framework with the Proof of Friendship consensus and Zero-Knowledge Proofs, this architecture enables resource-constrained enterprises to achieve a high-performance decentralized network that simultaneously ensures sub-second transaction validation through social trust metrics, robust protection of competitive business intelligence via cryptographic privacy, and seamless cross-platform deployment through containerization, ultimately overcoming the traditional trade-offs between system transparency, operational cost, and data confidentiality in global trade. PoF extends Proof of Stake by incorporating social trust indicators, including transaction success rate and geographic diversity of validators, enabling resource-efficient and decentralized consensus. ZKP mechanisms are integrated through an off-chain prover module, allowing transaction correctness to be verified without revealing sensitive business data. The proposed approach enhances cybersecurity, data confidentiality, and system scalability while reducing computational costs. Simulation results demonstrate improved resistance to Sybil attacks, reduced validator centralization, and acceptable transaction latency for corporate blockchain deployments.
Pavlo Zherzherunov, O. Shmatko· Bulletin of NTU "KhPI". Seri...· 0 citations
This work demonstrates that a dynamic, reputation-based security layer can provide near-total protection against the modeled threats at negligible performance cost, offering a viable, highly effective solution for securing resource-constrained IoT deployments.
N. N. A., A. T, Bhuvaneswari M.· Discover Internet of Things· 0 citations
In recent times, industries are expanding globally to meet the needs of growing population. Government and other regulatory bodies monitor industries to ensure compliance with standards particularly discharges that may pose threat to nearby residents. However, regulatory bodies often struggle with limited human resources that hinder the effectiveness of audit. This issue can be addressed by installing Internet of Things (IoT) devices in the industry to collect the data and store it on the servers, enabling regulatory bodies to review it remotely and conduct onsite inspection when anomalies detected. The challenging aspect is that the centrally stored data are vulnerable to cyberattacks and it can be tampered. Blockchain technology can provide a promising solution as it stores the data in the distributed ledger that is inherently tamper proof. However, using blockchain to store the data collected by IoT devices face challenges related to scalability. Further, latency will be also a concern due to the time taken by the consensus mechanism to validate the blocks and add them to the chain. To address these challenges, we introduce a novel consensus algorithm named Proof of Reward (PoR) tailored for applications demanding high throughput. The PoR consensus mechanism is designed to improve resilience against Byzantine failures by enabling reliable pairwise decision making under distributed adversarial environments. Further, the proposed consensus minimizes communication overhead during the block finalization by considering first two third of node responses, thereby enhancing the overall network throughput. The communication overhead of the proposed consensus is 34.78% lesser compared to Practical Byzantine Fault Tolerance (PBFT) and 18.55% lesser compared to Istanbul Byzantine Fault Tolerant (IBFT). The obtained results highlight the effectiveness of the proposed consensus algorithm.
S. P.N., S. Kaliraj, Jaisingh Thangaraj et al.· Journal of Cloud Computing· 0 citations
The rapid development of the Internet of Things (IoT) has placed considerable pressure on both security and stability in heterogeneous, resource-constrained networks. In such dynamic environments, trust management is a central issue to determine which service providers can be trusted and to combat malicious activity. Although blockchain-based solutions have offered a means for decentralized, tamper-resistant trust management, most rely on classical cryptographic primitives, which are vulnerable to future quantum computing attacks. This study proposes a Quantum-Resistant Blockchain-Based Trust Management (QR-BCTM) framework in which Post-Quantum Cryptographic mechanisms, Permissioned Blockchain Platform, and Fog-assisted Trust Management architecture are combined and utilized in IoT networks. The framework introduces a quantum-aware trust computation model that combines behavioral trust, indirect recommendations, and a cryptographic assurance score quantifying each participant’s compliance with security requirements. Trust evidence is compressed to reduce blockchain storage and communication overhead, while the hierarchical fog-blockchain architecture offloads computationally intensive operations from resource-constrained IoT devices. The performance of the framework has been simulated in the presence of an adversary, including bad-mouthing, ballot-stuffing, on-off behavior, and identity attacks using a Sybil-type mechanism. Trust accuracy, false trust acceptance, communication overhead, and computation cost were measured, and a sensitivity analysis on the trust-weight parameters was performed. The simulation results suggest that QR-BCTM can enhance the accuracy of trust evaluation, mitigate the impact of malicious nodes, and remain scalable and efficient despite the existing cryptographic overhead. Post-quantum digital signatures and formal security analysis provide protection against quantum-era threats and attacks, while classical threats are mitigated through behavioral trust aggregation and recommendation filtering. In summary, QR-BCTM provides a scalable, simulation-validated and quantum-aware framework for trustworthy IoT network operation, offering practical guidelines for future deployment and prototyping.
M. A. Al-Khasawneh, D. Alsekait, K. Alkayid et al.· Scientific Reports· 0 citations