We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a prescribed distribution is available to the players. We also show that a wide range of known efficient proofs of knowledge

We consider concurrent two-player games with reachability objectives. In such games, at each round, player 1 and player 2 independently and simultaneously choose moves, and the two choices determine the next state of the game. The objective of player 1 is to reach a set of target states

Abstract—A bicategory of very general nondeterministic concurrent games and strategies is presented. The intention is to formalize distributed games in which both Player (or a team of players) and Opponent (or a team of opponents) can interact in highly distributed fashion, without, for instance

previously studied relaxations of the standard model (e.g., timing assumptions, super-polynomial simulation), concurrent-secure computation is impossible to achieve in the Bounded Player model. This gives evidence that our model is “closer” to the standard model than previously studied models, and we believe

We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose their moves independently and simultaneously; the current state and the two moves determine a successor state. We consider

al., a basis for much of game semantics, form a subcategory in which the games permit no concurrency, Player-Opponent moves alternate and Opponent always moves first. 1 Finally, winning strategies are considered. 1

Abstract. In [18] Goyal et al. introduced the bounded player model for secure computation. In the bounded player model, there are an a pri-ori bounded number of players in the system, however, each player may execute any unbounded (polynomial) number of sessions. They showed that even though

Abstract. We study Recursive Concurrent Stochastic Games (RCSGs), extending our recent analysis of recursive simple stochastic games [16, 17] to a concurrent setting where the two players choose moves simultaneously and independently at each state. For multi-exit games, our earlier work already

by the presence of music played through a personal music player. Subjects walked the length of a 10 m walkway at a self-selected pace, crossing a 0.15 m obstacle placed at the mid-point of the walkway. The results indicated that subjects with PD crossed the obstacle slower than CTRL subjects and that concurrent

Abstract. We present an algorithmic method for the quantitative, performance-aware synthesis of concurrent programs. The input consists of a nondeterministic partial program and of a parametric performance model. The nondeterminism allows the programmer to omit which (if any) synchronization