PofoliaShared via Pofolia

Transactions on Emerging Telecommunications Technologies· 2026Q2

DIP‐BLS: Dynamic Interaction Planning and BLS Aggregate Signatures for Low‐Latency Data Forwarding in Web 3.0

Yang Liu, Zihang Yin, Tongtong Cheng, Dapeng Wu

Short summary

DIP-BLS is a new protocol for Web 3.0 that uses dynamic interaction planning and BLS aggregate signatures to achieve low-latency data forwarding, improving delivery ratio and throughput by 10-20% compared to traditional methods.

AI-generated from the title and abstract; the full text is not read.

Key points

  • DIP-BLS enables low-latency data forwarding in Web 3.0 by using dynamic interaction planning and BLS aggregate signatures.
  • Nodes maintain local interaction plans based on probes for connectivity, latency, bandwidth, and load, enabling multi-metric forwarding.
  • BLS signatures are aggregated hop-by-hop into a constant-size credential for efficient batch verification.
  • Simulations show DIP-BLS outperforms shortest-path and flooding methods in delivery ratio, latency, and throughput.

AI-generated from the title and abstract; the full text is not read.

Abstract

ABSTRACT The decentralized nature of Web 3.0 forms networks of autonomous, heterogeneous entities, including smart contracts and dapp modules, among others, which operate on untrusted infrastructure for interactive communication. In such environments, component churn is frequent, link conditions vary in real time, and the logical topology is perpetually in flux. Traditional routing paradigms that depend on static views or centralized controllers are ill‐suited for this setting, as they incur high overhead, exhibit poor adaptability, and introduce single points of failure. Meanwhile, ensuring end‐to‐end data authenticity and processing integrity across multiple relay hops remains a critical yet unresolved concern in the absence of trusted intermediaries. To tackle these intertwined challenges, we propose DIP‐BLS, a unified protocol that couples dynamic interaction planning with BLS aggregate signatures into a coherent data exchange framework. On the one hand, each node independently maintains a local interaction plan that tracks neighbor connectivity, latency, available bandwidth, and load through lightweight probes, enabling multi‐metric forwarding decisions without global coordination. On the other hand, every relay hop appends a BLS signature to the packet, and these signatures are progressively aggregated into a constant‐size credential, permitting efficient batch verification at the destination. Theoretical analysis and simulation experiments demonstrate that, compared with shortest‐path and flooding‐based methods, DIP‐BLS achieves marked improvements in data delivery ratio, average interaction latency, and system throughput, while providing strong tamper resistance and identity traceability at acceptable overhead—well‐suited to Web 3.0 distributed application scenarios that demand both high efficiency and robust security.

The authors' abstract, as published at the source. Transactions on Emerging Telecommunications Technologies, 2026 · DOI ↗

TakeawaysPremium
Ask the paperFree account

Continue with a free account

Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.

Continue free on the web

Sign in with Google or Apple; no card needed. You come back to this paper.

On your phone:

Field: Computer Networks and Communications

Computer Networks and CommunicationsComputer Science