Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
From MaRDI portal
Publication:5918098
DOI10.1007/s00145-021-09405-zzbMath1472.94061OpenAlexW3188841602WikidataQ114231483 ScholiaQ114231483MaRDI QIDQ5918098
Publication date: 10 September 2021
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-021-09405-z
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Analytic circuit theory (94C05) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- 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
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- Identity-based encryption from the Diffie-Hellman assumption
- Structure vs. hardness through the obfuscation lens
- When does functional encryption imply obfuscation?
- 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
- The Dual BKR Inequality and Rudich's Conjecture
- 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
- Indistinguishability Obfuscation from Compact Functional Encryption
- 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
- Indistinguishability Obfuscation from Functional Encryption
- 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
- Can PPAD hardness be based on standard cryptographic assumptions?
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
