Concrete security

Known as: Asymptotic security, Concrete security model 
In cryptography, concrete security or exact security is a practice-oriented approach that aims to give more precise estimates of the computational… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1987-2018
05101519872018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Waters’ variant of the Boneh-Boyen IBE scheme is attractive because of its efficency, applications, and security attributes, but… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Entity recognition does not ask whether the message is from some entity X, just whether a message is from the same entity as a… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We give a provable-security treatment for the key-wrap problem, providing definitions, constructions, and proofs. We suggest that… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2005
2005
The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and… (More)
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This paper addresses the security of public-key cryptosystems in a \multi-user" setting, namely in the presence of attacks… (More)
Is this relevant?
2000
2000
We investigate several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) in a… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Signature schemes that are derived from three move identification schemes such as the Fiat-Shamir, Schnorr and modified ElGamal… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We study notions and schemes for symmetric (ie. private key) encryption in a concrete security framework. We give four di erent… (More)
  • figure 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Pseudorandom function families are a powerful cryptographic primitive, yielding, in particular, simple solutions for the main… (More)
Is this relevant?