Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
Authors:
- 24 April 2019
- book chapter
- Published by Springer Nature
- p. 619-635
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Efficient Authentication from Hard Learning Problems2011
- Deterministic Approximation Algorithms for the Nearest Codeword Problem2009
- On Agnostic Learning of Parities, Monomials, and HalfspacesSIAM Journal on Computing, 2009
- Parallel and Concurrent Security of the HB and HB + Protocols2006
- Noise-tolerant learning, the parity problem, and the statistical query modelJournal of the ACM, 2003
- A complete problem for statistical zero knowledgeJournal of the ACM, 2003
- Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More2003
- Cryptographic Primitives Based on Hard Learning Problems1994
- Linear Cryptanalysis Method for DES Cipher1994
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989