ByzSkip - A Byzantine-Resilient Skip Graph

Blockchain technology has accelerated the advancements of next-generation P2P data networks and decentralized architectures. However, current P2P data networks have significant limitations in handling interrelated data and executing range queries, while ensuring Byzantine fault tolerance. We present ByzSkip, a novel key-order preserving structured overlay network (KOPSON), resilient to Byzantine faults. Preserving the ordering relationship among keys in the structure enables ByzSkip to effectively handle interrelated data and execute range queries. ByzSkip extends the structure of Skip Graph, a well-studied KOPSON, by incorporating multiple neighbors. The search algorithm of ByzSkip provides fully decentralized routing that forwards the same message redundantly from $k$ distinct nodes to $k$ distinct nodes in each hop, which achieves a high search success ratio under the influence of adversarial routing attacks. ByzSkip updates the routing table by redundantly collecting each routing table entry to prevent pollution from adversarial nodes in eclipse attacks. Results of theoretical analysis, simulations, and experiments show the performance, resilience, and practicality of ByzSkip. ByzSkip achieves a small latency and high success ratio in searches under attacks, with small overheads to maintain the overlay network compared to the existing methods.