Implement missing traits

Author: survived

src/group_element_vs_paillier_encryption_in_range.rs

@@ -86,13 +86,15 @@ use crate::unknown_order::BigNumber;
 use generic_ec::{Curve, Point};
 use libpaillier::{Ciphertext, EncryptionKey, Nonce};
 
+#[derive(Debug, Clone)]
 pub struct SecurityParams {
     /// l in paper, bit size of plaintext
     pub l: usize,
     /// Epsilon in paper, range extension and security parameter for x
     pub epsilon: usize,
 }
 
+#[derive(Debug, Clone)]
 pub struct Data<C: Curve> {
     pub key0: EncryptionKey,
     pub c: Ciphertext,
@@ -101,18 +103,21 @@ pub struct Data<C: Curve> {
     pub g: Point<C>,
 }
 
+#[derive(Clone)]
 pub struct PrivateData {
     pub x: BigNumber,
     pub nonce: Nonce,
 }
 
+#[derive(Debug, Clone)]
 pub struct Commitment<C: Curve> {
     pub s: BigNumber,
     pub a: Ciphertext,
     pub y: Point<C>,
     pub d: BigNumber,
 }
 
+#[derive(Clone)]
 pub struct PrivateCommitment {
     pub alpha: BigNumber,
     pub mu: BigNumber,
@@ -122,6 +127,7 @@ pub struct PrivateCommitment {
 
 pub type Challenge = BigNumber;
 
+#[derive(Debug, Clone)]
 pub struct Proof {
     pub z1: BigNumber,
     pub z2: BigNumber,

src/paillier_affine_operation_in_range.rs

@@ -139,6 +139,7 @@ use libpaillier::{Ciphertext, EncryptionKey, Nonce};
 
 pub use crate::common::InvalidProof;
 
+#[derive(Debug, Clone)]
 pub struct SecurityParams {
     /// l in paper, bit size of x
     pub l_x: usize,
@@ -149,6 +150,7 @@ pub struct SecurityParams {
 }
 
 /// Public data that both parties know
+#[derive(Debug, Clone)]
 pub struct Data<C: Curve> {
     /// N0 in paper, public key that C was encrypted on
     pub key0: EncryptionKey,
@@ -165,6 +167,7 @@ pub struct Data<C: Curve> {
 }
 
 /// Private data of prover
+#[derive(Clone)]
 pub struct PrivateData {
     /// x or epsilon in paper, preimage of X
     pub x: BigNumber,
@@ -178,6 +181,7 @@ pub struct PrivateData {
 
 // As described in cggmp21 at page 35
 /// Prover's first message, obtained by `commit`
+#[derive(Debug, Clone)]
 pub struct Commitment<C: Curve> {
     pub a: BigNumber,
     pub b_x: Point<C>,
@@ -190,6 +194,7 @@ pub struct Commitment<C: Curve> {
 
 /// Prover's data accompanying the commitment. Kept as state between rounds in
 /// the interactive protocol.
+#[derive(Clone)]
 pub struct PrivateCommitment {
     pub alpha: BigNumber,
     pub beta: BigNumber,
@@ -206,6 +211,7 @@ pub struct PrivateCommitment {
 pub type Challenge = BigNumber;
 
 /// The ZK proof. Computed by `prove`
+#[derive(Debug, Clone)]
 pub struct Proof {
     pub z1: BigNumber,
     pub z2: BigNumber,

src/paillier_blum_modulus.rs

@@ -73,17 +73,20 @@ pub enum InvalidProof {
 }
 
 /// Public data that both parties know: the Paillier-Blum modulus
+#[derive(Debug, Clone)]
 pub struct Data {
     pub n: BigNumber,
 }
 
 /// Private data of prover
+#[derive(Clone)]
 pub struct PrivateData {
     pub p: BigNumber,
     pub q: BigNumber,
 }
 
 /// Prover's first message, obtained by `commit`
+#[derive(Debug, Clone)]
 pub struct Commitment {
     pub w: BigNumber,
 }
@@ -92,11 +95,12 @@ pub struct Commitment {
 /// `challenge`
 ///
 /// Consists of `M` singular challenges
-#[derive(Debug, PartialEq, Eq)]
+#[derive(Debug, PartialEq, Eq, Clone)]
 pub struct Challenge<const M: usize> {
     pub ys: [BigNumber; M],
 }
 
+#[derive(Debug, Clone)]
 pub struct ProofPoint {
     pub x: BigNumber,
     pub a: bool,
@@ -105,6 +109,7 @@ pub struct ProofPoint {
 }
 
 /// The ZK proof. Computed by `prove`. Consists of M proofs for each challenge
+#[derive(Debug, Clone)]
 pub struct Proof<const M: usize> {
     pub points: [ProofPoint; M],
 }

src/paillier_decryption_modulo_q.rs

@@ -75,6 +75,7 @@ use libpaillier::{Ciphertext, EncryptionKey, Nonce};
 
 pub use crate::common::InvalidProof;
 
+#[derive(Debug, Clone)]
 pub struct SecurityParams {
     /// l in paper, bit size of plaintext
     pub l: usize,
@@ -83,6 +84,7 @@ pub struct SecurityParams {
 }
 
 /// Public data that both parties know
+#[derive(Debug, Clone)]
 pub struct Data {
     /// q in paper, modulo value such that `x = y mod q`
     pub q: BigNumber,
@@ -95,13 +97,15 @@ pub struct Data {
 }
 
 /// Private data of prover
+#[derive(Clone)]
 pub struct PrivateData {
     /// y in paper, plaintext value of C
     pub y: BigNumber,
     /// rho in paper, nonce of encryption y -> C
     pub nonce: Nonce,
 }
 
+#[derive(Debug, Clone)]
 /// Prover's first message, obtained by `commit`
 pub struct Commitment {
     pub s: BigNumber,
@@ -112,6 +116,7 @@ pub struct Commitment {
 
 /// Prover's data accompanying the commitment. Kept as state between rounds in
 /// the interactive protocol.
+#[derive(Clone)]
 pub struct PrivateCommitment {
     pub alpha: BigNumber,
     pub mu: BigNumber,
@@ -124,6 +129,7 @@ pub struct PrivateCommitment {
 pub type Challenge = BigNumber;
 
 /// The ZK proof. Computed by `prove`
+#[derive(Debug, Clone)]
 pub struct Proof {
     pub z1: BigNumber,
     pub z2: BigNumber,

src/paillier_encryption_in_range.rs

@@ -76,6 +76,7 @@ use libpaillier::{Ciphertext, EncryptionKey, Nonce};
 
 pub use crate::common::InvalidProof;
 
+#[derive(Debug, Clone)]
 pub struct SecurityParams {
     /// l in paper, bit size of plaintext
     pub l: usize,
@@ -86,6 +87,7 @@ pub struct SecurityParams {
 }
 
 /// Public data that both parties know
+#[derive(Debug, Clone)]
 pub struct Data {
     /// N0 in paper, public key that k -> K was encrypted on
     pub key: EncryptionKey,
@@ -94,6 +96,7 @@ pub struct Data {
 }
 
 /// Private data of prover
+#[derive(Clone)]
 pub struct PrivateData {
     /// k in paper, plaintext of K
     pub plaintext: BigNumber,
@@ -103,6 +106,7 @@ pub struct PrivateData {
 
 // As described in cggmp21 at page 33
 /// Prover's first message, obtained by `commit`
+#[derive(Debug, Clone)]
 pub struct Commitment {
     pub s: BigNumber,
     pub a: BigNumber,
@@ -111,6 +115,7 @@ pub struct Commitment {
 
 /// Prover's data accompanying the commitment. Kept as state between rounds in
 /// the interactive protocol.
+#[derive(Clone)]
 pub struct PrivateCommitment {
     pub alpha: BigNumber,
     pub mu: BigNumber,
@@ -124,6 +129,7 @@ pub type Challenge = BigNumber;
 
 // As described in cggmp21 at page 33
 /// The ZK proof. Computed by `prove`
+#[derive(Debug, Clone)]
 pub struct Proof {
     pub z1: BigNumber,
     pub z2: BigNumber,