Would hashing a ciphertext (so $H(Enc(pk,m))$) compromise it in any way if both schemes are secure by themselves? This doesn't seem to be the case but I couldn't find a definitive answer.
I agree with the more exhaustive proposal initiated by kelalaka that a bulleted list might be helpful. However, I think we should keep it contained to the most common issues we encounter and leave the exhaustiveness to our Help Center. So instead my below suggestion focuses on our four close reas...
I want to use PBKDF2 with 1,000,000 iterations (I don't know yet exactly how many I will choose) to derive a 256-bit symmetric key K from a password provided by a user (at least 40 bits of entropy). Then I would like to have a proof that the user has/knows the key K. The key will be hashed once w...