Time vs Success Probability Tradeoff for SVP and BDD with Implications to LWE and SIS eprint.iacr.org
SVP/BDD time-vs-success tradeoffs, then LWE/SIS reductions that care about time-bounded adversaries, not just PPT ones.
trending9
01 02 LaMS is a p-adic dual-attack framework for LWE with layered modulus switching, plus fresh cost estimates for Kyber. Cute theory, expensiv...03 Vitalik’s Part I walks through modern iO from FE to lattices, a recursive stack that’s still miles from practical obfuscation.04 When the Learning With Errors Problem Meets the Coherent Ising Machine: A Penalty-Free Algorithm-Hardware Co-Design arxiv.orgPaper on CIM-BDD, a penalty-free LWE-to-QUBO attack with a CIM demo on a 40-dim instance, because hardware theater.05 Generic NIZK-to-ZAP compiler, with new sometimes-constricting generators from DDH or LWE, so the old ad hoc tricks can retire.06 ePrint paper on pseudorandom codes from dense-planted LPN, plus first standard-model public-key CCA1 PRC, because parity checks were tired.07 Pushes secret-key and public-key codes to Shannon capacity against PPT channels, including CCA-secure and list-decoding variants.08 Can OMR beat PIR in practice? UnifOMR says yes, with batch PIR inside and the usual digest/round tax.09 On the Impossibility of SNARGs with Short CRS (or: Revisiting Gentry-Wichs Barrier in the Non-adaptive Setting) eprint.iacr.orgRevisits Gentry-Wichs and proves black-box SNARGs with sublinear CRS still hit a wall, even non-adaptively.