Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
From MaRDI portal
Publication:5915597
DOI10.1007/978-3-030-03807-6_16zbMath1443.94077OpenAlexW2811433520MaRDI QIDQ5915597
Publication date: 11 December 2018
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_16
Related Items (3)
Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness ⋮ Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- Derandomizing Arthur-Merlin games using hitting sets
- BPP and the polynomial hierarchy
- Expanders, randomness, or time versus space
- On the power of two-point based sampling
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- Hardness vs randomness
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension
- Identity-based encryption from the Diffie-Hellman assumption
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- Structure vs. hardness through the obfuscation lens
- Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
- Perfect Structure on the Edge of Chaos
- On Constructing One-Way Permutations from Indistinguishability Obfuscation
- Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Notions of Black-Box Reductions, Revisited
- The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- Towards Non-Black-Box Lower Bounds in Cryptography
- On Black-Box Separations among Injective One-Way Functions
- On Constructing 1-1 One-Way Functions
- Simplified Derandomization of BPP Using a Hitting Set Generator
- In a World of P=BPP
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- Towards Non-Black-Box Separations of Public Key Encryption and One Way Function
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- On Related-Secret Pseudorandomness
- Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- A new general derandomization method
- A Pseudorandom Generator from any One-way Function
- Weak Random Sources, Hitting Sets, and BPP Simulations
- Foundations of Cryptography
- On the Composition of Zero-Knowledge Proof Systems
- Improved Constructions of PRFs Secure Against Related-Key Attacks
- A Note on Perfect Correctness by Derandomization
- Advances in Cryptology - EUROCRYPT 2004
- Derandomization in Cryptography
- On the (im)possibility of obfuscating programs
- Zaps and Their Applications
- Fast Software Encryption
- Cryptography in $NC^0$
- Theory of Cryptography
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Can PPAD hardness be based on standard cryptographic assumptions?
This page was built for publication: Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
