Efficient Authentication from Hard Learning Problems
From MaRDI portal
Publication:3003371
DOI10.1007/978-3-642-20465-4_3zbMath1281.94083OpenAlexW2125903279WikidataQ59163696 ScholiaQ59163696MaRDI QIDQ3003371
Daniele Venturi, Krzysztof Pietrzak, Eike Kiltz, David Cash, Abhishek Jain
Publication date: 27 May 2011
Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_3
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 ⋮ Cryptography from Learning Parity with Noise ⋮ Authentication in the bounded storage model ⋮ A lightweight identification protocol based on lattices ⋮ Optimization of $$\mathsf {LPN}$$ Solving Algorithms ⋮ Statistically sender-private OT from LPN and derandomization ⋮ Efficient authentication from hard learning problems ⋮ Programmable hash functions and their applications ⋮ 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 ⋮ Solving LPN using covering codes ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ Worst-case to average-case reductions for module lattices ⋮ Towards efficient LPN-based symmetric encryption
Uses Software
This page was built for publication: Efficient Authentication from Hard Learning Problems
