Jul 2026· Annual International Computer Software and Applications Conference· pp. 2205-2210· 0 citations· 36 references
Computer Science
Abstract
This paper reports a five-scenarios migration study from classical ECDSA to post-quantum cryptography (PQC) and hybrid signature settings for Ethereum-like blockchains. Using reproducible pipeline outputs from a multi-repository toolchain, we compare baseline ECDSA, hybrid ECDSA+ML-DSA, ML-DSA throughput collapse, ML-DSA latency spike (larger blocks), and SLH-DSA computational bottleneck cases. We also include Layer 2 roll-up/data-availability (DA) scenarios at 2-second cadence. Results show that PQC migration substantially reduces key-exposure risk but introduces severe throughput and fee penalties under fixed block limits. Enlarging blocks restores throughput but increases propagation delay, storage growth, and fork/orphan risk. Hybrid deployment preserves migration compatibility but inherits significant fee pressure. We provide quantitative security, performance, network, and blockchain-health metrics. The results expose three migration regimes. First, fixed-cap PQC replacement (1 MB) results in significant throughput loss and fee inflation. Second, capacity compensation (larger blocks) can recover TPS but amplifies propagation delay and chain-growth pressure, increasing fork/orphan risk. Third, hybrid deployment provides compatibility and reduces crypto-graphic risk, but it incurs substantial overhead.
Blockchain systems often incur high inclusion latency due to validation and finality pipelines, limiting the performance of time-sensitive applications. We present Early Admission (EA), an overlay mechanism that reduces time-to-inclusion by allowing blocks from high-reputation proposers to become provisionally ledger-visible after partial validation. EA uses smart markers to record the provisional status and to support secure, auditable updates once the full validation is complete, and the final commitment remains governed by the underlying consensus. In an event-driven simulator spanning three high-throughput archetypes (Hedera-like, Redbelly-like, and Fabric-style), we find that EA can reduce mean time-to-inclusion by up to 65% under consistent resource assumptions, saturated demand, and bounded in-flight pipeline depth. To show that EA is robust against collusion attacks, we model adversarial incentives as a two-player game and show that collusion becomes economically unattractive when the EA-stage detection rate of early-admitted malicious blocks exceeds approximately 94%, which provides guidance for configuring EA thresholds and penalties.
Matthew Sharp, Laurent Njilla, Chin-Tser Huang· International Conference on...· 0 citations
A PRISMA 2020-compliant systematic review that analyzes Field-Programmable Gate Array (FPGA) and Application-Specific Integrated Circuit (ASIC) implementations of Elliptic Curve Cryptography (ECC) and Post-Quantum Cryptography (PQC) from 2018 to 2025 reveals critical gaps between academic research and deployment reality.
Accurate carbon footprint accounting is fundamental for urban environmental governance. However, multi-stakeholder transit networks struggle with data manipulation, privacy risks, and labor-intensive manual auditing. To resolve these trust and scalability bottlenecks, this paper introduces a tri-layer hybrid blockchain framework based on an “off-chain storage, on-chain evidence” paradigm. The architecture synergizes a relational database (MySQL) for high-throughput structured data, the InterPlanetary File System (IPFS) for decentralized raw evidence, and Hyperledger Fabric to immutably anchor dual-layer cryptographic hashes. We engineer a smart contract auditing pipeline that autonomously executes deterministic verification of hash consistency, emission thresholds, and physical logic integrity. Empirical evaluations utilizing a large-scale urban transit dataset injected with adversarial mutations demonstrate high robustness, achieving F1-scores of 1.000 across multidimensional anomalies. This replaces manual testing with statistically significant verification. Ultimately, this framework provides environmental regulators and transit authorities with a highly scalable, privacy-preserving, and trust-minimized infrastructure for continuous carbon footprint traceability.
Cheng Qian, Fan Yang, Yu-Zhou Jiang et al.· Mathematics· 0 citations
Blockchain technology enables decentralized trust, yet traditional blockchain networks face critical scalability limitations under large-scale deployments. Sharding improves throughput through parallel processing, but existing sharded BFT architectures still suffer from severe hierarchical coupling between shards and the verification committee. Moreover, the complex asynchronous competition and backoff/retransmission dynamics in sharded blockchain services remain largely unmodeled, leaving the network-level steady-state behavior of sharded blockchains poorly understood. To address these challenges, we propose D2S-BFT, a novel Decoupled Double-Star Byzantine Fault-Tolerant architecture, which physically decouples local intra-shard consensus from global verification. For rigorous performance evaluation, we establish a randomized-service double-star service system and cast the cross-shard competition mechanism as a finite-source Markov chain. We derive the state transition probability matrix under general load conditions, compute the extended sojourn time, and construct an end-to-end transaction on-chain latency equation that explicitly incorporates encryption overhead, network delay, and queuing delay. The resulting D2S queuing model, expressed in the non-classical Kendall notation L/G/n=2/inf/L-RSS, provides strict theoretical boundary constraints on system performance. It demonstrates that D2S-BFT can effectively alleviate transaction congestion and ensure robust operation, while also laying a rigorous analytical foundation for model-driven configuration optimization in large-scale dynamic blockchain environments.
Ji-Qiang Liu, Lijun Sun, Xiao Chen et al.· 2026 International Conferenc...· 0 citations
The Internet of Things look out on growing security and privacy defies, principally in light of the up growth of quantum threats. To handle these defies, we suggest a unified security framework that merges post-quantum blockchain technologies and zero-knowledge proofs (ZKPs) to attain secure authentication, decentralized identity management, and advanced data protection. The provided system based on a power-weighted consensus mechanism, compressed and overlapping recursive ZKPs, and transaction batching to decrease on-chain load. The outcomes display that the suggested system outperforms conventional systems and state-of-the-art solutions, with response time reduced to 92 ms, transaction throughput increased to 735 tx/s, energy consumption reduced to 0.37 J/op, and authentication accuracy increased to 97.6%, achieving a privacy score of 0.91.These outcomes emphasize that the offered framework not only attains superior performance but as well supplies strong resistance to quantum attacks and high privacy warranties, making it a promising solution for securing future IoT environments.
Hayder A. Nahi, Rusul A. Salman, Awring Falah Hassan et al.· Discover Computing· 0 citations
The study evaluates major post-quantum cryptographic primitives, assesses their suitability for blockchain environments, and proposes a layered architecture grounded in crypto-agility, defense-in-depth, and forward secrecy.
Hamed Taherdoost· Cryptography· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
