Take a sneak peek at the new NIST.gov and let us know what you think!
(Please note: some content may not be complete on the beta site.).
NIST Authors in Bold
|Author(s):||Rene C. Peralta;|
|Title:||Cryptographic Primitives Can Be Fragile|
|Published:||January 03, 2006|
|Abstract:||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|
|Pages:||pp. 143 - 148|
|Keywords:||multiplicative complexity, Hamming weight, symmetric functions, cryptographic proofs, circuit complexity, concrete complexity|
|PDF version:||Click here to retrieve PDF version of paper (89KB)|