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

Related topics

Related topics

33 relations
Coding theoryComputational Diffie–Hellman assumptionComputational complexity theoryCryptographic primitive
(More)

Broader (1)

Computational number theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption
We revisit the question of constructing secure general-purpose indistinguishability obfuscation, with a security reduction based… (More)
Is this relevant?
2014
2014
On Hardness of Jumbled Indexing
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
Boosting efficiency and security in proof of ownership for deduplication
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
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
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
Homomorphic MACs: MAC-Based Integrity for Network Coding
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
Delegating computation: interactive proofs for muggles
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
Games for exchanging information
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
Automated Security Proofs with Sequences of Games
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
Coding Constructions for Blacklisting Problems without Computational Assumptions
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
Hardness vs Randomness
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?