-
Notifications
You must be signed in to change notification settings - Fork 6
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #3 from Cybersecurity-LINKS/test
Code Refactoring and Cleanup with Features implementation ("cl03" and "bbsplus")- Loading branch information
Showing
37 changed files
with
2,414 additions
and
2,212 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -14,4 +14,7 @@ Cargo.lock | |
|
|
||
| /target | ||
|
|
||
| keypair.txt | ||
| keypair.txt | ||
|
|
||
|
|
||
| .vscode | ||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,103 @@ | ||
| // Copyright 2023 Fondazione LINKS | ||
|
|
||
| // Licensed under the Apache License, Version 2.0 (the "License"); | ||
| // you may not use this file except in compliance with the License. | ||
| // You may obtain a copy of the License at | ||
|
|
||
| // http://www.apache.org/licenses/LICENSE-2.0 | ||
|
|
||
| // Unless required by applicable law or agreed to in writing, software | ||
| // distributed under the License is distributed on an "AS IS" BASIS, | ||
| // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| // See the License for the specific language governing permissions and | ||
| // limitations under the License. | ||
|
|
||
| use bls12_381_plus::{Scalar, G1Projective}; | ||
| use elliptic_curve::hash2curve::ExpandMsg; | ||
| use serde::{Deserialize, Serialize}; | ||
| use crate::{utils::message::{Message, BBSplusMessage}, bbsplus::{ciphersuites::BbsCiphersuite, generators::{Generators, make_generators, global_generators}}, schemes::algorithms::BBSplus, utils::util::{calculate_random_scalars, subgroup_check_g1}, schemes::generics::Commitment}; | ||
|
|
||
|
|
||
|
|
||
| #[derive(Clone, PartialEq, Eq, Debug, Serialize, Deserialize)] | ||
| pub struct BBSplusCommitment { | ||
| pub value: G1Projective, | ||
| pub s_prime: Scalar | ||
| } | ||
|
|
||
|
|
||
|
|
||
| impl <CS: BbsCiphersuite> Commitment<BBSplus<CS>> { | ||
|
|
||
| pub fn commit(messages: &[BBSplusMessage], generators: Option<&Generators>, unrevealed_message_indexes: &[usize]) -> Self | ||
| where | ||
| CS::Expander: for<'a> ExpandMsg<'a>, | ||
| { | ||
|
|
||
| let s_prime = calculate_random_scalars::<CS>(1, None); | ||
|
|
||
| if unrevealed_message_indexes.is_empty() { | ||
| panic!("Unrevealed message indexes empty"); | ||
| } | ||
|
|
||
| let get_generators_fn = make_generators::<CS>; | ||
|
|
||
| let gens: Generators; | ||
| if generators.is_none() { | ||
| gens = global_generators(get_generators_fn, unrevealed_message_indexes.iter().max().unwrap()+3).to_owned().clone(); | ||
| } | ||
| else { | ||
| gens = generators.unwrap().clone(); | ||
| } | ||
|
|
||
|
|
||
| if unrevealed_message_indexes.iter().max().unwrap() >= &gens.message_generators.len() { | ||
| panic!("Non enought generators!"); | ||
| } | ||
|
|
||
| if subgroup_check_g1(gens.g1_base_point) == false { | ||
| panic!("Failed subgroup check"); | ||
| } | ||
|
|
||
| for i in unrevealed_message_indexes { | ||
| if subgroup_check_g1(gens.message_generators[*i]) == false { | ||
| panic!("Failed subgroup check"); | ||
| } | ||
| } | ||
|
|
||
| let mut commitment = gens.q1 * s_prime[0]; | ||
|
|
||
| // let mut index: usize = 0; | ||
|
|
||
| for i in unrevealed_message_indexes { | ||
| // commitment = commitment + (gens.message_generators[*i] * Scalar::from_bytes(&messages[index].to_bytes()).unwrap()); | ||
| commitment += gens.message_generators.get(*i).expect("index overflow") * &messages.get(*i).expect("Index overflow").get_value(); | ||
|
|
||
| // index = index + 1; | ||
| } | ||
|
|
||
| Self::BBSplus(BBSplusCommitment{value: commitment, s_prime: s_prime[0]}) | ||
|
|
||
| } | ||
|
|
||
| pub fn value(&self) -> &G1Projective { | ||
| match self { | ||
| Self::BBSplus(inner) => &inner.value, | ||
| _ => panic!("Cannot happen!") | ||
| } | ||
| } | ||
|
|
||
| pub fn bbsPlusCommitment(&self) -> &BBSplusCommitment { | ||
| match self { | ||
| Self::BBSplus(inner) => &inner, | ||
| _ => panic!("Cannot happen!"), | ||
| } | ||
| } | ||
|
|
||
| pub fn s_prime(&self) -> &Scalar { | ||
| match self { | ||
| Self::BBSplus(inner) => &inner.s_prime, | ||
| _ => panic!("Cannot happen!") | ||
| } | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.