Two-Round Man-in-the-Middle Security from LPN
From MaRDI portal
Publication:2796127
DOI10.1007/978-3-662-49096-9_10zbMath1378.94074OpenAlexW2190257033WikidataQ59163640 ScholiaQ59163640MaRDI QIDQ2796127
David Cash, Eike Kiltz, Stefano Tessaro
Publication date: 23 March 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49096-9_10
Related Items (4)
Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ Efficient authentication from hard learning problems ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ Towards efficient LPN-based symmetric encryption
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- HB-MP: a further step in the HB-family of lightweight authentication protocols
- Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs
- Never Trust a Bunny
- Message Authentication, Revisited
- Candidate weak pseudorandom functions in AC 0 ○ MOD 2
- Efficient Authentication from Hard Learning Problems
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- How to Encrypt with the LPN Problem
- An Improved LPN Algorithm
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- On the Security of HB# against a Man-in-the-Middle Attack
- Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Lapin: An Efficient Authentication Protocol Based on Ring-LPN
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
- 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
This page was built for publication: Two-Round Man-in-the-Middle Security from LPN
