Case · DiggingBeagle record

Signed facts and private lookup in experimental multi-agent knowledge retrieval

Researchers combine signed symbolic facts, local rule inference and private retrieval, separating authenticity, factual correctness and query privacy.

Scope

A single-laptop prototype with 99 facts and rules, 46 index entries, 18 queries and simulated privacy protocols, not an Internet-scale deployment.

Assessment profile

Assessment method
Setting
simulation
Exploitation
not established
Evidence
Grade C
Remediation
not applicable
AI role
AGAINST AI
Basis and provenance

The laptop simulation shows modest query overhead for two-server PIR, while real noncollusion, revocation and factual correctness remain untested. Classified as simulation with exploit status not_established. Evidence grade C reflects the original paper or maintainer advisory and its stated limitations, not an independent audit of all deployments. Comparable realized harm is not established, so impact stays unrated; remediation status not_applicable is limited to the cited experiment or affected software version. New source-specific boundary: Noncollusion and query-frequency leakage require independent operational tests; signing a false statement faithfully does not make its content true.

Assessed Nov 15, 2026 using diggingbeagle.assessment/1.

At a glance

Mechanism and trust boundary

  1. 01

    Entry or starting condition

    A multi-agent application needs externally supplied symbolic facts or Horn-style inference rules without revealing every requested predicate.

    Boundary: attacker or research precondition

  2. 02

    Crossing the relevant boundary

    Agents validate publisher signatures and retrieve indexed entries with direct, bucket, decoy or two-server PIR lookup before caching them locally.

    Boundary: mechanism and authorization boundary

  3. 03

    Observed or reported result

    The laptop simulation shows modest query overhead for two-server PIR, while real noncollusion, revocation and factual correctness remain untested.

    Boundary: measured outcome and evidentiary limit

Claims & evidence

CLM-ENR250-15In the proposed private lookup design, a single-server k-anonymity mode adds decoy requests but repeated deterministic buckets may still reveal lookup patterns. Its stronger two-server XOR PIR mode assumes the two stores do not collude and incurs communication over the replicated index. These privacy properties are distinct from the separate verification of signed fact provenance.supported

Basis: reported finding

Link to claim
CLM-R245-SIGNED-PRIVATE-AGENT-MEMORY-01On the authors' 18-query suite, uncached two-server PIR averaged about 0.223 seconds versus 0.178 seconds for plain retrieval, while a cached request removed the need to contact the store.supported

Basis: reported finding

Link to claim
CLM-R245-SIGNED-PRIVATE-AGENT-MEMORY-02Agents verify signed predicate and rule records before caching; lookup can use grouped buckets, k-anonymous decoys or a two-server XOR private-information-retrieval protocol that assumes the servers do not collude.supported

Basis: reported finding

Link to claim
CLM-R246-SIGNED-PRIVATE-AGENT-MEMORY-BOUNDARYThe prototype measured two-server PIR at roughly 0.223 seconds versus 0.178 seconds for direct retrieval on an 18-query laptop suite; the two-server privacy property assumes that the replicated servers do not collude, while signing authenticates an issuer rather than claim truth.supported

Basis: reported finding

Link to claim

Unknowns and contradictions

  • A cryptographic signature identifies a signing authority, not the truth of its assertion. The single-machine simulation does not establish real noncollusion, revocation behavior or large-scale poisoning resistance.
  • No evidence here establishes the number of production victims or a broader failure rate outside the cited evaluation.

Sources and citation

Material revision history

  1. Nov 15, 2026 · Canonical change recorded · new in release · revision 251