It is easy to see that this bit coin tossing protocol is secure if the underlying bit commitment scheme is secure. The final bit is then computed as the sum modulo two of the bits r 1 and r 2. Bob then chooses another random bit r 2 and sends the bit to Alice. Alice first chooses a random bit r 1 and then uses the bit commitment scheme to commit to this bit. However, it is possible to construct coin tossing protocols which are secure under the assumption that the parties are computationally bounded.Ī generic example of a coin tossing protocol is based on bit commitment. In a purely classical setting, unconditionally secure coin tossing protocols do not exist. A coin tossing protocol is said to be secure if the output bit is virtually uniformly distributed even if one of the parties does not follow the protocol. Coin flip site how to#How to do that over a telephone line?Ī coin tossing protocol between two parties is a sequence of instructions between two parties involving local computations as well as communication over a channel which eventually results in an output bit. Obviously, each of them wants to be sure that the coin toss is fair. They agree to let the decision depend on the outcome of a coin toss. Assume that Alice and Bob, freshly divorced, want to decide on the phone who of them gets their common car. To illustrate the difficulty behind this, consider the following scenario. Right]] Coin tossing is the task of generating a random bit by two mistrusting parties.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |