One field that relies on unproven but assumed true mathematical conjectures is cryptography. Provably secure crypto usually assumes that P != NP (it also incorporates further assumptions such as the intractability of integer factorization).