On black-box separations among injective one-way functions
From MaRDI portal
Publication:3000566
DOI10.1007/978-3-642-19571-6_36zbMATH Open1290.94110OpenAlexW1576762063MaRDI QIDQ3000566FDOQ3000566
Authors: Takahiro Matsuda, Kanta Matsuura 
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_36
Recommendations
- On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
- The impossibility of basing one-way permutations on central cryptographic primitives
- Theory of Cryptography
- On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
Cited In (12)
- Black-box separations for non-interactive classical commitments in a quantum world
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
- On constructing one-way permutations from indistinguishability obfuscation
- The impossibility of basing one-way permutations on central cryptographic primitives
- On constructing one-way permutations from indistinguishability obfuscation
- Certifying trapdoor permutations, revisited
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- A cookbook for black-box separations and a recipe for UOWHFs
- Structure versus hardness through the obfuscation lens
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Black-box use of one-way functions is useless for optimal fair coin-tossing
This page was built for publication: On black-box separations among injective one-way functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000566)
