Coin flipping by telephone a protocol for solving impossible problems

@inproceedings{Blum1983CoinFB,
  title={Coin flipping by telephone a protocol for solving impossible problems},
  author={Manuel Blum},
  booktitle={SIGA},
  year={1983}
}
  • M. Blum
  • Published in SIGA 1983
  • Computer Science
Alice and Bob want to flip a coin by telephone. (They have just divorced, live in different cities, want to decide who gets the car.) Bob would not like to tell Alice HEADS and hear Alice (at the other end of the line) say "Here goes . . . I'm flipping the coin. . . . You lost!"Coin-flipping in the SPECIAL way done here has a serious purpose. Indeed, it should prove an INDISPENSABLE TOOL of the protocol designer. Whenever a protocol requires one of two adversaries, say Alice, to pick a sequence… 

Abuses in Cryptography and How to Fight Them

This paper demonstrates how several modern crypto-systems can be abused and generalizes [Sim83b]'s subliminal channel and [DGB87]'s abuse of the [FFS87, FS86] identification systems and demonstrates how one can prevent abuses of cryptosystems.

A Fair Loss‐Tolerant Quantum Coin Flipping Protocol

This work refined a novel protocol introduced in 2008 by making it fair in the sense that the optimal cheating strategies allow either player to bias the outcome by the same amount, and proved its security even when losses are taken into account.

Experimental loss-tolerant quantum coin flipping

This work reports on the first experimental demonstration of a quantum coin-flipping protocol for which loss cannot be exploited to cheat better, and takes a significant step towards real-world applications of quantum communication.

Fair Loss-Tolerant Quantum Coin Flipping

A quantum protocol is introduced and it is proved that it is completely impervious to loss and fair in the sense that either player has the same probability of success in cheating attempts at biasing the outcome of the coin flip.

Loss-Tolerant Quantum Coin Flipping

A novel quantum protocol is introduced and it is proved its unconditional security even when such losses are taken into account.

An Optimally Fair Coin Toss

This paper establishes the optimal trade-off between the round complexity and the bias of two-party coin-flipping protocols and shows that Cleve’s lower bound is tight.

Flipping coins in many pockets (Byzantine agreement on uniformly random values)

It is shown that no (probabilistic) protocol can achieve agreement on a fair coin in fewer phases then necessary for Byzantine agreement, and hence the "pre-dealt" nature of the random sequence required for Rabin's algorithm is crucial.

Protocols for Multiparty Coin Toss with a Dishonest Majority

An r-round m-party coin-tossing protocol with an optimal bias of O(1/r) is presented, which achieves the same bias even when the number of parties m is non-constant and theNumber of corrupted parties is m/2+O(1).

Quantum bit escrow

Uncondit ionally secure bit commi tmen t and coin flipping are known to be impossible in the classical world. Bit commitment is known to be impossible also in the quan tum world. We introduce a

Coin Flipping with Constant Bias Implies One-Way Functions

  • Iftach HaitnerEran Omri
  • Computer Science, Mathematics
    2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
  • 2011
Progress is made towards answering the above fundamental question, showing that (strong) coin-flipping protocols safe against a constant bias (concretely, $\frac{\sqrt2 -1}2 - o(1)$) imply one-way functions.
...

References

SHOWING 1-10 OF 14 REFERENCES

How to exchange (secret) keys

A protocol is presented whereby two adversaries may exchange secrets, although neither trusts the other, and it is shown how each of the two can prove, for each bit delivered, that the bit is good.

A method for obtaining digital signatures and public-key cryptosystems

An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important

A method for obtaining digital signatures and public-key cryptosystems

An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys.

A Fast Monte-Carlo Test for Primality

A uniform distribution a from a uniform distribution on the set 1, 2, 3, 4, 5 is a random number and if a and n are relatively prime, compute the residue varepsilon.

Riemann's Hypothesis and tests for primality

  • G. Miller
  • Computer Science, Mathematics
    STOC
  • 1975
It is shown that primality is testable in time a polynomial in the length of the binary representation of a number, and a partial solution is given to the relationship between the complexity of computing the prime factorization of a numbers, computing the Euler phi function, and computing other related functions.

Privacy and authentication: An introduction to cryptography

The basic information theoretic and computational properties of classical and modern cryptographic systems are presented, followed by cryptanalytic examination of several important systems and an examination of the application of cryptography to the security of timesharing systems and computer networks.

Mental Poker

  • Mental Poker
  • 1981

Coin-Flipping into a Well

  • Coin-Flipping into a Well

The Complexity of Some Problems in N1~ber Theory Lecture Notes available from author

  • The Complexity of Some Problems in N1~ber Theory Lecture Notes available from author
  • 1978