Summary: We introduce a primitive for quantum cryptography that we term ‘state targeting’. We show that increasing one’s probability of success in this task above a minimum amount implies an unavoidable increase in the probability of a particular kind of failure. This is analogous to the unavoidable disturbance to a quantum state that results from gaining information about its identity, and can be shown to be a purely quantum effect. We solve various optimization problems for state targeting that are useful for the security analysis of two-party cryptographic tasks implemented between remote antagonistic parties. Although we focus on weak coin flipping, the results are significant for other two-party protocols, such as strong coin flipping, partially binding and concealing bit commitment, and bit escrow. Furthermore, the results have significance not only for the traditional notion of security in cryptography, that of restricting a cheater’s ability to bias the outcome of the protocol, but also for a different notion of security that arises only in the quantum context, that of cheat sensitivity. Finally, our analysis leads to some interesting secondary results, namely, a generalization of Uhlmann’s theorem and an operational interpretation of the fidelity between two mixed states.