Constructions of low-degree and error-correcting \(\varepsilon \)-biased generators
From MaRDI portal
Publication:626671
DOI10.1007/S00037-009-0281-5zbMath1209.94055OpenAlexW2153267198MaRDI QIDQ626671
Publication date: 18 February 2011
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-009-0281-5
Combinatorics in computer science (68R05) Authentication, digital signatures and secret sharing (94A62) Theory of computing (68Q99)
Related Items (4)
Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Pseudorandom correlation functions from variable-density LPN, revisited ⋮ Bounded Independence Plus Noise Fools Products ⋮ Explicit list-decodable codes with optimal rate for computationally bounded channels
This page was built for publication: Constructions of low-degree and error-correcting \(\varepsilon \)-biased generators
