Man-in-the-middle secure authentication schemes from LPN and weak PRFs
From MaRDI portal
Publication:2849403
DOI10.1007/978-3-642-40084-1_18zbMATH Open1316.94102OpenAlexW162790823MaRDI QIDQ2849403FDOQ2849403
Authors: Vadim Lyubashevsky, Daniel Masny 
Publication date: 17 September 2013
Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40084-1_18
Recommendations
weak pseudorandom function3-round symmetric-key authentication protocollearning parity with noise (LPN) problem
Cited In (17)
- Optimization of \(\mathsf {LPN}\) solving algorithms
- Non-interactive secure computation of inner-product from LPN and LWE
- On solving LPN using BKW and variants, Implementation and analysis
- An iterative correction method for practically LPN solving
- Leakage-resilient cryptography over large finite fields: theory and practice
- Towards efficient LPN-based symmetric encryption
- From non-adaptive to adaptive pseudorandom functions
- Correlated pseudorandomness from expand-accumulate codes
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- Efficient Shared-Key Authentication Scheme from Any Weak Pseudorandom Function
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- A protocol for provably secure authentication of a tiny entity to a high performance computing one
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
- Efficient authentication from hard learning problems
- Two-round man-in-the-middle security from LPN
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
Uses Software
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)
