Towards efficient LPN-based symmetric encryption
From MaRDI portal
Publication:2117050
DOI10.1007/978-3-030-78375-4_9zbMath1498.94056OpenAlexW3170728601MaRDI QIDQ2117050
Thomas Locher, Sonia Bogos, Dario Korolija, Serge Vaudenay
Publication date: 21 March 2022
Full work available at URL: https://infoscience.epfl.ch/record/287977/files/paper_29.pdf
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-Round Man-in-the-Middle Security from LPN
- Faster Algorithms for Solving LPN
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
- Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs
- Solving LPN Using Covering Codes
- Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
- Optimization of $$\mathsf {LPN}$$ Solving Algorithms
- 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
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Lapin: An Efficient Authentication Protocol Based on Ring-LPN
- IND-CCA Secure Cryptography Based on a Variant of the LPN Problem
- HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems
- Simple Chosen-Ciphertext Security from Low-Noise LPN
- Extractors and pseudorandom generators
- Authenticating Pervasive Devices with Human Protocols
- : Increasing the Security and Efficiency of
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN
- Noise-tolerant learning, the parity problem, and the statistical query model
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
This page was built for publication: Towards efficient LPN-based symmetric encryption
