Score:2

Is this property implied by a pseudorandom function?

jp flag

Given a keyed pseudorandom function $f: S \times X \rightarrow Y$, where $S$ is the space of secret keys, $X$ is the input domain, and $Y$ is the range, the pseudorandom property says that given any secret key in $S$ the uniform distribution over $Y$ is indistinguishable from the distribution of $f(X)$.

Am wondering, does this property imply also the following:

Let $f: S \times X \rightarrow Y$ be a pseudorandom function. GIven $x \in X$ and $y \in Y$, it is computationally difficult to determine the secret $s \in S$ such that $f(s,x) = y$.

If true, does anyone know a name for this property ?

knaccc avatar
es flag
"security against key recovery", or more simply "secure".
Link L avatar
jp flag
@knaccc thank you ! ... is security against key recovery implied by pseudorandomness ? thanks
us flag
Is this homework? Think about the contrapositive of "if its outputs are indistinguishable from random then it is secure against key recovery attacks"
Link L avatar
jp flag
@Mikero, thanks ... not homework but I saw an article from doctor google which says that PRF is actually a stronger property than key recovery
fgrieu avatar
ng flag
I have a problem with the use of "given" in "given any secret key". To me, a given is available. I'd use "for" instead.
kelalaka avatar
in flag
If you can recover the key, then it is not PRF anymore.
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.