A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Coherent functions and program checkers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Optimal bounds for the approximation of boolean functions and some applications
Theoretical Computer Science
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Rigorous Time/Space Trade-offs for Inverting Functions
SIAM Journal on Computing
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Uniform hashing in constant time and linear space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Lower bounds on the efficiency of generic cryptographic constructions
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On Universal Classes of Extremely Random Constant-Time Hash Functions
SIAM Journal on Computing
On obfuscating point functions
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Lower Bounds for Local Search by Quantum Arguments
SIAM Journal on Computing
Cell probe lower bounds for succinct data structures
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved Generic Algorithms for 3-Collisions
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Rigorous bounds on cryptanalytic time/memory tradeoffs
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Domain extension for MACs beyond the birthday barrier
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Publicly verifiable proofs of sequential work
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
On the power of nonuniformity in proofs of security
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Lower bounds for private broadcast encryption
IH'12 Proceedings of the 14th international conference on Information Hiding
| Hi-index | 0.00 |
We study time space tradeoffs in the complexity of attacks against one-way functions and pseudorandom generators. Fiat and Naor [7] show that for every function f: [N] → [N], there is an algorithm that inverts f everywhere using (ignoring lower order factors) time, space and advice at most N3/4. We show that an algorithm using time, space and advice at most max{ε 5/4 N 3/4, √εN} exists that inverts f on at least an ε fraction of inputs. A lower bound of Ω(√εN) also holds, making our result tight in the "low end" of ε ≤ 3√1/N. Both the results of Fiat and Naor and ours are formulated as more general trade-offs between the time and the space and advice length of the algorithm. The results quoted above correspond to the interesting special case in which time equals space and advice length.) We also show that for every length-increasing generator G: [N] → [2N] there is a algorithm that achieves distinguishing probability ε between the output of G and the uniform distribution and that can be implemented in polynomial (in log N) time and with advice and space O(ε2 ċ N log N). We prove a lower bound of S ċ T ≥ Ω(ε2N) where T is the time used by the algorithm and S is the amount of advice. This lower bound applies even when the distinguisher has oracle access to G. We prove stronger lower bounds in the common random string model, for families of one-way permutations and of pseudorandom generators.