Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Hard-core predicate

Known as: Trapdoor predicate, Goldreich-Levin theorem, Goldreich-Levin Construction 
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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
We propose a new tree-based ORAM scheme called Circuit ORAM. Circuit ORAM makes both theoretical and practical contributions… Expand
  • table 1
  • figure 2
  • figure 3
  • table 2
  • table 3
Highly Cited
2007
Highly Cited
2007
This paper provides a framework for developing sampling designs in mixed methods research. First, we present sampling schemes… Expand
Highly Cited
2003
Highly Cited
2003
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad… Expand
  • table 1
Highly Cited
2002
Highly Cited
2002
We investigate the dynamical evolution of coplanar, hierarchical, two-planet systems where the ratio of the orbital semimajor… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2002
Highly Cited
2002
In many standards, e.g. SSL/TLS, IPSEC, WTLS, messages are first pre-formatted, then encrypted in CBC mode with a block cipher… Expand
Review
2002
Review
2002
Environmental heterogeneity may be a general explanation for both the quantity of genetic variation in populations and the… Expand
2002
2002
We analyze the security of the simplified Paillier (S-Paillier) cryptosystem, which was proposed by Catalano et al. We prove that… Expand
  • table 1
Highly Cited
2001
Highly Cited
2001
Although interest in the links between religion and mental health has increased sharply in recent years, researchers remain far… Expand
  • table 1
  • table 1
  • table 2
  • table 2
  • table 3
Highly Cited
2001
Highly Cited
2001
We simulate incompressible MHD turbulence using a pseudospectral code. Our major conclusions are: (1) MHD turbulence is most… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Highly Cited
1989
Highly Cited
1989
A central tool in constructing pseudorandom generators, secure encryption functions, and in other areas are “hard-core… Expand