Our paper (with Kamil Doruk Gur) “Verifiable Oblivious Pseudorandom Functions from Lattices: Practical-ish and Thresholdisable” is now available on ePrint and will appear at Asiacrypt 2024. Doruk and I started working on this together when he did his residency at SandboxAQ. Here’s the abstract: We revisit the lattice-based verifiable oblivious PRF construction from PKC’21 and … Continue reading Verifiable Oblivious Pseudorandom Functions from Lattices: Practical-ish and Thresholdisa...| malb::blog
The ``learning with errors'' (LWE) problem is to distinguish random linear equations, which have been perturbed by a small amount of noise, from truly uniform ones. The problem has been shown to be as hard as worst-case lattice problems, and in recent years it has served as the foundation for a plethora of cryptographic applications. Unfortunately, these applications are rather inefficient due to an inherent quadratic overhead in the use of LWE. A main open question was whether LWE and its ap...| IACR Cryptology ePrint Archive