Cryptography from Learning Parity with Noise
From MaRDI portal
Publication:2891361
DOI10.1007/978-3-642-27660-6_9zbMath1298.94103OpenAlexW139192289MaRDI QIDQ2891361
Publication date: 15 June 2012
Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27660-6_9
Related Items (10)
Constructing locally leakage-resilient linear secret-sharing schemes ⋮ Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family ⋮ Statistically sender-private OT from LPN and derandomization ⋮ Learning with physical rounding for linear and quadratic leakage functions ⋮ Covert learning: how to learn with an untrusted intermediary ⋮ Solving the learning parity with noise's open question ⋮ Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices ⋮ Agnostic Learning from Tolerant Natural Proofs ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesizers and their application to the parallel construction of pseudo-random functions
- A new NP-complete problem and public-key identification
- Public-key cryptography from different assumptions
- Subspace LWE
- Message Authentication, Revisited
- Efficient Authentication from Hard Learning Problems
- New Algorithms for Learning in Presence of Errors
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- How to Encrypt with the LPN Problem
- SWIFFT: A Modest Proposal for FFT Hashing
- An Improved LPN Algorithm
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- Bonsai Trees, or How to Delegate a Lattice Basis
- A public key cryptosystem and a signature scheme based on discrete logarithms
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- The Knowledge Complexity of Interactive Proof Systems
- Rapid Multiplication of Rectangular Matrices
- On the inherent intractability of certain coding problems (Corresp.)
- A Pseudorandom Generator from any One-way Function
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- A new identification scheme based on syndrome decoding
- Lapin: An Efficient Authentication Protocol Based on Ring-LPN
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Authenticating Pervasive Devices with Human Protocols
- The Twin Diffie-Hellman Problem and Applications
- : Increasing the Security and Efficiency of
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- 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: Cryptography from Learning Parity with Noise
