(a) Alice and Bob wish to resolve a dispute over telephone. We can encode the possibilities of the dispute by a binary value. For this they engage a protocol: i. Alice → Bob: Alice picks up randomly an x, which is a 200 bit number and computes the function f(x). Alice sends f(x) to Bob. ii. Bob → Alice: Bob tells Alice whether x was even or odd. iii. Alice → Bob: Alice then sends x to Bob, so t...

Alice is a user. Clyde is a cloud service provider. Alice has a bunch of very large files containing many, many words. Alice wants to store the files in the cloud. Alice wants to do a particular form of private information retrieval (PIR); specifically: Alice wants to determine which file or files contain a given target word. Alice wants Clyde to do the necessary computations (or most of the co...

Two schemes for quantum secure conditional direct communication are proposed, where a set of EPR pairs of maximally entangled particles in Bell states, initially made by the supervisor Charlie, but shared by the sender Alice and the receiver Bob, functions as quantum information channels for faithful transmission. After insuring the security of the quantum channel and obtaining the permission o...

It is shown how thinking in terms of the protocol used can help clarify problems related to anthropic reasoning, such as the Doomsday Argument and the Sleeping Beauty Problem. There is a complex of problems related to anthropic reasoning, the Doomsday Argument [Leslie 1996] and the Sleeping Beauty Problem [Elga 2000] perhaps chief among them, that have generated a great deal of heat in the phil...

We consider the following edge coloring game on a graph G. Given t distinct colors, two players Alice and Bob, with Alice moving ®rst, alternately select an uncolored edge e of G and assign it a color different from the colors of edges adjacent to e. Bob wins if, at any stage of the game, there is an uncolored edge adjacent to colored edges in all t colors; otherwise Alice wins. Note that when ...