CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN
From MaRDI portal
Publication:1981773
DOI10.1016/j.tcs.2021.06.025OpenAlexW3175656036WikidataQ115566728 ScholiaQ115566728MaRDI QIDQ1981773
Haifeng Qian, Shengfeng Xu, Ke-Fei Chen, Xiang-Xue Li
Publication date: 6 September 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.06.025
learning parity with noiselow noisepost quantum cryptographydecoding failure ratesquared-exponential
Cites Work
- Unnamed Item
- Unnamed Item
- Cryptography with constant input locality
- Simpler CCA secure PKE from LPN problem without double-trapdoor
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- On the Amortized Complexity of Zero-Knowledge Protocols
- An Improved LPN Algorithm
- Parallel and Concurrent Security of the HB and HB + Protocols
- Chosen-Ciphertext Security via Correlated Products
- On the inherent intractability of certain coding problems (Corresp.)
- IND-CCA Secure Cryptography Based on a Variant of the LPN Problem
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- 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
- Class of constructive asymptotically good algebraic codes
- Noise-tolerant learning, the parity problem, and the statistical query model
This page was built for publication: CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN
