Efficient authentication from hard learning problems
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1350351 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 2081058 (Why is no real title available?)
- (Hierarchical) identity-based encryption from affine message authentication
- : Increasing the Security and Efficiency of
- An Improved LPN Algorithm
- An efficient pseudo-random generator provably as secure as syndrome decoding
- Authenticating Pervasive Devices with Human Protocols
- Efficient Authentication from Hard Learning Problems
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient lattice (H)IBE in the standard model
- Efficient noise-tolerant learning from statistical queries
- Fast multiplication of large numbers
- Faster algorithms for solving LPN
- Faster integer multiplication
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Good Variants of HB + Are Hard to Find
- HB-MP: a further step in the HB-family of lightweight authentication protocols
- Hardware implementation and side-channel analysis of Lapin
- Lapin: an efficient authentication protocol based on ring-LPN
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- Man-in-the-middle secure authentication schemes from LPN and weak PRFs
- Message authentication, revisited
- Noise-tolerant learning, the parity problem, and the statistical query model
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On solving LPN using BKW and variants, Implementation and analysis
- On the Amortized Complexity of Zero-Knowledge Protocols
- On the Security of HB# against a Man-in-the-Middle Attack
- On the inherent intractability of certain coding problems (Corresp.)
- Optimization of \(\mathsf {LPN}\) solving algorithms
- Parallel and Concurrent Security of the HB and HB + Protocols
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
- Probability Inequalities for Sums of Bounded Random Variables
- Public-key cryptosystems from the worst-case shortest vector problem
- Solving LPN Using Covering Codes
- Subspace LWE
- Templates for the Solution of Algebraic Eigenvalue Problems
- Two-round man-in-the-middle security from LPN
Cited in
(11)- Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise
- Man-in-the-middle secure authentication schemes from LPN and weak PRFs
- Lapin: an efficient authentication protocol based on ring-LPN
- Cryptography from learning parity with noise
- \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption
- Post-quantum provably-secure authentication and MAC from Mersenne primes
- Efficient Authentication from Hard Learning Problems
- Four heads are better than three
- Two-round man-in-the-middle security from LPN
- Hardware implementation and side-channel analysis of Lapin
- On the security proof of an authentication protocol from Eurocrypt 2011
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 Q1698400)
