New constructions of pseudorandom codes

DOI10.4230/LIPICS.APPROX/RANDOM.2025.54MaRDI QIDQ7346887zbMATH OpenFDO

Authors Surendra Ghentiyala, Venkatesan Guruswami

Publication date 11 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2025.54

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cites work

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Candidate one-way functions based on expander graphs
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Expander-based cryptography meets natural proofs
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Fast learning requires good memory: a time-space lower bound for parity learning
• scientific article; zbMATH DE number 1088242 (Why is no real title available?)
• scientific article; zbMATH DE number 1842490 (Why is no real title available?)
• More on average case vs approximation complexity
• On the concrete security of Goldreich's pseudorandom generator
• Pseudorandom error-correcting codes
• Public-key cryptography from different assumptions
• Public-key encryption, local pseudorandom generators, and the low-degree method
• Speak much, remember little: cryptography in the bounded storage model, revisited
• Time-space hardness of learning sparse parities

This page was built for publication: New constructions of pseudorandom codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346887)