You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 

171 lines
5.5 KiB

use ark_ec::CurveGroup;
use ark_serialize::{CanonicalDeserialize, CanonicalSerialize};
use ark_std::fmt::Debug;
use ark_std::rand::RngCore;
use crate::transcript::Transcript;
use crate::Error;
pub mod ipa;
pub mod kzg;
pub mod pedersen;
/// CommitmentScheme defines the vector commitment scheme trait. Where `H` indicates if to use the
/// commitment in hiding mode or not.
pub trait CommitmentScheme<C: CurveGroup, const H: bool = false>: Clone + Debug {
type ProverParams: Clone + Debug;
type VerifierParams: Clone + Debug + CanonicalSerialize + CanonicalDeserialize;
type Proof: Clone + Debug;
type ProverChallenge: Clone + Debug;
type Challenge: Clone + Debug;
fn is_hiding() -> bool;
fn setup(
rng: impl RngCore,
len: usize,
) -> Result<(Self::ProverParams, Self::VerifierParams), Error>;
fn commit(
params: &Self::ProverParams,
v: &[C::ScalarField],
blind: &C::ScalarField,
) -> Result<C, Error>;
fn prove(
params: &Self::ProverParams,
transcript: &mut impl Transcript<C::ScalarField>,
cm: &C,
v: &[C::ScalarField],
blind: &C::ScalarField,
rng: Option<&mut dyn RngCore>,
) -> Result<Self::Proof, Error>;
/// same as `prove` but instead of providing a Transcript to use, providing the already
/// computed challenge
fn prove_with_challenge(
params: &Self::ProverParams,
challenge: Self::ProverChallenge,
v: &[C::ScalarField],
blind: &C::ScalarField,
rng: Option<&mut dyn RngCore>,
) -> Result<Self::Proof, Error>;
fn verify(
params: &Self::VerifierParams,
transcript: &mut impl Transcript<C::ScalarField>,
cm: &C,
proof: &Self::Proof,
) -> Result<(), Error>;
/// same as `verify` but instead of providing a Transcript to use, providing the already
/// computed challenge
fn verify_with_challenge(
params: &Self::VerifierParams,
challenge: Self::Challenge,
cm: &C,
proof: &Self::Proof,
) -> Result<(), Error>;
}
#[cfg(test)]
mod tests {
use super::*;
use ark_bn254::{Bn254, Fr, G1Projective as G1};
use ark_crypto_primitives::sponge::{
poseidon::{PoseidonConfig, PoseidonSponge},
Absorb, CryptographicSponge,
};
use ark_poly_commit::kzg10::VerifierKey;
use ark_std::Zero;
use ark_std::{test_rng, UniformRand};
use super::ipa::IPA;
use super::kzg::{ProverKey, KZG};
use super::pedersen::Pedersen;
use crate::transcript::poseidon::poseidon_canonical_config;
#[test]
fn test_homomorphic_property_using_Commitment_trait() {
let mut rng = &mut test_rng();
let poseidon_config = poseidon_canonical_config::<Fr>();
let n: usize = 128;
// set random vector for the test
let v_1: Vec<Fr> = std::iter::repeat_with(|| Fr::rand(rng)).take(n).collect();
let v_2: Vec<Fr> = std::iter::repeat_with(|| Fr::rand(rng)).take(n).collect();
// set a random challenge for the random linear combination
let r = Fr::rand(rng);
// setup params for Pedersen & KZG
let (pedersen_params, _) = Pedersen::<G1>::setup(&mut rng, n).unwrap();
let (kzg_pk, kzg_vk): (ProverKey<G1>, VerifierKey<Bn254>) =
KZG::<Bn254>::setup(rng, n).unwrap();
// test with Pedersen
test_homomorphic_property_using_Commitment_trait_opt::<G1, Pedersen<G1>>(
&poseidon_config,
&pedersen_params,
&pedersen_params,
r,
&v_1,
&v_2,
);
// test with IPA
test_homomorphic_property_using_Commitment_trait_opt::<G1, IPA<G1>>(
&poseidon_config,
&pedersen_params,
&pedersen_params,
r,
&v_1,
&v_2,
);
// test with KZG
test_homomorphic_property_using_Commitment_trait_opt::<G1, KZG<Bn254>>(
&poseidon_config,
&kzg_pk,
&kzg_vk,
r,
&v_1,
&v_2,
);
}
fn test_homomorphic_property_using_Commitment_trait_opt<
C: CurveGroup,
CS: CommitmentScheme<C>,
>(
poseidon_config: &PoseidonConfig<C::ScalarField>,
prover_params: &CS::ProverParams,
verifier_params: &CS::VerifierParams,
r: C::ScalarField,
v_1: &[C::ScalarField],
v_2: &[C::ScalarField],
) where
<C as ark_ec::Group>::ScalarField: Absorb,
{
// compute the commitment of the two vectors using the given CommitmentScheme
let cm_1 = CS::commit(prover_params, v_1, &C::ScalarField::zero()).unwrap();
let cm_2 = CS::commit(prover_params, v_2, &C::ScalarField::zero()).unwrap();
// random linear combination of the commitments and their witnesses (vectors v_i)
let cm_3 = cm_1 + cm_2.mul(r);
let v_3: Vec<C::ScalarField> = v_1.iter().zip(v_2).map(|(a, b)| *a + (r * b)).collect();
// compute the proof of the cm_3
let transcript_p = &mut PoseidonSponge::<C::ScalarField>::new(poseidon_config);
let proof = CS::prove(
prover_params,
transcript_p,
&cm_3,
&v_3,
&C::ScalarField::zero(),
None,
)
.unwrap();
// verify the opening proof
let transcript_v = &mut PoseidonSponge::<C::ScalarField>::new(poseidon_config);
CS::verify(verifier_params, transcript_v, &cm_3, &proof).unwrap();
}
}