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

• URL: http://arxiv.org/abs/2509.25113v1
• Date: Mon, 29 Sep 2025 17:40:31 GMT
• Title: Two-Dimensional XOR-Based Secret Sharing for Layered Multipath Communication
• Authors: Wai Ming Chan, Remi Chou, Taejoon Kim,
• Abstract summary: This paper introduces the first two-dimensional XOR-based secret sharing scheme for layered multipath communication networks.<n>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.
• Score: 6.708717040312532
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• On the Practical Feasibility of Harvest-Now, Decrypt-Later Attacks [0.0]
  Harvest-now, decrypt-later (HN-DL) attacks threaten today's communications by archiving text until a quantum computer can break the underlying key exchange.<n>This paper reframes HN-DL as an economic problem, quantifying adversary costs across Transport Layer Security (TLS) 1.2, TLS 1.3, QUIC, and Secure Shell (SSH)<n>We evaluate protocol configuration strategies that act along two independent cost axes storage overhead and quantum workload.
  arXiv  Detail & Related papers  (2026-03-01T13:04:05Z)
• Multi-Agent-Driven Cognitive Secure Communications in Satellite-Terrestrial Networks [58.70163955407538]
  Malicious eavesdroppers pose a serious threat to private information via satellite-terrestrial networks (STNs)<n>We propose a cognitive secure communication framework driven by multiple agents that coordinates spectrum scheduling and protection through real-time sensing.<n>We exploit generative adversarial networks to produce adversarial matrices, and employ learning-aided power control to set real and adversarial signal powers for protection layer.
  arXiv  Detail & Related papers  (2026-01-06T10:30:41Z)
• Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems [55.49917140500002]
  Quantum computers will be able to break modern cryptographic systems using Shor's Algorithm.<n>We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks.<n>We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem.
  arXiv  Detail & Related papers  (2025-05-06T03:42:38Z)
• Application of $α$-order Information Metrics for Secure Communication in Quantum Physical Layer Design [45.41082277680607]
  We study the $alpha$-order information-theoretic metrics based on R'enyi entropy.<n>We apply our framework to a practical scenario involving BPSK modulation over a lossy bosonic channel.
  arXiv  Detail & Related papers  (2025-02-07T03:44:11Z)
• Post-Quantum Key Agreement Protocols Based on Modified Matrix-Power Functions over Singular Random Integer Matrix Semirings [0.0]
  Post-quantum cryptography is essential for securing digital communications against threats posed by quantum computers.<n>This paper introduces two novel post-quantum key agreement protocols that can be easily implemented on standard computers.
  arXiv  Detail & Related papers  (2025-01-04T14:01:09Z)
• Physical Layer Deception with Non-Orthogonal Multiplexing [52.11755709248891]
  We propose a novel framework of physical layer deception (PLD) to actively counteract wiretapping attempts.<n>PLD combines PLS with deception technologies to actively counteract wiretapping attempts.<n>We prove the validity of the PLD framework with in-depth analyses and demonstrate its superiority over conventional PLS approaches.
  arXiv  Detail & Related papers  (2024-06-30T16:17:39Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• Quantum Secure Protocols for Multiparty Computations [2.9561405287476177]
  We present secure multiparty computation (MPC) protocols that can withstand quantum attacks. We first present the design and analysis of an information-theoretic secure oblivious linear evaluation (OLE), namely $sf qOLE$ in the quantum domain. We further utilize $sf qOLE$ as a building block to construct a quantum-safe multiparty private set intersection (MPSI) protocol.
  arXiv  Detail & Related papers  (2023-12-26T19:53:29Z)
• Relating non-local quantum computation to information theoretic cryptography [0.0]
  Non-local quantum computation (NLQC) is a cheating strategy for position-verification schemes, and has appeared in the context of the AdS/CFT correspondence. We show one special case of NLQC, known as $f$-routing, is equivalent to the quantum analogue of the conditional disclosure of secrets primitives. By relating position-verification to these cryptographic primitives, a number of results in the cryptography literature give new implications for NLQC.
  arXiv  Detail & Related papers  (2023-06-28T18:00:05Z)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.