Questions tagged [game]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
0
votes
0answers
12 views

How to design such a protocol that the agents could replicate the mediator by themselves?

A problem in game theory is that of communication. Taking into account the classic approach of Myerson and Forges, the agents communicate each other, however indirectly, through a communication ...
0
votes
0answers
12 views

Efficient cheap talk communication in game theory

Are there any papers about efficient cheap talk communication, where the players achieve the equilibrium payoffs of a correlated strategy as in Aumann's seminal paper? Or in case no such paper exists, ...
0
votes
0answers
21 views

Methods of security proofs used in bibliography, apart from games and simulations?

The question in mainly stated on the title. I am currently studying various cryptographic schemes and most of them use either game based or simulation based methodologies for their proof. I was ...
2
votes
0answers
39 views

Does the PRG game allow for bad randomness picks?

In the game-based definition, we say that $G: \{ 0, 1 \}^n \rightarrow \{ 0, 1 \}^{\ell(n)}$ is a pseudorandom generator if For all ppt distinguishers $D$, there exists a negligible function $\nu$ ...
0
votes
0answers
22 views

Secure protocols by implementing cheap talk instead on a centralized mediator to compute any function $f(s_1,...,s_n) = (y_1,...,y_n)$?

Based on this paper a protocol is secure if and only if it satisfies secrecy and resiliency. Most of the papers in ecnomic and computer since deal with the following problem. They consider the case ...
1
vote
0answers
42 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 ...
0
votes
0answers
18 views

Building an adversary for a OW-CCA game

Let K_rsa be a RSA genertor with associated security parameter k >= 1024. Let game OW-CCA_Krsa be as follows: How can I build a O(k^3)-time adversary A making at most 2 queries to Invert and ...
0
votes
0answers
26 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. We can show that advantage = 0 ...
0
votes
0answers
36 views

Don't know how to approach this problem, or where to start. Finding an adversary to a hiding and binding game

I have this problem: I also have the python version of this problem here: ...
1
vote
1answer
193 views

How are probabilities combined in the game hopping proof technique?

I'm currently studying a paper (Sequences of Games: A Tool for Taming Complexity in Security Proofs) on proving semantic security using the Game Hopping technique by Victor Shoup. On pages 9-11, he is ...
3
votes
0answers
41 views

Algorithmic game theory and protocol design for communication

There is a field of exchanging information that combines cryptography and game theory. I am interested in understanding this field, but it's a little complex for me. To begin with there is a paper of ...
0
votes
0answers
35 views

MAC Security - MAC verification queries

In the applied cryptography book by Boneh and Shoup, Chapter 6 on MACs, it is stated that an adversary that is also capable of requesting the challenger for verification queries (in addition to ...