clippy fix

LFDT-Lockness · May 23, 2024 · 133deb2 · 133deb2
1 parent 86e508d
commit 133deb2
Show file tree

Hide file tree

Showing 2 changed files with 5 additions and 8 deletions.
diff --git a/src/group_element_vs_paillier_encryption_in_range.rs b/src/group_element_vs_paillier_encryption_in_range.rs
@@ -314,7 +314,7 @@ pub mod non_interactive {
     /// deriving determenistic challenge.
     ///
     /// Obtained from the above interactive proof via Fiat-Shamir heuristic.
-    pub fn prove<C: Curve, R: RngCore, D: Digest>(
+    pub fn prove<C: Curve, R: RngCore, D>(
         shared_state: D,
         aux: &Aux,
         data: Data<C>,
@@ -332,7 +332,7 @@ pub mod non_interactive {
     }
 
     /// Verify the proof, deriving challenge independently from same data
-    pub fn verify<C: Curve, D: Digest>(
+    pub fn verify<C: Curve, D>(
         shared_state: D,
         aux: &Aux,
         data: Data<C>,
@@ -355,10 +355,7 @@ pub mod non_interactive {
         data: Data<C>,
         commitment: &Commitment<C>,
         security: &SecurityParams,
-    ) -> Challenge
-    where
-        D: Digest,
-    {
+    ) -> Challenge {
         let shared_state = shared_state.finalize();
         let hash = |d: D| {
             let order = rug::integer::Order::Msf;

diff --git a/src/paillier_affine_operation_in_range.rs b/src/paillier_affine_operation_in_range.rs
@@ -464,7 +464,7 @@ pub mod non_interactive {
     }
 
     /// Verify the proof, deriving challenge independently from same data
-    pub fn verify<C: Curve, D: Digest>(
+    pub fn verify<C: Curve, D>(
         shared_state: D,
         aux: &Aux,
         data: Data<C>,
@@ -480,7 +480,7 @@ pub mod non_interactive {
     }
 
     /// Deterministically compute challenge based on prior known values in protocol
-    pub fn challenge<C: Curve, D: Digest>(
+    pub fn challenge<C: Curve, D>(
         shared_state: D,
         aux: &Aux,
         data: Data<C>,