Worst-case hardness for LPN and cryptographic hashing via code smoothing
From MaRDI portal
Publication:2292709
DOI10.1007/978-3-030-17659-4_21OpenAlexW2798359482MaRDI QIDQ2292709
Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs, Zvika Brakerski
Publication date: 4 February 2020
Full work available at URL: https://hdl.handle.net/1721.1/137866.2
Related Items
Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN, Anonymous IBE, leakage resilience and circular security from new assumptions, On the complexity of collision resistant hash functions: new and old black-box separations, New constructions of collapsing hashes, Statistically sender-private OT from LPN and derandomization, Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN, Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
