Search: “Temporal”

9 stories in the last 30d

An event-native spike encoding framework lets recurrent spiking neural networks run intrusion detection directly on heterogeneous packet and CAN bus streams.

The paper maps heterogeneous cyber events—categorical identifiers, local frequency context, and inter-event timing—directly into sparse spike-compatible inputs for spiking neural networks. This avoids flow aggregation and fixed windows that add buffering latency and obscure temporal structure in traditional IDS pipelines. Compact recurrent SNNs under edge-oriented neuromorphic hardware constraints achieve a hybrid anomaly metric of 0.987 on packet-level Network IDS and 0.980 on message-level CAN IDS.

arXiv cs.CRSep 14, 15:55 UTC · 2d agoResearch1

CHERI-D Reincarnate: efficient multicore CHERI temporal memory safety through allocation reincarnation (draft version)

CHERI-D Reincarnate adds allocation reincarnation to CHERI, quarantining generation IDs instead of memory to cut temporal memory-safety overheads on multicore systems.

The proposal extends CHERI-D temporal memory safety by quarantining exhausted generation IDs rather than memory slots, allowing freed memory immediate reuse through allocation reincarnation. It adds coherent ID caching and multicore support connecting physical coherence events to the virtually addressed ObjID buffer. The design was implemented as a hardware-software co-design across CHERI-Toooba FPGA softcore, QEMU, LLVM/Clang, and CheriBSD. Across evaluated workloads it substantially reduces memory-sweep frequency and quarantine overhead with low performance and hardware cost.

arXiv cs.CRSep 10, 14:19 UTC · 6d agoResearch

When Agents Look Like Beacons: NIDS Evasion by Model Context Protocol Traffic

Research shows Model Context Protocol agent traffic structurally resembles C2 beaconing and evades Suricata signatures and RITA behavioral scoring in testbeds.

An arXiv study demonstrates that Model Context Protocol (MCP) JSON-RPC traffic over Streamable HTTP mimics the polling patterns of C2 frameworks like Cobalt Strike and is not flagged as anomalous by standard enterprise defenses. In a Docker testbed with eleven traffic profiles across three TLS conditions, Suricata with the Emerging Threats Open ruleset produced near-zero alerts and RITA assigned a consistent 0.0 beacon score, regardless of jitter or TLS inspection. The authors propose an agent-native network indication standard using Agent-Native ALPN and out-of-band headers.

arXiv cs.CRSep 16, 17:27 UTC · 17h agoResearch1

Towards Standardized Evaluation of GPU Memory Safety with GMSBench

GMSBench provides 149 CUDA tests covering spatial, temporal, and concurrency GPU memory errors, exposing detection gaps in Compute Sanitizer.

GMSBench is a GPU memory safety benchmark comprising 149 self-contained CUDA tests spanning spatial, temporal, and concurrency errors across different GPU memory spaces and execution scenarios. The authors evaluate NVIDIA's Compute Sanitizer across multiple GPU architectures using the suite, exposing gaps in its detection coverage. The benchmark offers a standardized foundation for comparative evaluation of GPU memory safety mechanisms.

arXiv cs.CRSep 8, 15:11 UTC · 8d agoResearch

Differential Trust: Dynamic Multi-Authority Anonymous Credentials with Epoch-Weighted Updates

Researchers propose MA-ACEW, the first multi-authority anonymous credential model with epoch-weighted issuance and efficient cross-epoch credential updates.

The paper introduces MA-ACEW, a multi-authority anonymous credential scheme that weights authorities differently during credential issuance, targeting decentralized systems such as Proof-of-Stake networks. Its core primitive, Epoch-Bound Pointcheval-Sanders Signatures (EB-PS), binds signatures to time epochs, enabling non-interactive credential updates when authority weight distributions change. The authors formalize EUF-eCMA unforgeability and prove unforgeability, anonymity, and blindness under a novel STB-GPS assumption. Aggregating a credential from 128 partial credentials takes about 10.68 ms on average.

arXiv cs.CRSep 16, 15:21 UTC · 19h agoResearch

Autonomy in Check: Governor-Mediated Adaptive Security at the Edge

Split-control architecture adds a deterministic governor to validate LLM and rule-based planner intents before eBPF enforcement at the edge.

Researchers propose a split-control edge security architecture in which an untrusted planner emits typed security intents that a deterministic governor checks against safety, resource, temporal-stability, and proportionality invariants. Admitted actions are bound to signed receipts and compiled into pre-installed eBPF map updates. A Raspberry Pi 5 prototype on a university 5G test network admitted, rejected, and bounded intents at microsecond cost.

arXiv cs.CRSep 16, 09:00 UTC · 1d agoResearch

FST Pay: Deterministic Safety-Gated Architecture for Youth Digital Payments

FST Pay proposes a deterministic safety-gated architecture for teen digital payments, pairing invariant authorization checks with decoupled post-settlement AI explanations.

Researchers propose FST Pay, a formal architecture for adolescent digital payments on rails like UPI that applies six deterministic invariant checks (spending limits, guardian co-sign policies, amount thresholds, merchant category codes, temporal intervals, hardware integrity) to classify transactions as ALLOW, REVIEW, or BLOCK. High-risk transactions trigger an asynchronous guardian co-sign workflow. Generative AI is restricted to post-settlement natural-language insights and holds no mutation privileges over the ledger, avoiding non-determinism on the real-time authorization path.

arXiv cs.CRSep 10, 08:03 UTC · 7d agoResearch

Has anybody seen my keys? A key-hierarchy strategy for rack-level security

Oxide's RFD 0301 proposes a rack-level key hierarchy using Shamir secret sharing and a trust quorum to protect data-at-rest keys.

Oxide's request for discussion (RFD 0301) lays out a key-hierarchy strategy for rack-level security, deriving keys from a rack secret protected by Shamir secret sharing across a trust quorum of sleds, with keys exchanged over authenticated sprockets sessions. The document maps which keys protect control-plane data, metrics, Crucible extents, and authentication tokens, and defines open questions on key lifecycle, locality, and compromise handling. Future work includes sealing shares with the root of trust so an attacker would need to steal K whole sleds to reconstruct the rack secret.

Hacker News · securitySep 7, 02:14 UTC · 10d agoResearch HN 52↑ · 3 comments

Researchers built a $7 gadget for anyone paranoid about hidden cameras in hotel rooms

KAIST-led researchers built SweepLED, a sub-$7 smartphone LED clip using AI to detect hidden cameras with 93.9-95.1% accuracy.

SweepLED, built by KAIST with the National University of Singapore and Singapore Management University, clips 15 LEDs to a smartphone camera and sweeps multi-angle light while the phone films reflections. A spatio-temporal AI model compares LED-on and LED-off frames to distinguish lens reflections from glossy surfaces across three viewpoints. Testing on 30 objects, 12 with hidden cameras, achieved 93.9% accuracy handheld and 95.1% static. Core components cost under $7, targeting privacy checks in hotels and short-term rentals.

Help Net SecuritySep 3, 00:00 UTC · 14d agoResearch1