Hard-core predicate

Known as: Trapdoor predicate, Goldreich-Levin theorem, Hard core predicate 
In cryptography, a hard-core predicate of a one-way function f is a predicate b (i.e., a function whose output is a single bit) which is easy to… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1988-2016
02419882016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
We devise the first identity-based encryption (IBE) that remains secure even when the adversary is equipped with auxiliary input… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded… (More)
Is this relevant?
2004
2004
Let f : {0, 1} → {0, 1} be a one-way function. A function h : {0, 1} → {0, 1} is called a hard-core function for f if, when given… (More)
Is this relevant?
2002
2002
We consider a certain generalization of the hidden number problem introduced by Boneh and Venkatesan in 1996. Considering the XTR… (More)
Is this relevant?
2002
2002
We analyze the security of the simplified Paillier (S-Paillier) cryptosystem, which was proposed by Catalano et al. We prove that… (More)
  • table 1
Is this relevant?
2001
2001
A Boolean function b is a hard-core predicate for a one-way function f if b is polynomial-time computable but b(x) is difficult… (More)
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
 
Is this relevant?
1995
1995
In this paper we consider the bit-security of two types of universal hash functions: linear functions on GFF2 n ] and linear… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A central tool in constructing pseudorandom generators, secure encryption functions, and in other areas are “hard-core… (More)
Is this relevant?