Two-Dimensional XOR-Based Secret Sharing for Layered Multipath Communication

2025-09-29

AI Summary

In hierarchical multipath communication networks, adversaries may eavesdrop on or compromise any single path, posing severe security threats. Method: This paper proposes the first two-dimensional XOR-based secret sharing scheme, relying solely on bitwise XOR operations to achieve information-theoretically perfect secrecy and reliable reconstruction—without encryption, thus inherently quantum-resistant and suitable for resource-constrained domains such as military applications. Contribution/Results: By embedding a novel 2D structure into the hierarchical multipath architecture, the scheme uniquely enables joint path-level intrusion tolerance and inter-layer redundancy. We formally prove its unconditional security under compromise of any single path. With computational complexity O(|S|) and minimal communication overhead, it simultaneously satisfies stringent security requirements and lightweight deployment constraints.

Technology Category

• Machine Learning: Hardware-aware ML
• Search and Optimization: Distributed Search
• Planning, Routing, and Scheduling: Scheduling under Uncertainty

Application Category

• Security and Privacy: Large-scale security measurements
• Responsible Web: Measurement, analysis, and circumvention of Web censorship
• Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphs

Abstract

This paper introduces the first two-dimensional XOR-based secret sharing scheme for layered multipath communication networks. We present a construction that guarantees successful message recovery and perfect privacy when an adversary observes and disrupts any single path at each transmission layer. The scheme achieves information-theoretic security using only bitwise XOR operations with linear $O(|S|)$ complexity, where $|S|$ is the message length. We provide mathematical proofs demonstrating that the scheme maintains unconditional security regardless of computational resources available to adversaries. Unlike encryption-based approaches vulnerable to quantum computing advances, our construction offers provable security suitable for resource-constrained military environments where computational assumptions may fail.

Problem

• Develops XOR-based secret sharing for multipath networks
• Guarantees message recovery against single-path disruptions
• Provides information-theoretic security using only XOR operations

Innovation

• Two-dimensional XOR-based secret sharing scheme
• Guarantees message recovery and perfect privacy
• Uses bitwise XOR operations with linear complexity