Time space tradeoffs for attacks against one-way functions and PRGs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6223 LNCS, Issue , 2010, Pages 649-665

  De, Anindya ^a   Trevisan, Luca ^a   Tulsiani, Madhur ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

One way functions; pseudorandom generators; random permutations; time space tradeoffs

Indexed keywords

DISTINGUISHERS; LOWER BOUNDS; ONE-WAY FUNCTIONS; ONE-WAY PERMUTATION; ORACLE ACCESS; PSEUDORANDOM GENERATORS; RANDOM PERMUTATIONS; RANDOM STRING; TIME-SPACE TRADEOFFS; UNIFORM DISTRIBUTION;

CRYPTOGRAPHY; PROBABILITY DISTRIBUTIONS;

ALGORITHMS;

EID: 77956997411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14623-7_35     Document Type: Conference Paper

References (18)

1. Aaronson, S.: Lower bounds for local search by quantum arguments. SIAM Journal of Computing 35(4), 804-824 (2006)
2. Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms 3(3), 289-304 (1992)
3. Andreev, A.E., Clementi, A.E.F., Rolim, J.D.P.: Optimal bounds for the approximation of boolean functions and some applications. Theoretical Computer Science 180, 243-268 (1997)
4. Barkan, E., Biham, E., Shamir, A.: Rigorous bounds on cryptanalytic time/memory tradeoffs. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 1-21. Springer, Heidelberg (2006)
5. Bennett, C., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM Journal on Computing 26(5), 1510-1523 (1997)
6. Capalbo, M.R., Reingold, O., Vadhan, S.P., Wigderson, A.: Randomness conductors and constant-degree lossless expanders. In: Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 659-668 (2002) (Pubitemid 35009428)
7. Fiat, A., Naor, M.: Rigorous time/space trade-offs for inverting functions. SIAM Journal on Computing 29(3), 790-803 (1999)
8. Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pp. 305-313 (2000)
9. Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: Proceedings of the 21st ACM Symposium on Theory of Computing, pp. 25-32 (1989)
10. Golynski, A.: Cell probe lower bounds for succinct data structures. In: Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms, pp. 625-634 (2009)
11. Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th ACM Symposium on Theory of Computing, pp. 212-219 (1996)
12. Hellman, M.: A cryptanalytic time-memory trade-off. IEEE Transactions on Information Theory 26(4), 401-406 (1980)
13. Joux, A., Lucks, S.: Improved generic algorithms for 3-collisions. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 347-363. Springer, Heidelberg (2009)
14. Ostlin, A., Pagh, R.: Uniform hashing in constant time and linear space. In: Proceedings of the 35th ACM Symposium on Theory of Computing, pp. 622-628 (2003)
15. Siegel, A.: On universal classes of extremely random constant-time hash functions. SIAM Journal of Computing 33(3), 505-543 (2004)
16. van Oorschot, P.C., Wiener, M.J.: Parallel Collision Search with Cryptanalytic Applications. Journal of Cryptology 12, 1-28 (1999)
17. Wee, H.: On obfuscating point functions. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 523-532 (2005)
18. Yao, A.: Coherent functions and program checkers. In: Proceedings of the 22nd ACM Symposium on Theory of Computing, pp. 84-94 (1990)