cập nhật 1 giờ trước

⏱ Độ trễ thật của tab này: trung bình 6.9 giờ sau khi CVE được công bố (n = 5194, sớm nhất 0.1 giờ). Số âm nghĩa là ta thấy trước ngày công bố.

26
When Shuffling Fails: Token Recovery from Obfuscated KV Caches
📄 Paper arXiv cs.CR 17 giờ trước

arXiv:2611.24276v1 Announce Type: new Abstract: LLM serving systems store, offload, and share KV caches, exposing token-level representations to infrastructure operators and co-tenants. Shuffled obfuscation combines secret linear transforms with fresh permutations, claiming secu…

🅲 hạng C
24
Asymmetric Optical Image Watermarking
📄 Paper arXiv cs.CR 17 giờ trước

arXiv:2611.23350v1 Announce Type: new Abstract: Watermark detectors held by a provider cannot be checked by third parties, and a party that can detect a mark can usually also forge it. We study a two-layer image watermark in which the Fourier transform at the core of the pipelin…

🅲 hạng C
23
Look It Up: Multi-bit LLM Watermarking via Codebook Search
📄 Paper arXiv cs.CR 6 ngày trước

arXiv:2611.16890v1 Announce Type: new Abstract: Attributing short LLM-generated texts to a specific source remains challenging for existing multi-bit watermarking methods, which often require long generations or costly decoding to recover payloads reliably. We propose a codebook…

🅲 hạng C
21
VellSSLH: Sound Type-Guided Selective Speculative Load Hardening for LLVM IR
📄 Paper arXiv cs.CR 3 ngày trước

arXiv:2611.18463v1 Announce Type: new Abstract: Constant-time cryptographic programs written in C can still leak secrets during speculative execution. Mispredicted branches may allow instructions to access secret data and expose it through observable behavior. Speculative load h…

🅲 hạng C
20
Your Secrets Are Showing: Deep Image Hiding Models Are Surprisingly Easy to Attack
📄 Paper arXiv cs.CR 6 ngày trước

arXiv:2611.15583v1 Announce Type: new Abstract: In this work, we ask whether an attacker can go beyond detecting a hidden image and tell what it depicts, even without knowing which model hid it. We show that, for deep image hiding, this is surprisingly easy. To test this, we bui…

🅲 hạng C
20
SEC: One-Share Everywhere-Short Secret Sharing from Lossless Expanders
📄 Paper arXiv cs.CR 6 ngày trước

arXiv:2611.16244v1 Announce Type: new Abstract: We introduce SEC, an expander-code-based ramp secret sharing scheme over $\mathbb{Z}$-modules, particularly suitable for lattice-based distributed cryptography. It is everywhere-short: bounded secret coefficients yield bounded shar…

🅲 hạng C