How to Encrypt with the LPN Problem
From MaRDI portal
Publication:3519542
DOI10.1007/978-3-540-70583-3_55zbMath1155.94368OpenAlexW1572614022MaRDI QIDQ3519542
Matthew J. B. Robshaw, Henri Gilbert, Yannick Seurin
Publication date: 19 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_55
Related Items (13)
Cryptography from Learning Parity with Noise ⋮ Robustly reusable fuzzy extractor with imperfect randomness ⋮ Garbling XOR gates ``for free in the standard model ⋮ An approach for stream ciphers design based on joint computing over random and secret data ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Optimization of $$\mathsf {LPN}$$ Solving Algorithms ⋮ BKW meets Fourier new algorithms for LPN with sparse parities ⋮ Solving the learning parity with noise's open question ⋮ Two-Round Man-in-the-Middle Security from LPN ⋮ Homomorphic Evaluation Requires Depth ⋮ Solving LPN using covering codes ⋮ Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes ⋮ Towards efficient LPN-based symmetric encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- HB-MP: a further step in the HB-family of lightweight authentication protocols
- Probabilistic encryption
- Characterization of security notions for probabilistic private-key encryption
- An Improved LPN Algorithm
- Parallel and Concurrent Security of the HB and HB + Protocols
- Good Variants of HB + Are Hard to Find
- $\mathcal{TCH}o$ : A Hardware-Oriented Trapdoor Cipher
- On the inherent intractability of certain coding problems (Corresp.)
- Nonmalleable Cryptography
- Private-key algebraic-code encryptions
- Some optimal inapproximability results
- Authenticating Pervasive Devices with Human Protocols
- An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication
- : 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: How to Encrypt with the LPN Problem
