Enforcing Attestable Workflows across Untrusted Networks

• URL: http://arxiv.org/abs/2605.09297v1
• Date: Sun, 10 May 2026 03:45:22 GMT
• Title: Enforcing Attestable Workflows across Untrusted Networks
• Abstract summary: We propose codename, an architecture federating Trusted Execution Environments via a split Trusted Computing Base design.<n>codename achieves native-speed encrypted routing by anchoring cryptographic enforcement in the kernel.<n>On distributed pipelines, codename incurs just a $6.1%$ execution penalty over plaintext baselines, bypassing the $62%$ penalty of user-space counterparts.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Confidential high-performance computing orchestrates workloads across federated domains, yet existing frameworks rely on high-overhead user-space library operating systems or assume single-host execution. We propose \codename, an architecture federating Trusted Execution Environments via a split Trusted Computing Base (TCB) design. It couples a hardware-isolated Control Plane executing Mutually Attested Key Exchange (\make) with a measured guest-resident extended Berkeley Packet Filter (eBPF) Data Plane. By anchoring cryptographic key release to hardware measurements and executing enforcement in the kernel, \codename\ achieves native-speed encrypted routing. Empirical evaluation demonstrates a steady-state enforcement cost of $6\,μ$s per packet, imposing a $13$--$15\,μ$s absolute latency overhead. On distributed pipelines, \codename\ incurs just a $6.1\%$ execution penalty over plaintext baselines, bypassing the $62\%$ penalty of user-space counterparts. The system initializes a 100-node cluster in under 1.5 seconds, providing an efficient confidential interconnect for long-running workflows.

Related papers

• HetRoute Heterogeneous and Cost-aware Collaborative Routing Framework for Distributed Edge MoE Inference [47.0879800334801]
  HetRoute is a heterogeneous-cost-aware collaborative routing framework for distributed edge MoE inference.<n>HetRoute reduces average inference latency by up to 59.0% and P99 latency by up to 58.0%.
  arXiv  Detail & Related papers  (2026-08-01T10:30:01Z)
• TraceCodec: A Compiler-Backed Neural Codec for Stateful Multi-Flow Network Traffic Traces [10.977191979493968]
  Critical networking legality require high-fidelity packet captures (PCAPs) for testing, security analysis, and protocol validation.<n>Recent packet generators have demonstrated protocol-constrained PCAP synthesis, but they universally decode directly to raw packet fields.<n>We present TraceCodec, a state-aware neural for stateful multi-flow traces.
  arXiv  Detail & Related papers  (2026-05-28T13:52:40Z)
• parallelcbf: A composable safety-filter and auditability framework for tensor-parallel reinforcement learning [0.45470638320073126]
  We release ParallelCBF v0.1.0 under Apache2.0 with a four-layer composable API, a CPU PyTorch reference implementation of a dual-barrier (squared / linear-predictive) CBF.<n>We report a representative end-to-end pipeline execution in which the framework's auditability layer halted a downstream training stage that did not meet pre-registered convergence criteria.
  arXiv  Detail & Related papers  (2026-05-15T01:06:16Z)
• SWE-Cycle: Benchmarking Code Agents across the Complete Issue Resolution Cycle [46.833916047516716]
  SWE-Cycle is a benchmark of 489 rigorously filtered instances of autonomous code agents.<n>SWE-Judge combines static code review with dynamic testing to accurately verify functional correctness.<n>The results reveal a sharp drop in solve rates when transitioning from isolated tasks to FullCycle execution.
  arXiv  Detail & Related papers  (2026-05-13T08:05:16Z)
• Sequential vs. Simultaneous Entanglement Swapping under Optimal Link-Layer Control [1.8829359083448898]
  Connection-less, packet-switched quantum network architectures distribute entanglement across multi-hop paths through sequential entanglement swapping.<n>We present a proof-of-principle study at fixed chain length $n = 4$ in which each link is governed by a fixed reinforcement-learning policy.<n>Sequence swapping collapses to zero end-to-end deliveries below $T_cmathrmext/= 25$, and begins recovering at $T_cmathrmext/= 50$.
  arXiv  Detail & Related papers  (2026-05-05T17:59:22Z)
• Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures [0.15293427903448018]
  Pauli-based computation (PBC) provides a universal framework for executing fault-tolerant quantum algorithms.<n>We investigate the tradeoff between error-correcting code block size and execution time of PBC within the Q-Fly architecture at intermediate scale.<n>We find that large qLDPC code blocks outperform the surface code baseline in terms of execution time by up to an order of magnitude when evaluated against quantum optimization algorithms.
  arXiv  Detail & Related papers  (2026-05-05T15:19:56Z)
• FLAME: Flexible and Lightweight Biometric Authentication Scheme in Malicious Environments [28.701804496120406]
  biometric underlineAuthentication scheme designed for a underlineMalicious underlineEnvironment.<n>A rigorous theoretical analysis validates the correctness, security, and efficiency of $sysname$.
  arXiv  Detail & Related papers  (2025-11-04T01:43:03Z)
• Probabilistically Tightened Linear Relaxation-based Perturbation Analysis for Neural Network Verification [83.25968588249776]
  We present a novel framework that combines over-approximation techniques from LiRPA-based approaches with a sampling-based method to compute tight intermediate reachable sets.<n>With negligible computational overhead, $textttPT-LiRPA$ exploiting the estimated reachable sets, significantly tightens the lower and upper linear bounds of a neural network's output.
  arXiv  Detail & Related papers  (2025-07-07T18:45:53Z)
• Extractors: QLDPC Architectures for Efficient Pauli-Based Computation [39.98920557126034]
  We propose a new primitive that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation.<n>In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle.<n>Our architecture can implement universal quantum circuits via parallel logical measurements.
  arXiv  Detail & Related papers  (2025-03-13T14:07:40Z)
• Jodes: Efficient Oblivious Join in the Distributed Setting [13.270794419242144]
  We present Jodes, an efficient oblivious join algorithm in the distributed setting.<n>Jodes achieves up to a sixfold performance improvement over state-of-the-art join algorithms.
  arXiv  Detail & Related papers  (2025-01-16T07:12:14Z)
• Lightweight, Secure and Stateful Serverless Computing with PSL [43.025002382616066]
  We present Function-as-a-Serivce (F) framework for Trusted Execution Environments (TEEs) The framework provides rich programming language support on heterogeneous TEE hardware for statically compiled binaries and/or WebAssembly (WASM) bytecodes. It achieves near-native execution speeds by utilizing the dynamic memory mapping capabilities of Intel SGX2.
  arXiv  Detail & Related papers  (2024-10-25T23:17:56Z)
• Data-Oblivious ML Accelerators using Hardware Security Extensions [9.716425897388875]
  Outsourced computation can put client data confidentiality at risk. We develop Dolma, which applies DIFT to the Gemmini matrix multiplication accelerator. We show that Dolma incurs low overheads for large configurations.
  arXiv  Detail & Related papers  (2024-01-29T21:34:29Z)
• HasTEE+ : Confidential Cloud Computing and Analytics with Haskell [50.994023665559496]
  Confidential computing enables the protection of confidential code and data in a co-tenanted cloud deployment using specialized hardware isolation units called Trusted Execution Environments (TEEs) TEEs offer low-level C/C++-based toolchains that are susceptible to inherent memory safety vulnerabilities and lack language constructs to monitor explicit and implicit information-flow leaks. We address the above with HasTEE+, a domain-specific language (cla) embedded in Haskell that enables programming TEEs in a high-level language with strong type-safety.
  arXiv  Detail & Related papers  (2024-01-17T00:56:23Z)
• RAMP: A Flat Nanosecond Optical Network and MPI Operations for Distributed Deep Learning Systems [68.8204255655161]
  We introduce a near-exascale, full-bisection bandwidth, all-to-all, single-hop, all-optical network architecture with nanosecond reconfiguration called RAMP. RAMP supports large-scale distributed and parallel computing systems (12.8Tbps per node for up to 65,536 nodes.
  arXiv  Detail & Related papers  (2022-11-28T11:24:51Z)
• 1$\times$N Block Pattern for Network Sparsity [90.43191747596491]
  We propose one novel concept of $1times N$ block sparsity pattern (block pruning) to break this limitation. Our pattern obtains about 3.0% improvements over filter pruning in the top-1 accuracy of MobileNet-V2. It also obtains 56.04ms inference savings on Cortex-A7 CPU over weight pruning.
  arXiv  Detail & Related papers  (2021-05-31T05:50:33Z)

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.