Indistinguishability Obfuscation from Bilinear Maps and LPN Variants
S Ragavan, N Vafa, V Vaikuntanathan - Cryptology ePrint Archive, 2024 - eprint.iacr.org
We construct an indistinguishability obfuscation (IO) scheme from the sub-exponential
hardness of the decisional linear problem on bilinear groups together with two variants of …
hardness of the decisional linear problem on bilinear groups together with two variants of …
Smoothing Linear Codes by R\'enyi Divergence and Applications to Security Reduction
H Yan, C Ling - arXiv preprint arXiv:2405.10124, 2024 - arxiv.org
The concept of the smoothing parameter plays a crucial role in both lattice-based and code-
based cryptography, primarily due to its effectiveness in achieving nearly uniform …
based cryptography, primarily due to its effectiveness in achieving nearly uniform …