Theory of Cryptography
From MaRDI portal
Publication:5898369
DOI10.1007/11681878zbMath1112.94015OpenAlexW3149533473WikidataQ57254512 ScholiaQ57254512MaRDI QIDQ5898369
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11681878
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
On derandomizing Yao's weak-to-strong OWF construction ⋮ On the complexity of constructing pseudorandom functions (especially when they don't exist) ⋮ On the Security Loss in Cryptographic Reductions