New answers tagged pseudo-random-function
0
My question is the following: why after the OT protocol, $q=r_0 \oplus[s\cdot F(y_R)]$?
Let's start with a case-distinction on the first bit of the OTs:
$s[0]=0$: In this case the sender gets $r_0[0]$ back. Written differently we actually get $r_0[0] \oplus 0\cdot F(y_R)[0]$ (because a XOR with a zero doesn't change anything). However we're in the case of $...
1
Consider yourself an adversary. You're given access to an oracle $O(\cdot)$. You're trying to determine if $O(\cdot)$ is actually random or $F'_s(\cdot)$ with some randomly sampled $s$.
a. Consider $O(0^n)$ and $O(1^n)$.
b. Consider $O(0^n)$
In each case, consider some special event $E$. If $O(\cdot)$ is truly random, what is the probability $p$ that $E$ ...
Top 50 recent answers are included
Related Tags
pseudo-random-function × 334pseudo-random-generator × 74
pseudo-random-permutation × 44
random-number-generator × 30
hash × 27
provable-security × 24
cryptanalysis × 23
randomness × 20
mac × 19
key-derivation × 18
chosen-plaintext-attack × 15
encryption × 14
block-cipher × 13
algorithm-design × 11
aes × 10
collision-resistance × 10
entropy × 7
ctr × 7
keys × 6
protocol-design × 6
hmac × 6
stream-cipher × 6
one-way-function × 6
oblivious-transfer × 6
reference-request × 5