Benny Applebaum
ABSTRACT
We continue the study of locally-computable pseudorandom generators (PRG) G:{0,1}n -> {0,1}m that each of their outputs depend on a small number of d input bits. While it is known that such generators are likely to exist for the case of small sub-linear stretch m=n+n1-δ, it is less clear whether achieving larger stretch such as m=n+Ω(n), or even m=n1+δ is possible. The existence of such PRGs, which was posed as an open question in previous works, has recently gained an additional motivation due to several interesting applications. We make progress towards resolving this question by obtaining several local constructions based on the one-wayness of "random" local functions -- a variant of an assumption made by Goldreich (ECCC 2000). Specifically, we construct collections of PRGs with the following parameters: 1. Linear stretch m=n+Ω(n) and constant locality d=O(1). 2. Polynomial stretch m=n1+δ and any (arbitrarily slowly growing) super-constant locality d=ω(1), e.g., log*n. 3. Polynomial stretch m=n1+δ, constant locality d=O(1), and inverse polynomial distinguishing advantage (as opposed to the standard case of n-ω(1)).
As an additional contribution, we show that our constructions give rise to strong inapproximability results for the densest-subgraph problem in d-uniform hypergraphs for constant d. This allows us to improve the previous bounds of Feige (STOC 2002) and Khot (FOCS 2004) from constant inapproximability factor to nε-inapproximability, at the expense of relying on stronger assumptions.
Supplemental Material
- D. Achlioptas. Handbook of Satisfiability, chapter Random Satisfiability, pages 243--268. IOS Press, 2009.Google Scholar
- M. Alekhnovich. More on average case vs approximation complexity. In FOCS, pages 298--307. IEEE Computer Society, 2003. Google ScholarDigital Library
- M. Alekhnovich, E. A. Hirsch, and D. Itsykson. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. J. Autom. Reasoning, 35(1--3):51--72, 2005. Google ScholarDigital Library
- B. Applebaum. Pseudorandom generators with long stretch and low locality from random local one-way functions. Electronic Colloquium on Computational Complexity (ECCC), 18:7, 2011.Google Scholar
- B. Applebaum, B. Barak, and A. Wigderson. Public-key cryptography from different assumptions. In Proc. of 42nd STOC, pages 171--180, 2010. Google ScholarDigital Library
- B. Applebaum, A. Bogdanov, and A. Rosen. A dichotomy for local small-bias generators. In Proc. of 9th TCC, pages 1--18, 2012. Google ScholarDigital Library
- B. Applebaum, Y. Ishai, and E. Kushilevitz. Cryptography in NC0. SIAM Journal on Computing, 36(4):845--888, 2006. Google ScholarDigital Library
- B. Applebaum, Y. Ishai, and E. Kushilevitz. On pseudorandom generators with linear stretch in NC0. J. of Computational Complexity, 17(1):38--69, 2008. Google ScholarDigital Library
- S. Arora, B. Barak, M. Brunnermeier, and R. Ge. Computational complexity and information asymmetry in financial products. Commun. ACM, 54(5):101--107, 2011. Google ScholarDigital Library
- A. Bhaskara, M. Charikar, E. Chlamtac, U. Feige, and A. Vijayaraghavan. Detecting high log-densities: an O(n 1/4) approximation for densest k-subgraph. In Proc. of 42nd STOC, pages 201--210, 2010. Google ScholarDigital Library
- A. Bogdanov and Y. Qiao. On the security of goldreich's one-way function. In Proc. of 13th RANDOM, pages 392--405, 2009. Google ScholarDigital Library
- A. Bogdanov and A. Rosen. Input locality and hardness amplification. In Proc. of 8th TCC, pages 1--18, 2011. Google ScholarDigital Library
- A. Coja-Oghlan. Random constraint satisfaction problems. In Proc. 5th DCM, 2009.Google ScholarCross Ref
- J. Cook, O. Etesami, R. Miller, and L. Trevisan. Goldreich's one-way function candidate and myopic backtracking algorithms. In Proc. of 6th TCC, pages 521--538, 2009. Google ScholarDigital Library
- M. Cryan and P. B. Miltersen. On pseudorandom generators in NC0. In Proc. 26th MFCS, 2001. Google ScholarDigital Library
- N. Dedic, L. Reyzin, and S. P. Vadhan. An improved pseudorandom generator based on hardness of factoring. In Proc. 3rd SCN, 2002. Google ScholarDigital Library
- S. O. Etesami. Pseudorandomness against depth-2 circuits and analysis of goldreich's candidate one-way function. Technical Report EECS-2010--180, UC Berkeley, 2010.Google Scholar
- U. Feige. Relations between average case complexity and approximation complexity. In Proc. of 34th STOC, pages 534--543, 2002. Google ScholarDigital Library
- U. Feige, D. Peleg, and G. Kortsarz. The dense k-subgraph problem. Algorithmica, 29(3):410--421, 2001.Google ScholarDigital Library
- A. Flaxman. Random planted 3-SAT. In M.-Y. Kao, editor, Encyclopedia of Algorithms. Springer, 2008.Google Scholar
- O. Goldreich. Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC), 7(090), 2000.Google Scholar
- O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001. Google ScholarDigital Library
- O. Goldreich, H. Krawczyk, and M. Luby. On the existence of pseudorandom generators. SIAM J. Comput., 22(6):1163--1175, 1993. Preliminary version in Proc. 29th FOCS, 1988. Google ScholarDigital Library
- O. Goldreich, N. Nisan, and A. Wigderson. On yao's XOR-lemma. Electronic Colloquium on Computational Complexity (ECCC), 2(50), 1995.Google Scholar
- O. Goldreich and V. Rosen. On the security of modular exponentiation with application to the construction of pseudorandom generators. J. Cryptology, 16(2):71--93, 2003.Google ScholarCross Ref
- I. Haitner, O. Reingold, and S. P. Vadhan. Efficiency improvements in constructing pseudorandom generators from one-way functions. In Proc. of 42nd STOC, pages 437--446, 2010. Google ScholarDigital Library
- J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364--1396, 1999. Google ScholarDigital Library
- Herzberg and Luby. Public randomness in cryptography. In Proc. of 12th CRYPTO, 1992. Google ScholarDigital Library
- Y. Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai. Cryptography with constant computational overhead. In Proc. of 40th STOC, pages 433--442, 2008. Google ScholarDigital Library
- D. Itsykson. Lower bound on average-case complexity of inversion of goldreich's function by drunken backtracking algorithms. In Computer Science - Theory and Applications, 5th International Computer Science Symposium in Russia, pages 204--215, 2010. Google ScholarDigital Library
- J. Kahn, G. Kalai, and N. Linial. The influence of variables on boolean functions. In Proc. of 29th FOCS, pages 68--80, 1988. Google ScholarDigital Library
- S. Khot. Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique. In Proc. of 45th FOCS, pages 136--145, 2004. Google ScholarDigital Library
- L. A. Levin. One-way functions and pseudorandom generators. In Proc. of 17th STOC, pages 363--365, 1985. Google ScholarDigital Library
- R. Miller. Goldreich's one-way function candidate and drunken backtracking algorithms. Distinguished major thesis, University of Virginia, 2009.Google Scholar
- E. Mossel, A. Shpilka, and L. Trevisan. On ε-biased generators in NC0. In Proc. 44th FOCS, pages 136--145, 2003. Google ScholarDigital Library
- M. Naor and O. Reingold. Number-theoretic constructions of efficient pseudo-random functions. J. ACM, 51(2):231--262, 2004. Google ScholarDigital Library
- S. K. Panjwani. An experimental evaluation of goldreich's one-way function. Technical report, IIT, Bombay, 2001.Google Scholar
- M. Sudan, L. Trevisan, and S. P. Vadhan. Pseudorandom generators without the xor lemma. J. Comput. Syst. Sci., 62(2):236--266, 2001. Google ScholarDigital Library
- A. C. Yao. Theory and application of trapdoor functions. In Proc. 23rd FOCS, pages 80--91, 1982. Google ScholarCross Ref
Index Terms
- Pseudorandom generators with long stretch and low locality from random local one-way functions
Recommendations
Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions
We continue the study of locally computable pseudorandom generators (PRGs) $G: \{0,1\}^n \rightarrow \{0,1\}^m$ such that each of their outputs depends on a small number $d$ of input bits. While it is known that such generators are likely to exist for the ...
On Pseudorandom Generators with Linear Stretch in NC0
We consider the question of constructing cryptographic pseudorandom generators (PRGs) in NC 0 , namely ones in which each bit of the output depends on just a constant number of input bits. Previous constructions of such PRGs were limited to stretching a ...
Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits
A sampling procedure for a distribution P over {0, 1}ℓ is a function C: {0, 1}n → {0, 1}ℓ such that the distribution C(Un) (obtained by applying C on the uniform distribution Un) is the “desired distribution” P. Let n > r ≥ ℓ = nΩ(1). An ϵ-nb-PRG (...
Comments