Efficient authentication from hard learning problems
From MaRDI portal
Publication:1698400
DOI10.1007/s00145-016-9247-3zbMath1386.94096OpenAlexW2559932395MaRDI QIDQ1698400
Daniele Venturi, Eike Kiltz, David Cash, Abhishek Jain, Krzysztof Pietrzak
Publication date: 15 February 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://link.springer.com/article/10.1007/s00145-016-9247-3
Related Items
\texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption ⋮ Four heads are better than three
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On solving LPN using BKW and variants, Implementation and analysis
- HB-MP: a further step in the HB-family of lightweight authentication protocols
- Fast multiplication of large numbers
- Two-Round Man-in-the-Middle Security from LPN
- Faster Algorithms for Solving LPN
- Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- (Hierarchical) Identity-Based Encryption from Affine Message Authentication
- An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
- Subspace LWE
- Message Authentication, Revisited
- Zero-knowledge against quantum attacks
- Solving LPN Using Covering Codes
- Optimization of $$\mathsf {LPN}$$ Solving Algorithms
- Efficient Authentication from Hard Learning Problems
- Efficient noise-tolerant learning from statistical queries
- On the Amortized Complexity of Zero-Knowledge Protocols
- An Improved LPN Algorithm
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- On Ideal Lattices and Learning with Errors over Rings
- Efficient Lattice (H)IBE in the Standard Model
- Faster Integer Multiplication
- Parallel and Concurrent Security of the HB and HB + Protocols
- On the Security of HB# against a Man-in-the-Middle Attack
- Good Variants of HB + Are Hard to Find
- On the inherent intractability of certain coding problems (Corresp.)
- Templates for the Solution of Algebraic Eigenvalue Problems
- Lapin: An Efficient Authentication Protocol Based on Ring-LPN
- Public-key cryptosystems from the worst-case shortest vector problem
- Probability Inequalities for Sums of Bounded Random Variables
- Efficient Identity-Based Encryption Without Random Oracles
- Hardware Implementation and Side-Channel Analysis of Lapin
- Authenticating Pervasive Devices with Human Protocols
- : Increasing the Security and Efficiency of
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
