• Publications
  • Influence
On the (Im)possibility of Obfuscating Programs
TLDR
It is proved that obfuscation is impossible, by constructing a family of functions F that are inherently unobfuscatable in the following sense: there is a property π : F → {0, 1} such that given any program that computes a function f ∈ F, the value π(f) can be efficiently computed. Expand
Complexity of k-SAT
  • R. Impagliazzo, R. Paturi
  • Computer Science, Mathematics
  • Proceedings. Fourteenth Annual IEEE Conference on…
  • 4 May 1999
TLDR
This paper shows that s/sub k/ is an increasing sequence assuming ETH for k-SAT, and shows that d>0.1/s/sub /spl infin// is the limit of s/ sub k/. Expand
Which Problems Have Strongly Exponential Complexity
For several NP-complete problems, there have been a progression of better but still exponential algorithms. In this paper, we address the relative likelihood of sub-exponential algorithms for theseExpand
Which problems have strongly exponential complexity?
For several NP-complete problems, there have been a progression of better but still exponential algorithms. In this paper we address the relative likelihood of sub-exponential algorithms for theseExpand
A Pseudorandom Generator from any One-way Function
TLDR
It is shown how to construct a pseudorandom generator from any one-way function, and it is shown that there is a Pseudorandom Generator if and only ifthere is a one- way function. Expand
On the complexity of K -SAT
The k-SAT problem is to determine if a given k-CNF has a satisfying assignment. It is a celebrated open question as to whether it requires exponential time to solve k-SAT for k?3. Here exponentialExpand
Designated Verifier Proofs and Their Applications
TLDR
This work examplify the verifier designation method for the confirmation protocol for undeniable signatures, and demonstrates how a trap-door commitment scheme can be used to construct designated verifier proofs, both interactive and non-interactive. Expand
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
TLDR
A pseudo-random generator which produces n instances of a problem for which the analog of the XOR lemma holds is given, and it is shown that if any problem in E = DTIAl E(2°t”j) has circuit complexity 2Q(”), then P = BPP. Expand
Using the Groebner basis algorithm to find proofs of unsatisfiability
TLDR
It is shown that the Groebner system polynomially simulates Horn clause resolution, quasi-polynomially simulating tree-like resolution, and weakly exponentially simulates resolution will have better than worst-case behaviour on the same classes of inputs that resolution does. Expand
Hard-core distributions for somewhat hard problems
  • R. Impagliazzo
  • Mathematics, Computer Science
  • Proceedings of IEEE 36th Annual Foundations of…
  • 23 October 1995
TLDR
It is shown that for any decision problem that cannot be 1-/spl delta/ approximated by circuits of a given size, there is a specific "hard core" set of inputs which is at least a /splDelta/ fraction of all inputs and on which no circuit of a slightly smaller size can get even a small advantage over a random guess. Expand
...
1
2
3
4
5
...