Efficient Authentication from Hard Learning Problems

DOI10.1007/978-3-642-20465-4_3MaRDI QIDQ3003371zbMATH OpenOpenAlexWikidataFDO

Authors Eike Kiltz, Krzysztof Pietrzak, David Cash, Abhishek Jain, D. Venturi

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

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient authentication from hard learning problems
• Approximate-deterministic public key encryption from hard learning problems
• scientific article; zbMATH DE number 1088919
• scientific article; zbMATH DE number 5670521
• scientific article; zbMATH DE number 177041
• Authentication, identification and pairwise separated measures
• Practical human-machine identification over insecure channels
• Information Security and Cryptology - ICISC 2005
• scientific article; zbMATH DE number 1024063

Cited in

(23)

• Optimization of \(\mathsf {LPN}\) solving algorithms
• On solving LPN using BKW and variants, Implementation and analysis
• Towards efficient LPN-based symmetric encryption
• An iterative correction method for practically LPN solving
• Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise
• Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
• Programmable hash functions and their applications
• Man-in-the-middle secure authentication schemes from LPN and weak PRFs
• Lapin: an efficient authentication protocol based on ring-LPN
• Slightly sublinear trapdoor hash functions and PIR from low-noise LPN
• Solving LPN using covering codes
• Statistically sender-private OT from LPN and derandomization
• A protocol for provably secure authentication of a tiny entity to a high performance computing one
• Cryptography from learning parity with noise
• Authentication in the bounded storage model
• A lightweight identification protocol based on lattices
• Post-quantum provably-secure authentication and MAC from Mersenne primes
• Efficient authentication from hard learning problems
• Two-round man-in-the-middle security from LPN
• Hardware implementation and side-channel analysis of Lapin
• Worst-case to average-case reductions for module lattices
• On the security proof of an authentication protocol from Eurocrypt 2011
• Cryptography with auxiliary input and trapdoor from constant-noise LPN

Describes a project that uses

Uses Software

• HB-MP

This page was built for publication: Efficient Authentication from Hard Learning Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003371)