Man-in-the-middle secure authentication schemes from LPN and weak PRFs
From MaRDI portal
Publication:2849403
Recommendations
Cited in
(17)- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
- On solving LPN using BKW and variants, Implementation and analysis
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- Towards efficient LPN-based symmetric encryption
- Efficient authentication from hard learning problems
- Optimization of \(\mathsf {LPN}\) solving algorithms
- From non-adaptive to adaptive pseudorandom functions
- Two-round man-in-the-middle security from LPN
- An iterative correction method for practically LPN solving
- Efficient Shared-Key Authentication Scheme from Any Weak Pseudorandom Function
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Correlated pseudorandomness from expand-accumulate codes
- Non-interactive secure computation of inner-product from LPN and LWE
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- A protocol for provably secure authentication of a tiny entity to a high performance computing one
- Leakage-resilient cryptography over large finite fields: theory and practice
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
This page was built for publication: Man-in-the-middle secure authentication schemes from LPN and weak PRFs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849403)