{
  "schema_version": 1,
  "builder_plan": {
    "scenario": "An agent reads external documents or tool responses that may contain malicious instructions.",
    "change": "Replay attacks and legitimate lookalikes in an isolated copy of your agent workflow.",
    "baseline": "Your existing checks with the same tasks, permissions, and tool responses.",
    "steps": [
      "Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.",
      "Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.",
      "Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.",
      "Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test."
    ],
    "measure": "Successful attacks missed, legitimate actions blocked, detection delay, and review cost.",
    "decision": "Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation."
  },
  "builder_review": null,
  "arxiv_id": "2609.15039",
  "title": "SpliTEE: Improving LLM Inference on Trusted Hardware with Differentially Private GPU Outsourcing",
  "summary": "Replaces running the full LLM inside a slow CPU-based trusted execution environment (or Slalom-style encrypted outsourcing) with a split architecture where privacy-sensitive computations run in the TEE and linear layers are outsourced to an untrusted GPU protected by differentially private noise calibrated via global sensitivity analysis. The costs are the DP noise (bounded by epsilon, with a derived floating-point error bound), a measured prompt-reconstruction risk of nearly 80% accuracy on unmasked intermediates if masking is omitted, and a hard dependency on Intel TDX-capable hardware plus a split-execution engineering stack. Adoption can fail because the reader lacks TDX hardware, the method only protects prompts against an untrusted inference provider (irrelevant when self-hosting on one's own GPU), and DP masking adds latency and potential accuracy degradation that must be validated per workload.",
  "rationale": "The technique addresses confidential inference on untrusted infrastructure and requires Intel TDX hardware the reader does not have, and a self-hosted 24 GB GPU already keeps prompts on-premise, so it is relevant to monitor but not adoptable in the reader's current production setting.",
  "technique": "Split TEE/GPU inference with differentially private masking",
  "family": "seguranca_e_guardrails",
  "recommendation": "observar",
  "published": "2026-09-14",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2609.15039",
  "independent_implementations": 0,
  "total_implementations": 0,
  "stars": 0,
  "citations": 0,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "Replaces running the full LLM inside a slow CPU-based trusted execution environment (or Slalom-style encrypted outsourcing) with a split architecture where privacy-sensitive computations run in the TEE and linear layers are outsourced to an untrusted GPU protected by differentially private noise calibrated via global sensitivity analysis. The costs are the DP noise (bounded by epsilon, with a derived floating-point error bound), a measured prompt-reconstruction risk of nearly 80% accuracy on unmasked intermediates if masking is omitted, and a hard dependency on Intel TDX-capable hardware plus a split-execution engineering stack. Adoption can fail because the reader lacks TDX hardware, the method only protects prompts against an untrusted inference provider (irrelevant when self-hosting on one's own GPU), and DP masking adds latency and potential accuracy degradation that must be validated per workload.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2609.15039",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "Split execution is nearly 2x faster than fully CPU-based inference inside Intel TDX and 5-15 seconds faster per run than encryption-based Slalom, while achieving higher accuracy; prompt reconstruction is bounded to no more information than an unrelated prompt.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2609.15039",
      "source_page": null,
      "source_excerpt": ""
    }
  ],
  "exposure_map": [
    {
      "dimension": "quality",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "compute",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "latency",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "operations",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "compatibility",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "security",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "data_and_training",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "reproducibility",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    }
  ],
  "risks": [],
  "minimum_test": [],
  "open_questions": [],
  "independent_tests": [],
  "lab_reproductions": [],
  "report_available": false,
  "validation_tier": "unknown",
  "evidence_tier": "unknown",
  "infrastructure_basis": "unknown",
  "equations": [
    {
      "anchor": "S4.E1",
      "label": "(1)",
      "section": "4 Threat Model and Proposed System Architecture",
      "role": "proposed_method",
      "latex": "\\mathbf{r}-W\\bm{\\eta}=(W\\mathbf{x}+W\\bm{\\eta})-W\\bm{\\eta}=W\\mathbf{x}",
      "mathml": "<math display=\"block\"><mrow><mrow><mi>𝐫</mi><mo>−</mo><mrow><mi>W</mi><mo lspace=\"0em\" rspace=\"0em\">​</mo><mi>𝜼</mi></mrow></mrow><mo>=</mo><mrow><mrow><mo stretchy=\"false\">(</mo><mrow><mrow><mi>W</mi><mo lspace=\"0em\" rspace=\"0em\">​</mo><mi>𝐱</mi></mrow><mo>+</mo><mrow><mi>W</mi><mo lspace=\"0em\" rspace=\"0em\">​</mo><mi>𝜼</mi></mrow></mrow><mo stretchy=\"false\">)</mo></mrow><mo>−</mo><mrow><mi>W</mi><mo lspace=\"0em\" rspace=\"0em\">​</mo><mi>𝜼</mi></mrow></mrow><mo>=</mo><mrow><mi>W</mi><mo lspace=\"0em\" rspace=\"0em\">​</mo><mi>𝐱</mi></mrow></mrow></math>",
      "context": "Now the TEE generates the noise vector, masks the input and hands over the masked input <math display=\"inline\"><mover accent=\"true\"><mi>𝐱</mi><mo>^</mo></mover></math> to the GPU. The GPU can multiply it with the matrix <math display=\"inline\"><mi>W</mi></math> to obtain the quantity above, and return the result <math display=\"inline\"><mi>𝐫</mi></math> back to the TEE. The TEE can then straightforwardly compute",
      "headline": "",
      "explanation": "",
      "objective": "",
      "symbols": {},
      "evidence": "",
      "evidence_url": "",
      "source_url": ""
    },
    {
      "anchor": "S3.Ex12",
      "label": "",
      "section": "3 Background",
      "role": "complexity",
      "latex": "\\Delta f=\\max_{\\mathbf{x},\\mathbf{y}\\in\\mathbb{R}^{d}}\\lVert{f(\\mathbf{x})-f(\\mathbf{y})}\\rVert_{2}",
      "mathml": "<math display=\"block\"><mrow><mrow><mi mathvariant=\"normal\">Δ</mi><mo lspace=\"0em\" rspace=\"0em\">​</mo><mi>f</mi></mrow><mo>=</mo><mrow><munder><mi>max</mi><mrow><mrow><mi>𝐱</mi><mo>,</mo><mi>𝐲</mi></mrow><mo>∈</mo><msup><mi>ℝ</mi><mi>d</mi></msup></mrow></munder><mo lspace=\"0em\">⁡</mo><msub><mrow><mo fence=\"true\" rspace=\"0em\">∥</mo><mrow><mrow><mi>f</mi><mo>⁡</mo><mrow><mo stretchy=\"false\">(</mo><mi>𝐱</mi><mo stretchy=\"false\">)</mo></mrow></mrow><mo>−</mo><mrow><mi>f</mi><mo>⁡</mo><mrow><mo stretchy=\"false\">(</mo><mi>𝐲</mi><mo stretchy=\"false\">)</mo></mrow></mrow></mrow><mo fence=\"true\" lspace=\"0em\">∥</mo></mrow><mn>2</mn></msub></mrow></mrow></math>",
      "context": "Let <math display=\"inline\"><mrow><mi>f</mi><mo lspace=\"0.278em\" rspace=\"0.278em\">:</mo><mrow><msup><mi>ℝ</mi><mi>d</mi></msup><mo stretchy=\"false\">→</mo><msup><mi>ℝ</mi><mi>d</mi></msup></mrow></mrow></math> be a function.1313 13 From here onwards, we use the symbol <math display=\"inline\"><mi>f</mi></math> to denote different functions, as we no longer need to refer to <math display=\"inline\"><mi>f</mi></math>-DP Then its global <math display=\"inline\"><msub><mi mathvariant=\"normal\">ℓ</mi><mn>2</mn></msub></math>-sensitivity, denoted <math display=\"inline\"><mrow><mi mathvariant=\"normal\">Δ</mi><mo lspace=\"0em\" rspace=\"0em\">​</mo><mi>f</mi></mrow></math>, is defined as",
      "headline": "",
      "explanation": "",
      "objective": "",
      "symbols": {},
      "evidence": "",
      "evidence_url": "",
      "source_url": ""
    },
    {
      "anchor": "S3.Ex11",
      "label": "",
      "section": "3 Background",
      "role": "metric",
      "latex": "T(\\mathcal{M}(X_{1}),\\mathcal{M}(X_{2}))\\geq G_{\\epsilon}",
      "mathml": "<math display=\"block\"><mrow><mrow><mi>T</mi><mo>⁡</mo><mrow><mo stretchy=\"false\">(</mo><mrow><mi>ℳ</mi><mo>⁡</mo><mrow><mo stretchy=\"false\">(</mo><msub><mi>X</mi><mn>1</mn></msub><mo stretchy=\"false\">)</mo></mrow></mrow><mo>,</mo><mrow><mi>ℳ</mi><mo>⁡</mo><mrow><mo stretchy=\"false\">(</mo><msub><mi>X</mi><mn>2</mn></msub><mo stretchy=\"false\">)</mo></mrow></mrow><mo stretchy=\"false\">)</mo></mrow></mrow><mo>≥</mo><msub><mi>G</mi><mi>ϵ</mi></msub></mrow></math>",
      "context": "A mechanism <math display=\"inline\"><mi>ℳ</mi></math> is said to satisfy <math display=\"inline\"><mi>ϵ</mi></math>-Gaussian Differential Privacy (<math display=\"inline\"><mi>ϵ</mi></math>-GDP) if it is <math display=\"inline\"><msub><mi>G</mi><mi>ϵ</mi></msub></math>-DP. That is,",
      "headline": "",
      "explanation": "",
      "objective": "",
      "symbols": {},
      "evidence": "",
      "evidence_url": "",
      "source_url": ""
    }
  ],
  "equations_status": "selected",
  "core_kind": "formula",
  "equations_fetched_at": "2026-10-04",
  "equations_source_url": "",
  "equations_source_sha256": "",
  "exposures_reviewed_at": "",
  "exposures_source_sha256": ""
}