Correlated pseudorandomness from the hardness of quasi-abelian decoding
From MaRDI portal
Publication:6190123
DOI10.1007/978-3-031-38551-3_18arXiv2306.03488OpenAlexW4385654132MaRDI QIDQ6190123
Geoffroy Couteau, Clément Ducros, Maxime Bombar, Alain Couvreur
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2306.03488
quasi-abelian codespseudorandom correlation generatorsoblivious linear evaluationsilent secure computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On solving LPN using BKW and variants, Implementation and analysis
- Decoding linear codes with high error rate and its impact for LPN security
- Overdrive: making SPDZ great again
- LPN decoded
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient protocols for oblivious linear function evaluation from ring-LWE
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Solving LPN using covering codes
- Efficient pseudorandom correlation generators: silent OT extension and more
- Faster Algorithms for Solving LPN
- Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs
- Never Trust a Bunny
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Multiparty Computation from Somewhat Homomorphic Encryption
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Function Secret Sharing
- Optimization of $$\mathsf {LPN}$$ Solving Algorithms
- A New Algorithm for Solving Ring-LPN With a Reducible Polynomial
- Thresholds of Random Quasi-Abelian Codes
- New Algorithms for Learning in Presence of Errors
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- An Improved LPN Algorithm
- Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem
- Good Variants of HB + Are Hard to Find
- Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes
- Security Bounds for the Design of Code-Based Cryptosystems
- A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
- A Statistical Decoding Algorithm for General Linear Block Codes
- Random codes: minimum distances and error exponents
- Lapin: An Efficient Authentication Protocol Based on Ring-LPN
- Pseudorandom Functions: Three Decades Later
- Smaller Decoding Exponents: Ball-Collision Decoding
- Efficient Encryption From Random Quasi-Cyclic Codes
- Advances in Cryptology - CRYPTO 2003
- The Fast Fourier Transform
- Linearization Attacks Against Syndrome Based Hashes
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Limit distribution of the minimum distance of random linear codes
- Statistical Decoding Revisited
- On the security of the multivariate ring learning with errors problem
- Noise-tolerant learning, the parity problem, and the statistical query model
- Pseudorandom correlation functions from variable-density LPN, revisited
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- On codes and learning with errors over function fields
- Correlated pseudorandomness from expand-accumulate codes
