Russell Impagliazzo
Algorithms & Complexity · 1989–2003
A researcher in the Science corpus: 5 papers; trusts 2 researchers and is trusted by 2 researchers here, as inferred from the citation graph.
Subfields
- Algorithms & Complexity — 6 citations into it
Whom Russell Impagliazzo trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Oded Goldreich
- Shafi Goldwasser
- Jacob T. Schwartz
- H. Nader
- Silvio Micali
- Leslie G. Valiant
- Michael Luby
- Adi Shamir
- Sanjeev Arora
Who trusts Russell Impagliazzo overall
- Vadim Lyubashevsky
- Alfred J. Menezes
- David J. Aldous
- Moni Naor
- Oded Regev
- Rafail M. Ostrovsky
- Yevgeniy Dodis
- Henry Corrigan-Gibbs
- Marco Tomamichel
- Daniele Micciancio
Papers from Russell Impagliazzo's perspective
Ordered by how strongly the researchers Russell Impagliazzo trusts endorse each paper. Same corpus, a different order for every researcher.
- IP = PSPACE
- Probabilistic Encryption
- The random oracle methodology, revisited (JACM)
- Non-interactive cryptocomputing for NC/sup 1/
- Correcting errors without leaking partial information
- Probabilistic algorithms for sparse polynomials
- PRIMES is in P
- Non-deterministic exponential time has two-prover interactive protocols (Computational Complexity)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Probabilistic checking of proofs: a new characterization of NP
Their papers
- On the (im)possibility of obfuscating programs (2001) — 1,515 citations
- Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds (2003) — 572 citations
- Pseudo-random generation from one-way functions (1989)
- How to recycle random bits (1989)
- Efficient cryptographic schemes provably as secure as subset sum (1989)