Related papers: A secure additive protocol for card players

Let a deck of n cards be shuffled by successively exchanging the cards in positions 1, 2, ..., n with cards in randomly chosen positions. We show that for n equal to 18 or greater, the identity permutation is the most likely. We prove a…

We consider the following game that has been used as a way of testing claims of extrasensory perception (ESP). One is given a deck of $mn$ cards comprised of $n$ distinct types each of which appears exactly $m$ times: this deck is shuffled…

We consider the following cake cutting game: Alice chooses a set P of n points in the square (cake) [0,1]^2, where (0,0) is in P; Bob cuts out n axis-parallel rectangles with disjoint interiors, each of them having a point of P as the lower…

We study the following private data transfer problem: Alice has a database of files. Bob and Cathy want to access a file each from this database (which may or may not be the same file), but each of them wants to ensure that their choices of…

Secure transmission between two agents, Alice and Bob, over block fading channels can be achieved similarly to conventional hybrid automatic repeat request (HARQ) by letting Alice transmit multiple blocks, each containing an encoded version…

Cooperative games model the allocation of profit from joint actions, following considerations such as stability and fairness. We propose the reliability extension of such games, where agents may fail to participate in the game. In the…

We investigate a game where a sender (Alice) teleports coherent states to two receivers (Bob and Charlie) through a tripartite Gaussian state. The aim of the receivers is to optimize their teleportation fidelities by means of local…

We consider a two player simultaneous-move game where the two players each select any permissible $n$-sided die for a fixed integer $n$. A player wins if the outcome of his roll is greater than that of his opponent. Remarkably, for $n>3$,…

Here, we present the quantum version of a very famous statistical decision problem, whose classical version is counter-intuitive to many. The Monty Hall game can be phrased as a two person game between Alice and Bob. In their pioneering…

We study a game puzzle that has enjoyed recent popularity among mathematicians, computer scientist, coding theorists and even the mass press. In the game, $n$ players are fitted with randomly assigned colored hats. Individual players can…

This paper introduces a strategy in the two envelopes problem that utilizes the prior beliefs of two players about the amount of money that their envelopes can contain. This strategy gives them more information about the decision of…

A secret can be an encrypted message or a private key to decrypt the ciphertext. One of the main issues in cryptography is keeping this secret safe. Entrusting secret to one person or saving it in a computer can conclude betrayal of the…

This paper studies the game of guessing riffle-shuffled cards with complete feedback. A deck of $n$ cards labelled 1 to $n$ is riffle-shuffled once and placed on a table. A player tries to guess the cards from top and is given complete…

In this paper, we propose a method of enciphering quantum states of two-state systems (qubits) for sending them in secrecy without entangled qubits shared by two legitimate users (Alice and Bob). This method has the following two…

We examine the advantages that quantum strategies afford in communication-limited games. Inspired by the card game blackjack, we focus on cooperative, two-party sequential games in which a single classical bit of communication is allowed…

Secure multi-party computation is a central problem in modern cryptography. An important sub-class of this are problems of the following form: Alice and Bob desire to produce sample(s) of a pair of jointly distributed random variables. Each…

Assume Alice and Bob share some bipartite $d$-dimensional quantum state. A well-known result in quantum mechanics says that by performing two-outcome measurements, Alice and Bob can produce correlations that cannot be obtained locally,…

Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Wald's pick-the-larger-integer game. Several authors have provided conditions for the existence of…

The original Parrondo game, denoted as AB3, contains two independent games: A and B. The winning or losing of A and B game is defined by the change of one unit of capital. Game A is a losing game if played continuously, with winning…

In this work, we consider a covert communication scenario, where a transmitter Alice communicates to a receiver Bob with the aid of a probabilistic and uninformed jammer against an adversary warden's detection. The transmission status and…