Fair Loss-Tolerant Quantum Coin Flipping

摘要: Coin flipping is a cryptographic primitive in which two spatially separated players, who do not trust each other, wish to establish common random bit. If we limit ourselves classical communication, this task requires either assumptions on the computational power of players or it them send messages other with sufficient simultaneity force their complete independence. Without such assumptions, all protocols are so that one dishonest player has control over outcome. use quantum hand, have been introduced maximal bias can produce. However, those would be very difficult implement practice because they susceptible realistic losses channel between memory and measurement apparatus. In paper, introduce protocol prove completely impervious loss. The fair sense same probability success cheating attempts at biasing outcome coin flip. We also give explicit optimal strategies for both players.