Worst-case hardness for LPN and cryptographic hashing via code smoothing
From MaRDI portal
Publication:2292709
DOI10.1007/978-3-030-17659-4_21OpenAlexW2798359482MaRDI QIDQ2292709FDOQ2292709
Authors: Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs 
Publication date: 4 February 2020
Full work available at URL: https://hdl.handle.net/1721.1/137866.2
Recommendations
Cited In (16)
- The hardness of LPN over any integer ring and field for PCG applications
- An iterative correction method for practically LPN solving
- Cryptography from planted graphs: security with logarithmic-size messages
- Combinatorially homomorphic encryption
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application
- Statistically sender-private OT from LPN and derandomization
- Collision resistant hashing from sub-exponential learning parity with noise
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- On the complexity of collision resistant hash functions: new and old black-box separations
- New constructions of collapsing hashes
- Lossy cryptography from code-based assumptions
- Non-interactive zero-knowledge from LPN and MQ
This page was built for publication: Worst-case hardness for LPN and cryptographic hashing via code smoothing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292709)
