Setup for verifying bounds of a message, i.e. range proof. This uses set-membership check based
range proof with Keyed-Verification, i.e. the verifier possess a secret key to verify the proofs.
This is more efficient than the set membership check where the public params are same for everyone.
This returns separate params for prover and verifier and the verifier should never share his params
with the prover as they contain a secret.
This protocol only works with positive integers so any negative integers or decimal numbers
must be converted to positive integers
Setup for verifying bounds of a message, i.e. range proof. This uses set-membership check based range proof with Keyed-Verification, i.e. the verifier possess a secret key to verify the proofs. This is more efficient than the set membership check where the public params are same for everyone. This returns separate params for prover and verifier and the verifier should never share his params with the prover as they contain a secret. This protocol only works with positive integers so any negative integers or decimal numbers must be converted to positive integers