cập nhật 28 phút trước

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

23
A Little Advice Suffices: Diffie-Hellman Is as Hard as Discrete Logarithm
📄 Paper arXiv cs.CR 1 ngày trước

arXiv:2611.22290v1 Announce Type: cross Abstract: Is computing a Diffie-Hellman key as hard as computing a discrete logarithm? Maurer showed that it is, given a few bits of advice, provided that short intervals contain enough integers with only small prime factors; that proviso …

🅲 hạng C
21
A Bleichenbacher bit-by-bit oracle attack from partial message knowledge
📄 Paper arXiv cs.CR 2 ngày trước

arXiv:2611.20277v1 Announce Type: new Abstract: Oracle attacks show the importance of a correct implementation of cryptographic standards when translated into code. A notable example is the Bleichenbacher attack on RSA with PKCS#1 v1.5 padding and all the improvements that have …

🅲 hạng C
20
Incrementally Verifiable Oracle Aided Computation
📄 Paper arXiv cs.CR 6 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