Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?
- 11 August 2021
- journal article
- research article
- Published by Springer Nature in Journal of Cryptology
- Vol. 34 (4) , 1-34
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- On the (im)possibility of obfuscating programsJournal of the ACM, 2012
- Zaps and Their ApplicationsSIAM Journal on Computing, 2007
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- A new general derandomization methodJournal of the ACM, 1998
- Efficient construction of a small hitting set for combinatorial rectangles in high dimensionCombinatorica, 1997
- Hardness vs randomnessJournal of Computer and System Sciences, 1994
- On the power of two-point based samplingJournal of Complexity, 1989
- Expanders, randomness, or time versus spaceJournal of Computer and System Sciences, 1988
- How to construct random functionsJournal of the ACM, 1986
- BPP and the polynomial hierarchyInformation Processing Letters, 1983