Secure Multi-Path Routing with All-or-Nothing Transform for Network-on-Chip Architectures

• URL: http://arxiv.org/abs/2601.13610v1
• Date: Tue, 20 Jan 2026 05:25:30 GMT
• Title: Secure Multi-Path Routing with All-or-Nothing Transform for Network-on-Chip Architectures
• Authors: Hansika Weerasena, Matthew Randall, Prabhat Mishra,
• Abstract summary: Eavesdropping attacks via malicious nodes are among the most common and stealthy.<n>We propose a lightweight confidentiality-preserving framework that utilizes a quasi-group based All-Or-Nothing Transform.<n>Our method effectively mitigates eavesdropping attacks by malicious routers with negligible area and performance overhead.
• Score: 2.175752761257231
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Ensuring Network-on-Chip (NoC) security is crucial to design trustworthy NoC-based System-on-Chip (SoC) architectures. While there are various threats that exploit on-chip communication vulnerabilities, eavesdropping attacks via malicious nodes are among the most common and stealthy. Although encryption can secure packets for confidentiality, it may introduce unacceptable overhead for resource-constrained SoCs. In this paper, we propose a lightweight confidentiality-preserving framework that utilizes a quasi-group based All-Or-Nothing Transform (AONT) combined with secure multi-path routing in NoC-based SoCs. By applying AONT to each packet and distributing its transformed blocks across multiple non-overlapping routes, we ensure that no intermediate router can reconstruct the original data without all blocks. Extensive experimental evaluation demonstrates that our method effectively mitigates eavesdropping attacks by malicious routers with negligible area and performance overhead. Our results also reveal that AONT-based multi-path routing can provide 7.3x reduction in overhead compared to traditional encryption for securing against eavesdropping attacks.

Related papers

• Blockchain-Enabled Routing for Zero-Trust Low-Altitude Intelligent Networks [77.17664010626726]
  We focus on the routing with multiple UAV clusters in low-altitude intelligent networks (LAINs)<n>To minimize the damage caused by potential threats, we present the zero-trust architecture with the software-defined perimeter and blockchain techniques.<n>We show that the proposed framework reduces the average E2E delay by 59% and improves the TSR by 29% on average compared to benchmarks.
  arXiv  Detail & Related papers  (2026-02-27T04:30:35Z)
• Rethinking Transferable Adversarial Attacks on Point Clouds from a Compact Subspace Perspective [55.919842734983156]
  CoSA is a transferable attack framework that operates within a shared low-dimensional semantic space.<n>CoSA consistently outperforms state-of-the-art transferable attacks.
  arXiv  Detail & Related papers  (2026-01-30T15:48:11Z)
• 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)
• CYPRESS: Transferring Secrets in the Shadow of Visible Packets [2.626352787008701]
  We show that covert channels in networking have a much greater potential for practical secret communication than what has been discussed before.<n>We present a covert channel framework, CYPRESS, that creates a reliable hidden communication channel by mounting packets from secret network entities on regular packets that flow through the network.<n>We can reach up to 1.6MB/s of secret bandwidth in a network of ten users connected to the Internet.
  arXiv  Detail & Related papers  (2025-11-09T21:02:09Z)
• Path-Controlled Secure Network Coding [5.930811196863302]
  Multicast for securely sharing confidential data is becoming increasingly important.<n>Currently, it relies on duplicate-and-forward routing and cryptographic methods based on computational security.<n>We show that path-controlled universal strongly ramp SNC can be overlaid onto QKD/PLS networks, enabling multicast capacity, ITS, and scalability.
  arXiv  Detail & Related papers  (2025-09-25T13:00:44Z)
• Privacy Enhanced QKD Networks: Zero Trust Relay Architecture based on Homomorphic Encryption [0.0]
  Quantum key distribution (QKD) enables unconditionally secure symmetric key exchange between parties.<n>Traditional solutions rely on trusted relay nodes, which perform intermediate re-encryption of keys using one-time pad (OTP) encryption.<n>We propose a zero-trust relay design that applies fully homomorphic encryption (FHE) to perform intermediate OTP re-encryption.
  arXiv  Detail & Related papers  (2025-03-21T10:20:06Z)
• How Robust Are Router-LLMs? Analysis of the Fragility of LLM Routing Capabilities [62.474732677086855]
  Large language model (LLM) routing has emerged as a crucial strategy for balancing computational costs with performance.<n>We propose the DSC benchmark: Diverse, Simple, and Categorized, an evaluation framework that categorizes router performance across a broad spectrum of query types.
  arXiv  Detail & Related papers  (2025-03-20T19:52:30Z)
• ACRIC: Securing Legacy Communication Networks via Authenticated Cyclic Redundancy Integrity Check [98.34702864029796]
  Recent security incidents in safety-critical industries exposed how the lack of proper message authentication enables attackers to inject malicious commands or alter system behavior.<n>These shortcomings have prompted new regulations that emphasize the pressing need to strengthen cybersecurity.<n>We introduce ACRIC, a message authentication solution to secure legacy industrial communications.
  arXiv  Detail & Related papers  (2024-11-21T18:26:05Z)
• 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)
• Breaking On-Chip Communication Anonymity using Flow Correlation Attacks [2.977255700811213]
  We develop and perform a machine learning (ML)-based flow correlation attack on existing anonymous routing techniques in Network-on-Chip (NoC) systems.<n>We propose a novel, lightweight anonymous routing protocol featuring outbound traffic tunneling and traffic obfuscation.<n>This protocol is designed to provide robust defense against ML-based flow correlation attacks, ensuring both packet-level and flow-level anonymity.
  arXiv  Detail & Related papers  (2023-09-27T14:32:39Z)
• Designing Secure Interconnects for Modern Microelectronics: From SoCs to Emerging Chiplet-Based Architectures [0.0]
  Research focuses on securing Network-on-Chip (NoC) interconnects in System-on-Chip (SoC) architectures.<n>Research builds on two methodologies: ObNoCs and POTENT.<n>New challenges, such as safeguarding inter-chiplet communication and interposer design, are addressed through enhanced obfuscation, authentication, and encryption mechanisms.
  arXiv  Detail & Related papers  (2023-07-11T21:49:45Z)

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.