# Computational hardness assumption

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

- IEEE 56th Annual Symposium on Foundations ofâ€¦
- 2014

We revisit the question of constructing secure general-purpose indistinguishability obfuscation, with a security reduction basedâ€¦Â (More)

Is this relevant?

2014

2014

- ICALP
- 2014

Jumbled indexing is the problem of indexing a text T for queries that ask whether there is a substring of T matching a patternâ€¦Â (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- AsiaCCS
- 2012

Deduplication is a technique used to reduce the amount of storage needed by service providers. It is based on the intuition thatâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- IACR Cryptology ePrint Archive
- 2010

We study the following two related questions: â€“ What are the minimal computational resources required for general secureâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- ACNS
- 2009

Network coding has been shown to improve the capacity and robustness in networks. However, since intermediate nodes modifyâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- STOC
- 2008

In this work we study interactive proofs for tractable languages. The (honest) prover should be efficient and run in polynomialâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- STOC
- 2008

We consider the rational versions of two of the classical problems in foundations of cryptography: secret sharing and multipartyâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- CRYPTO
- 2006

This paper presents the first automatic technique for proving not only protocols but also primitives in the exact securityâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- CRYPTO
- 1999

We consider thebroadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that allâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- J. Comput. Syst. Sci.
- 1994

We present a simple new construction of a pseudorandom bit generator, based on the constant depth generators of [N]. It stretchesâ€¦Â (More)

Is this relevant?