How to Encrypt with the LPN Problem
From MaRDI portal
Recommendations
Cites work
- $\mathcal{TCH}o$ : A Hardware-Oriented Trapdoor Cipher
- : Increasing the Security and Efficiency of
- An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication
- An Improved LPN Algorithm
- Authenticating Pervasive Devices with Human Protocols
- Characterization of security notions for probabilistic private-key encryption
- Good Variants of HB + Are Hard to Find
- HB-MP: a further step in the HB-family of lightweight authentication protocols
- scientific article; zbMATH DE number 1583804 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (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?)
- scientific article; zbMATH DE number 4182679 (Why is no real title available?)
- Noise-tolerant learning, the parity problem, and the statistical query model
- Nonmalleable Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On the inherent intractability of certain coding problems (Corresp.)
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
- Parallel and Concurrent Security of the HB and HB + Protocols
- Private-key algebraic-code encryptions
- Probabilistic encryption
- Some optimal inapproximability results
Cited in
(23)- Secure outsourcing of cryptographic circuits
- Cramer-Shoup like chosen ciphertext security from LPN
- Towards efficient LPN-based symmetric encryption
- Solving LPN using covering codes
- An approach for stream ciphers design based on joint computing over random and secret data
- Solving the learning parity with noise's open question
- BKW meets Fourier new algorithms for LPN with sparse parities
- Two-round man-in-the-middle security from LPN
- Homomorphic evaluation requires depth
- Homomorphic evaluation of lattice-based symmetric encryption schemes
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Cryptography from learning parity with noise
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Optimization of \(\mathsf {LPN}\) solving algorithms
- Garbling XOR gates ``for free in the standard model
- 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
- Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise
- Robustly reusable fuzzy extractors in a post-quantum world
- An iterative correction method for practically LPN solving
- Learning with errors with output dependencies: LWE, LWR, and physical learning problems under the same umbrella
- Robustly reusable fuzzy extractor with imperfect randomness
This page was built for publication: How to Encrypt with the LPN Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519542)
