Computational hardness assumption

Known as: Computational hardness assumptions, Computational security 
In cryptography, a major goal is to create cryptographic primitives with provable security. In some cases, cryptographic protocols are found to have… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
We revisit the question of constructing secure general-purpose indistinguishability obfuscation, with a security reduction based… (More)
Is this relevant?
2014
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
Deduplication is a technique used to reduce the amount of storage needed by service providers. It is based on the intuition that… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
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
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
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
We consider the rational versions of two of the classical problems in foundations of cryptography: secret sharing and multiparty… (More)
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1999
Highly Cited
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
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?