Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
From MaRDI portal
Publication:2835589
DOI10.1007/978-3-662-53018-4_9zbMath1378.94071OpenAlexW2485198172MaRDI QIDQ2835589
Publication date: 30 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53018-4_9
Related Items (10)
Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] ⋮ Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ CPA-to-CCA transformation for KDM security ⋮ A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Covert learning: how to learn with an untrusted intermediary ⋮ CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ Towards efficient LPN-based symmetric encryption
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-Round Man-in-the-Middle Security from LPN
- Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs
- Cryptography from Learning Parity with Noise
- Message Authentication, Revisited
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
- Efficient Authentication from Hard Learning Problems
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- On the Amortized Complexity of Zero-Knowledge Protocols
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- An Improved LPN Algorithm
- Trapdoors for hard lattices and new cryptographic constructions
- Parallel and Concurrent Security of the HB and HB + Protocols
- Chosen-Ciphertext Security via Correlated Products
- Cryptography with Constant Input Locality
- On the inherent intractability of certain coding problems (Corresp.)
- A Pseudorandom Generator from any One-way Function
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- IND-CCA Secure Cryptography Based on a Variant of the LPN Problem
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- On cryptography with auxiliary input
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Smaller Decoding Exponents: Ball-Collision Decoding
- Advances in Cryptology - EUROCRYPT 2004
- Simple Chosen-Ciphertext Security from Low-Noise LPN
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Authenticating Pervasive Devices with Human Protocols
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Universally Composable Oblivious Transfer Based on a Variant of LPN
- Class of constructive asymptotically good algebraic codes
- Theory of Cryptography
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
