We show that a well-known coin-flipping protocol is breakable in the sense that one of the parties can pre-determine the result of the coin-flip. The way in which the protocol fails is illustrative of the fact that there are insecure ways of using secure cryptographic primitives.
Citation: ISO Press, NATO Science Series
Pub Type: Journals
multiplicative complexity, Hamming weight, symmetric functions, cryptographic proofs, circuit complexity, concrete complexity