Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs
From MaRDI portal
Publication:2849403
DOI10.1007/978-3-642-40084-1_18zbMath1316.94102OpenAlexW162790823MaRDI QIDQ2849403
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
weak pseudorandom function3-round symmetric-key authentication protocollearning parity with noise (LPN) problem
Related Items (15)
On solving LPN using BKW and variants, Implementation and analysis ⋮ Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions ⋮ Optimization of $$\mathsf {LPN}$$ Solving Algorithms ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Efficient authentication from hard learning problems ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice ⋮ Two-Round Man-in-the-Middle Security from LPN ⋮ 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 ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ From non-adaptive to adaptive pseudorandom functions ⋮ Towards efficient LPN-based symmetric encryption
Uses Software
This page was built for publication: Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs
