Security papers — 2026-10-22

The focus today is on protecting intellectual property in large language models because adversaries can create copies by training surrogate versions from input output pairs. The most important work here is SAFESEAL, which introduces a new key-conditioned watermarking framework designed to be easily detectable while causing little harm to the model's usefulness. This method works by replacing words with context-aware synonyms using a key-conditioned Tournament sampling mechanism, which helps keep the meaning and facts consistent.

This approach improves on previous methods because it solves problems with semantic distortion found in existing techniques. For example, SAFESEAL achieves a BERTScore of 0.983 and an entity similarity of 0.963, along with a high detection rate of 98.2 percent, which is much better than other methods while keeping the speed similar to the fastest available tools. Furthermore, this framework includes a key-conditioned contrastive detector for verification, which allows for provider-specific and strong watermark checking across different situations.

Another concern involves how models use memory when interacting with tools; specifically, memory-induced tool-drift shows that personality preferences stored in long-term memory can silently change tool call parameters, which significantly lowers performance. This is studied through MEMDRIFT, a benchmark that measures excess parameter degradation ranging from 0.38 to 0.83 when biased memories are present compared to neutral ones, showing that these biases act as hidden directions away from the task's relevant context.

Finally, efforts are being made to secure specialized models in specific fields; VertMark proposes a unified training-free and robust watermarking framework for copyright verification across different pre-trained language models like those used in medicine or finance. This framework embeds ownership-encoded watermarks by creating a hidden semantic link between trigger tokens and domain-specific words, demonstrating reliable verification with little effect on subsequent tasks.

A major development is making garbling of boolean circuits cheaper while keeping privacy intact, which is important for real applications. AuthOr achieves this by combining information-theoretic garbling ideas with an improved half-gate approach, resulting in a lower communication cost than existing methods like HG garbling without needing extra security assumptions. Experimental results show that this scheme can reduce the garbled circuit size by nearly ninety-eight percent in practice.

This efficiency gain matters because it directly affects the overhead needed when implementing privacy-preserving computations on hardware. This improvement builds on earlier work where privacy-free garbling schemes were designed to meet only authenticity criteria, as seen in AKMPC. Moreover, this work uses techniques from information-theoretic garbling developed by Kondi and Patra in AKMPC to achieve its lower cost structure.

Another area of concern is securing real-time control systems against timing attacks, which is vital for safety-critical networks like CAN. The work Hide-n-Seek proposes a schedule obfuscation strategy that skips control task executions and randomly shifts the victim task instance to remove timing side channels that attackers exploit for denial-of-service or man-in-the-middle attacks. This strategy is shown to reduce the attack success probability when applied to synthesized automotive task sets in a hardware setup.

This idea of intentionally skipping has wider implications for securing control loops, as explored in Skip to Secure, which offers a principled way to skip control loop executions as a defense against stealthy attacks that violate message integrity and authenticity. This approach is also relevant because it helps lower the resource consumption of cryptographic measures in CAN-based automotive cyber-physical systems without sacrificing performance or safety.

Today's papers

The papers

Important terms

SAFESEAL
A new key-conditioned watermarking framework that replaces words with context-aware synonyms using a tournament sampling mechanism to detect copies while preserving model usefulness.
MEMDRIFT
A benchmark that measures how much performance degrades when models use biased long-term memories, showing hidden directions away from the task's original context.
VertMark
A training-free and robust watermarking framework designed to verify copyright across different specialized language models, embedding ownership links via trigger tokens.
AuthOr
A method combining information-theoretic garbling with an improved half-gate approach to make garbling boolean circuits cheaper and reduce communication costs for privacy.
Hide-n-Seek
A schedule obfuscation strategy for real-time control systems that skips task executions and randomly shifts instances to remove timing side channels exploited by attackers.