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

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

23
Look It Up: Multi-bit LLM Watermarking via Codebook Search
📄 Paper arXiv cs.CR 3 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
Incrementally Verifiable Oracle Aided Computation
📄 Paper arXiv cs.CR 3 ngày trước

arXiv:2611.14698v1 Announce Type: new Abstract: Incrementally verifiable computation (IVC) allows a prover to maintain a short proof that can be efficiently updated after each computation step, without retaining or recomputing the preceding execution. Standard IVC schemes do not…

🅲 hạng C
21
SEC: One-Share Everywhere-Short Secret Sharing from Lossless Expanders
📄 Paper arXiv cs.CR 3 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
21
Batch, Pack, and Prove: More Efficient Verifiable Computation for CKKS
📄 Paper arXiv cs.CR 3 ngày trước

arXiv:2611.16922v1 Announce Type: new Abstract: An important challenge in homomorphic encryption (HE) is ensuring the integrity of the encrypted computations. Although verifiable computation can address this in theory, making it practical is far from trivial. [Cascudo et al. CRY…

🅲 hạng C