Complete Classification of Bilinear Hard-Core Functions

Let f : {0, 1}n {0, 1}l be a one-way function. A function h : {0, 1}n {0, 1}m is called a hard-core function for f if, when given f(x) for a (secret) x drawn uniformly from {0, 1}n , it is computationally infeasible to distinguish h(x) from a uniformly random m-bit string. A (randomized) function h : {0, 1}n

• Type: Conference
• Year: 2004
• Where: CRYPTO
• Authors: Thomas Holenstein, Ueli M. Maurer, Johan Sjödin
• Keywords: CRYPTO 2004, Cryptology, General Hard-core Function, Hard-core Functions, One-way Function