Structure vs. hardness through the obfuscation lens
From MaRDI portal
Publication:1675749
DOI10.1007/978-3-319-63688-7_23zbMath1407.94086OpenAlexW2577934760MaRDI QIDQ1675749
Vinod Vaikuntanathan, Nir Bitansky, Akshay Degwekar
Publication date: 3 November 2017
Full work available at URL: https://hdl.handle.net/1721.1/137810
indistinguishability obfuscationstatistical zero-knowledgecollision-resistant hashingNP \(\cap\) coNPstructured hardness
Related Items (8)
The Journey from NP to TFNP Hardness ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ Statistical difference beyond the polarizing regime ⋮ Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds ⋮ On the complexity of compressing obfuscation ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Minicrypt primitives with algebraic structure and applications
This page was built for publication: Structure vs. hardness through the obfuscation lens
