Pages that link to "Item:Q3003371"
From MaRDI portal
The following pages link to Efficient Authentication from Hard Learning Problems (Q3003371):
Displaying 14 items.
- On solving LPN using BKW and variants, Implementation and analysis (Q276557) (← links)
- Programmable hash functions and their applications (Q434345) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- A protocol for provably secure authentication of a tiny entity to a high performance computing one (Q1793779) (← links)
- Towards efficient LPN-based symmetric encryption (Q2117050) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Authentication in the bounded storage model (Q2170109) (← links)
- Solving LPN using covering codes (Q2303453) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- Two-Round Man-in-the-Middle Security from LPN (Q2796127) (← links)
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589) (← links)
- Cryptography from Learning Parity with Noise (Q2891361) (← links)
- Optimization of $$\mathsf {LPN}$$ Solving Algorithms (Q2958144) (← links)
- An iterative correction method for practically LPN solving (Q6576954) (← links)
