Hard-core predicate
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
- EUROCRYPT
- 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
- TCC
- 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
- EUROCRYPT
- 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
- CRYPTO
- 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
- CRYPTO
- 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
- Public Key Cryptography
- 2002
We analyze the security of the simplified Paillier (S-Paillier) cryptosystem, which was proposed by Catalano et al. We prove that… (More)
Is this relevant?
2001
2001
- Journal of Cryptology
- 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)
Is this relevant?
Highly Cited
1998
1995
1995
- EUROCRYPT
- 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
- STOC
- 1989
A central tool in constructing pseudorandom generators, secure encryption functions, and in other areas are “hard-core… (More)
Is this relevant?