Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with game
Search options not deleted
user 97558
0
votes
0
answers
47
views
How can we prove that the advantage for this hide game for any adversary is equal 0?
Here is the Scheme:
Here is the HIDE game:
Here is my idea but I am not quite sure. I would appreciate some input.
We want to bring advantage = 0 for all adversaries. … If we prove that then we can argue that the adversary won't be able to tell which game its in.
So L is a n-bit string chose uniformly at random. C is also random as well since it uses L? …
- 21
1
vote
0
answers
387
views
Building an Adversary for a PRF game
Here is the game:
How can I make an $\mathcal{O}(k^2)$-time adversary making only one query to its Fn oracle and achieving advantage $= 1 - 1/(p-1)$
Here is my idea so far:
query $2^{-1}$, which when …
- 21