You are looking for a combination of homomorphic encryption and verifiable computation.
Homomorphic encryption plays a part in this, but it is possibly not the only tool that you need. Homomorphic encryption can preserve the confidentiality of your values, but it cannot ensure that the computation was performed as you specified. That is what verifiable computation does.
Depending on the nature of the operations that you need to perform, you may not require fully homomorphic encryption. If you only require the ability to add ciphertexts together, and you don't care about post-quantum resistance, then the Paillier cryptosystem is an option for you. It's not standardized to my knowledge, but it's older and has been used in other projects.
Otherwise, if you really want/need a standardized homomorphic encryption algorithm, you might opt to use one of the submissions that were recently submitted to NIST. These algorithms are not standardized yet, but they are on track to be, assuming that they are not broken before then. Many of them are based on lattice problems, which implies that may offer homomorphic encryption.
While verifiable computation doesn't have a standardized solution yet (that I am aware of), there has been work into implementing it: See Pinocchio and Pepper.