Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.25113 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914064258564096 |
|---|---|
| author | Chan, Wai Ming Chou, Remi Kim, Taejoon |
| author_facet | Chan, Wai Ming Chou, Remi Kim, Taejoon |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_25113 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Two-Dimensional XOR-Based Secret Sharing for Layered Multipath Communication Chan, Wai Ming Chou, Remi Kim, Taejoon Cryptography and Security 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. |
| title | Two-Dimensional XOR-Based Secret Sharing for Layered Multipath Communication |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2509.25113 |