Most of the examples listed here are just using cryptographic hashes as a substitute for a good random number generator.
Since cryptography, when working ideally, results in a string of bits indistinguishable from randomness, there's really not all that much you can do with it. Any purpose other than concealing a string of bits would be served just as well by a really good random number generator.
Hashes are good for detecting unwanted changes to data, be they intentional or unintentional. Similarly, you can do comparisons or large items quickly by computing a hash of the desired value so that it only needs to be considered once, then scanning the "haystack" for an item with a matching hash.
Cryptography can be used to make a "hidden commitment," where one can commit to an answer/prediction/etc. while keeping it hidden. Others can reveal the committed value on some condition, and you cannot later change your answer. (e.g., the secure equivalent of an answer sealed in an envelope)
Related to zero-knowledge proofs, already listed, encryption techniques can be used to allow separate parties to collaborate usefully without sharing their data, called Secure Multi-party Computation. Of course, this is still related to confidentiality, but it's quite different from the "normal" uses of cryptography.