Pseudorandom correlation functions from variable-density LPN, revisited
From MaRDI portal
Publication:6067361
DOI10.1007/978-3-031-31371-4_8zbMath1527.94030OpenAlexW4317530978MaRDI QIDQ6067361
Geoffroy Couteau, Clément Ducros
Publication date: 16 November 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-31371-4_8
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On solving LPN using BKW and variants, Implementation and analysis
- Constructions of low-degree and error-correcting \(\varepsilon \)-biased generators
- Decoding linear codes with high error rate and its impact for LPN security
- LPN decoded
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Efficient pseudorandom correlation generators from ring-LPN
- 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
- Weighted sums of certain dependent random variables
- Faster Algorithms for Solving LPN
- Spooky Encryption and Its Applications
- Constrained Pseudorandom Functions and Their Applications
- 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
- 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
- Security Bounds for the Design of Code-Based Cryptosystems
- A Statistical Decoding Algorithm for General Linear Block Codes
- Tail bounds for occupancy and the satisfiability threshold conjecture
- Smaller Decoding Exponents: Ball-Collision Decoding
- Functional Signatures and Pseudorandom Functions
- Distributed Point Functions and Their Applications
- Linearization Attacks Against Syndrome Based Hashes
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Statistical Decoding Revisited
- Noise-tolerant learning, the parity problem, and the statistical query model
This page was built for publication: Pseudorandom correlation functions from variable-density LPN, revisited
