Input locality and hardness amplification
From MaRDI portal
Publication:3000528
DOI10.1007/978-3-642-19571-6_1zbMATH Open1281.94016OpenAlexW1645580482MaRDI QIDQ3000528FDOQ3000528
Publication date: 19 May 2011
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19571-6_1
Recommendations
Cryptography (94A60) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (7)
- Cryptography with Constant Input Locality
- Theory of Cryptography
- Title not available (Why is that?)
- Cryptographic hardness of random local functions. Survey
- Algebraic Attacks against Random Local Functions and Their Countermeasures
- Input locality and hardness amplification
- Locally computable UOWHF with linear shrinkage
This page was built for publication: Input locality and hardness amplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000528)