Consider the holiday season, where there are n players who would like to exchange gifts.
That is, we would like to generate a random permutation having no fixed point. It is known …

Card-based protocols enable us to easily perform cryptographic tasks such as secure
multiparty computation using a deck of physical cards. Since the first card-based protocol …

Card-based protocols that are based on a deck of physical cards achieve secure multi-party
computation with information-theoretic secrecy. Using existing AND, XOR, NOT, and copy …

A group of 100 prisoners, all together in the prison dining area, are told that they will be all
put in isolation cells and then will be interrogated one by one in a room containing a light …

It is known that secure multiparty computation can be performed using physical cards with
identical backs, and numerous card-based cryptographic protocols have been proposed …

Puzzle 1. You are playing solitaire in the first quadrant of the Cartesian plane, the lower
corner of which is shown in Figure 1. You begin with a single checker on square a1. On …

In the generalized Russian cards problem, Alice, Bob and Cath draw a, b and c cards,
respectively, from a deck of size a+ b+ c. Alice and Bob must then communicate their entire …

In the generalized Russian cards problem, we have a deck of n cards and three participants,
A, B, and C, which receive a, b, and c cards respectively. The signature (a, b, c), where n= a+ …

In the generalized Russian cards problem, the three players Alice, Bob and Cath draw a, ba,
b and cc cards, respectively, from a deck of a+ b+ c a+ b+ c cards. Players only know their …

We give some illustrative applications of our recent result on decompositions of labelled
complexes, including some new results on decompositions of hypergraphs with coloured or …