MCPcopy Create free account

hub / github.com/docknetwork/crypto / functions

Functions2,782 in github.com/docknetwork/crypto

⨍ Functions 2,782◇ Types & classes 723
↓ 3 callersMethodverify
( &self, challenge: &G::ScalarField, secret_key: impl AsRef<G::ScalarField>, g
short_group_sig/src/weak_bb_sig_pok_kv.rs:151
↓ 3 callersMethodverify
( &self, challenge: &E::ScalarField, pk: impl Into<E::G2Prepared>, g1: &E::G1A
short_group_sig/src/weak_bb_sig_pok_cdh.rs:145
↓ 3 callersFunctionverify_aggregate_proof
( ip_verifier_srs: &VerifierSRS<E>, pvk: &PreparedVerifyingKey<E>, proof: &AggregateProof<E>,
saver/src/saver_groth16.rs:190
↓ 3 callersMethodverify_decryption
Verify that ciphertext can be correctly decrypted to the given message chunks. This is "Verify_Dec" from algorithm 2 in the paper.
saver/src/encryption.rs:425
↓ 3 callersMethodverify_except_pairings
( &self, commitment: &E::G1Affine, challenge: &E::ScalarField, min: u64,
smc_range_proof/src/cls_range_proof/range_proof_cdh.rs:226
↓ 3 callersMethodverify_except_pairings
( &self, commitment: &E::G1Affine, challenge: &E::ScalarField, min: u64,
smc_range_proof/src/ccs_range_proof/arbitrary_range_cdh.rs:311
↓ 3 callersMethodverify_except_pairings
( &self, commitment: &E::G1Affine, challenge: &E::ScalarField, max: u64,
smc_range_proof/src/ccs_range_proof/perfect_range_cdh.rs:213
↓ 3 callersMethodverify_for_inequality_with_public_value_using_randomized_mult_checker
( &self, commitment: G, inequal_to: &G::ScalarField, challenge: &G::ScalarFiel
schnorr_pok/src/inequality.rs:280
↓ 3 callersMethodverify_given_randomized_pairing_checker
( &self, commitment: &E::G1Affine, challenge: &E::ScalarField, min: u64,
smc_range_proof/src/cls_range_proof/range_proof.rs:226
↓ 3 callersMethodverify_membership
( &self, member: &G::ScalarField, witness: &KBUniversalAccumulatorMembershipWitness<G>
vb_accumulator/src/kb_universal_accumulator/accumulator.rs:227
↓ 3 callersMethodverify_partial
Similar to `Self::verify` but responses for some messages (witnesses) are provided in `missing_responses`. The keys of the map are message indices.
bbs_plus/src/proof.rs:388
↓ 3 callersMethodverify_prehashed
(&self, hashed_message: Fr, public_key: Affine)
equality_across_groups/src/pok_ecdsa_pubkey.rs:111
↓ 3 callersFunctionverify_qap_proof
( pvk: &PreparedVerifyingKey<E>, a: E::G1Affine, b: E::G2Affine, c: E::G1Affine, d: E::G1A
saver/src/saver_groth16.rs:164
↓ 3 callersMethodverify_receiver_choices
(&self, choices: &[u16])
oblivious_transfer/src/configs.rs:46
↓ 3 callersMethodverify_responses
OT sender verifier responses to the challenges from the receiver and if valid sends the hashed keys to the receiver. Refers to step 7 of the VSOT prot
oblivious_transfer/src/base_ot/simplest_ot.rs:322
↓ 3 callersMethodverify_sig
( &self, commitments: &[SetCommitment<E>], user_public_key: &UserPublicKey<E>,
delegatable_credentials/src/msbm/sps_eq_uc_sig.rs:546
↓ 3 callersMethodverify_using_randomized_mult_checker
( &self, a: G, b: G, c: G, challenge: &G::ScalarField, comm_ke
schnorr_pok/src/mult_relations.rs:221
↓ 3 callersMethodverify_with_revocation
( &self, challenge: &E::ScalarField, disclosed_attributes: Vec<E::ScalarField>,
delegatable_credentials/src/protego/show/known_signer.rs:482
↓ 3 callersFunctionweighted_inner_product
Weighted inner product of 2 vectors `a` and `b` with weight `w`. Calculated as `\sum_{i=0}(a_i * b_i * w^{i+1})`
utils/src/ff.rs:50
↓ 3 callersMethodzeroize
(&mut self)
proof_system/src/witness.rs:160
↓ 2 callersMethod_add
Common code for adding a single member in both accumulators. Reads and writes to state. Described in section 2 of the paper
vb_accumulator/src/positive.rs:188
↓ 2 callersMethod_add_batch
Common code for adding a batch of members in both accumulators. Reads and writes to state. Described in section 3 of the paper
vb_accumulator/src/positive.rs:215
↓ 2 callersMethod_batch_updates
Common code for adding and removing batches (1 batch each) of elements in both accumulators. Reads and writes to state. Described in section 3 of the
vb_accumulator/src/positive.rs:319
↓ 2 callersMethod_gen_proof
( self, resp: SchnorrResponse<E::ScalarField>, challenge: &E::ScalarField, )
vb_accumulator/src/proofs.rs:1221
↓ 2 callersMethod_gen_proof
( mut self, wits: BTreeMap<usize, E::ScalarField>, challenge: &E::ScalarField, )
vb_accumulator/src/proofs_cdh.rs:348
↓ 2 callersMethod_pairing_check
( &self, pk: impl Into<E::G2Prepared>, g2: impl Into<E::G2Prepared>, )
short_group_sig/src/weak_bb_sig_pok_cdh.rs:270
↓ 2 callersMethod_verify
( &self, revealed_msgs: &BTreeMap<usize, E::ScalarField>, challenge: &E::ScalarField,
bbs_plus/src/proof_23_ietf.rs:362
↓ 2 callersMethod_verify
( &self, revealed_msgs: &BTreeMap<usize, E::ScalarField>, challenge: &E::ScalarField,
bbs_plus/src/proof_23_cdl.rs:422
↓ 2 callersMethod_verify
( &self, revealed_msgs: &BTreeMap<usize, E::ScalarField>, challenge: &E::ScalarField,
bbs_plus/src/proof.rs:478
↓ 2 callersMethod_verify
( &self, revealed_msgs: &BTreeMap<usize, G::ScalarField>, challenge: &G::ScalarField,
kvac/src/bbdt_2016/proof_cdh.rs:376
↓ 2 callersMethod_verify
( &self, resp_for_message: E::ScalarField, resp_for_delta_1: E::ScalarField, c
short_group_sig/src/bb_sig_pok.rs:497
↓ 2 callersMethod_verify_with_randomized_pairing_checker
( &self, revealed_msgs: &BTreeMap<usize, E::ScalarField>, challenge: &E::ScalarField,
bbs_plus/src/proof_23_ietf.rs:391
↓ 2 callersMethod_verify_with_randomized_pairing_checker
( &self, revealed_msgs: &BTreeMap<usize, E::ScalarField>, challenge: &E::ScalarField,
bbs_plus/src/proof_23_cdl.rs:451
↓ 2 callersMethod_verify_with_randomized_pairing_checker
( &self, revealed_msgs: &BTreeMap<usize, E::ScalarField>, challenge: &E::ScalarField,
bbs_plus/src/proof.rs:508
↓ 2 callersMethod_verify_with_randomized_pairing_checker
( &self, resp_for_message: E::ScalarField, resp_for_delta_1: E::ScalarField, c
short_group_sig/src/bb_sig_pok.rs:545
↓ 2 callersMethodadd_received_commitments
Called by a participant when it receives commitments from others.
secret_sharing_and_dkg/src/gennaro_dkg.rs:190
↓ 2 callersMethodadd_received_message
( &mut self, msg: Round1Msg<PKG::ScalarField, DIGEST_SIZE>, )
secret_sharing_and_dkg/src/abcp_dkg.rs:201
↓ 2 callersMethodadd_received_share
Called by a participant when it receives a share from another participant
secret_sharing_and_dkg/src/common.rs:277
↓ 2 callersMethodadd_received_share
Called by a participant when it receives a share from others.
secret_sharing_and_dkg/src/gennaro_dkg.rs:107
↓ 2 callersMethodadd_to_ciphertexts
(&mut self, deltas: &[G::ScalarField])
verifiable_encryption/src/tz_21/encryption.rs:112
↓ 2 callersFunctionaggregate_public_inputs
( public_inputs: &[Vec<G::ScalarField>], r_powers: &[G::ScalarField], r_sum: G::ScalarField, g
legogroth16/src/aggregation/utils.rs:100
↓ 2 callersFunctionalpha_r
Compute a vector of scalar -x * delta
bulletproofs_plus_plus/src/range_proof.rs:962
↓ 2 callersFunctionalpha_r2
Compute a vector of [e, e, e, e]
bulletproofs_plus_plus/src/range_proof.rs:967
↓ 2 callersFunctionamortized_response
Return the response of an amortized sigma protocol
compressed_sigma/src/utils.rs:37
↓ 2 callersFunctionand
(a: &[u8], b: &[u8])
oblivious_transfer/src/util.rs:17
↓ 2 callersFunctionbase_n_digits
Representation of `value` in `base`-representation. Returns the base `base` digits in little-endian form
smc_range_proof/src/common.rs:69
↓ 2 callersMethodbatch_size
(&self)
oblivious_transfer/src/ot_based_multiplication/dkls19_batch_mul_2p.rs:252
↓ 2 callersMethodbatch_updates
( &self, additions: Vec<G::ScalarField>, removals: Vec<G::ScalarField>, sk: &S
vb_accumulator/src/kb_universal_accumulator/accumulator.rs:149
↓ 2 callersFunctioncalculate_Q
Q = P*c_0 + k * (c_1*(c_0*y + t)) + A_hat
compressed_sigma/src/compressed_linear_form.rs:399
↓ 2 callersFunctioncalculate_Q_and_Y
Q = A + P * challenge Y = t + Y * challenge
compressed_sigma/src/compressed_homomorphism.rs:382
↓ 2 callersMethodchallenge_contribution
(&self, mut writer: W)
proof_system/src/sub_protocols/bound_check_smc_with_kv.rs:132
↓ 2 callersMethodchallenge_contribution
(&self, mut writer: W)
proof_system/src/sub_protocols/bound_check_smc.rs:101
↓ 2 callersMethodchallenge_contribution
(&self, writer: W)
vb_accumulator/src/setup.rs:316
↓ 2 callersMethodchallenge_contribution
( &self, accumulator_value: &E::G1Affine, pk: &PublicKey<E>, params: &SetupPar
vb_accumulator/src/kb_positive_accumulator/proofs.rs:71
↓ 2 callersMethodchallenge_contribution
( &self, accumulator_value: &E::G1Affine, pk: &PublicKey<E>, params: &SetupPar
vb_accumulator/src/kb_positive_accumulator/proofs_cdh.rs:71
↓ 2 callersMethodchallenge_contribution
( &self, Z: &E::G2Affine, issuer_pk: &IssuerPublicKey<E>, g: &E::G1Affine,
syra/src/pseudonym_alt.rs:185
↓ 2 callersMethodchallenge_contribution
( &self, commitment: &E::G1Affine, comm_key: &MemberCommitmentKey<E::G1Affine>,
smc_range_proof/src/ccs_set_membership/single_member.rs:83
↓ 2 callersMethodchallenge_contribution
( &self, commitment: &E::G1Affine, comm_key: &MemberCommitmentKey<E::G1Affine>,
smc_range_proof/src/ccs_set_membership/single_member_cdh.rs:55
↓ 2 callersMethodchallenge_contribution
( &self, commitment: &G, comm_key: &MemberCommitmentKey<G>, params: &SetMember
smc_range_proof/src/ccs_set_membership/kv_single.rs:54
↓ 2 callersMethodchallenge_contribution
( &self, commitments: &[E::G1Affine], comm_key: &MemberCommitmentKey<E::G1Affine>,
smc_range_proof/src/ccs_set_membership/batch_members.rs:87
↓ 2 callersMethodchallenge_contribution
( &self, commitment: &G, comm_key: &MemberCommitmentKey<G>, params: &SetMember
smc_range_proof/src/cls_range_proof/kv_range_proof.rs:137
↓ 2 callersMethodchallenge_contribution
( &self, commitment: &E::G1Affine, comm_key: &MemberCommitmentKey<E::G1Affine>,
smc_range_proof/src/cls_range_proof/range_proof.rs:143
↓ 2 callersMethodchallenge_contribution
( &self, commitment: &E::G1Affine, comm_key: &MemberCommitmentKey<E::G1Affine>,
smc_range_proof/src/ccs_range_proof/perfect_range.rs:120
↓ 2 callersMethodchallenge_contribution
( &self, commitment: &E::G1Affine, comm_key: &MemberCommitmentKey<E::G1Affine>,
smc_range_proof/src/ccs_range_proof/arbitrary_range_cdh.rs:187
↓ 2 callersMethodchallenge_contribution
( &self, commitment: &E::G1Affine, comm_key: &MemberCommitmentKey<E::G1Affine>,
smc_range_proof/src/ccs_range_proof/perfect_range_cdh.rs:117
↓ 2 callersMethodchallenge_contribution
( &self, commitment: &E::G1Affine, comm_key: &MemberCommitmentKey<E::G1Affine>,
smc_range_proof/src/ccs_range_proof/arbitrary_range.rs:192
↓ 2 callersMethodchallenge_contribution
( &self, commitment: &G, comm_key: &MemberCommitmentKey<G>, params: &SetMember
smc_range_proof/src/ccs_range_proof/kv_perfect_range.rs:114
↓ 2 callersMethodchallenge_contribution
( &self, commitment: &G, comm_key: &MemberCommitmentKey<G>, params: &SetMember
smc_range_proof/src/ccs_range_proof/kv_arbitrary_range.rs:173
↓ 2 callersMethodchallenge_contribution
( &self, revealed_msgs: &BTreeMap<usize, G::ScalarField>, params: &MACParams<G>,
kvac/src/bbdt_2016/proof_cdh.rs:175
↓ 2 callersMethodchallenge_contribution
( &self, g1: &G, writer: W, )
short_group_sig/src/weak_bb_sig_pok_kv.rs:107
↓ 2 callersMethodchallenge_contribution
( &self, g1: &E::G1Affine, writer: W, )
short_group_sig/src/weak_bb_sig_pok_cdh.rs:101
↓ 2 callersMethodchallenge_contribution
( &self, pk: &PublicKeyG2<E>, params: &SignatureParams<E>, proving_key: &Provi
short_group_sig/src/bb_sig_pok.rs:201
↓ 2 callersMethodchallenge_contribution
( &self, pk: &PublicKeyG2<E>, g1: impl Into<E::G1Affine>, writer: W, )
short_group_sig/src/bb_sig_pok_cdh.rs:102
↓ 2 callersMethodchallenge_contribution
( &self, params: &SignatureParams<E>, proving_key: &ProvingKey<E::G1Affine>, w
short_group_sig/src/weak_bb_sig_pok.rs:137
↓ 2 callersMethodchallenge_contribution_for_committed_inequality
( &self, commitment1: &G, commitment2: &G, comm_key: &PedersenCommitmentKey<G>
schnorr_pok/src/inequality.rs:161
↓ 2 callersMethodchallenges
( &self, transcript: &mut impl Transcript, )
bulletproofs_plus_plus/src/range_proof.rs:106
↓ 2 callersMethodchange_rep_without_update_key
ChangeRep from the paper but does not change the update key. Used in credential show
delegatable_credentials/src/msbm/sps_eq_uc_sig.rs:301
↓ 2 callersFunctioncheck
Prove knowledge of BBS+ signature and a certain messages are verifiably encrypted for 2 different decryptors
proof_system/tests/verifiable_encryption_saver.rs:775
↓ 2 callersFunctioncheck
( rng: &mut StdRng, min: u64, max: u64, msg_idx: usize, msg: Fr,
proof_system/tests/bound_check_bpp.rs:46
↓ 2 callersFunctioncheck
Will check for less than relation among the messages of the same signature
proof_system/tests/r1cs/single_circuit_in_a_proof.rs:246
↓ 2 callersFunctioncheck
(rng: &mut StdRng, pub_key_base: &G)
secret_sharing_and_dkg/src/frost_dkg.rs:275
↓ 2 callersFunctioncheck
(rng: &mut StdRng, comm_key: &PedersenCommitmentKey<G>)
secret_sharing_and_dkg/src/pedersen_dvss.rs:31
↓ 2 callersFunctioncheck
( rng: &mut StdRng, ped_comm_key: &PedersenCommitmentKey<CMG>, feld_comm_k
secret_sharing_and_dkg/src/gennaro_dkg.rs:265
↓ 2 callersFunctioncheck
(rng: &mut StdRng, comm_key: &PedersenCommitmentKey<G>)
secret_sharing_and_dkg/src/pedersen_vss.rs:169
↓ 2 callersFunctioncheck
(rng: &mut StdRng, g: &G)
secret_sharing_and_dkg/src/feldman_vss.rs:112
↓ 2 callersFunctioncheck
(rng: &mut StdRng, g: &G)
secret_sharing_and_dkg/src/feldman_dvss_dkg.rs:46
↓ 2 callersFunctioncheck
(rng: &mut StdRng, ck: &G)
secret_sharing_and_dkg/src/distributed_dlog_check/semi_honest.rs:242
↓ 2 callersFunctioncheck
(rng: &mut StdRng, g: G)
secret_sharing_and_dkg/src/baghery_pvss/same_base.rs:207
↓ 2 callersFunctioncheck
(rng: &mut StdRng, pk_base: G, target_base: G)
secret_sharing_and_dkg/src/baghery_pvss/different_base.rs:244
↓ 2 callersFunctioncheck
(message_count: u32, num_tokens: usize, nonces: Option<Vec<&[u8]>>)
kvac/src/bbs_sharp/proof.rs:848
↓ 2 callersMethodcheck_common
( &self, secret_key: &SecretKey<G::ScalarField>, )
vb_accumulator/src/proofs_keyed_verification.rs:659
↓ 2 callersMethodcheck_sizes
( &self, g: &[G], linear_form: &L, )
compressed_sigma/src/compressed_linear_form.rs:358
↓ 2 callersMethodcheck_sizes
( &self, g: &[G], f: &F, )
compressed_sigma/src/compressed_homomorphism.rs:353
↓ 2 callersFunctioncommit_to_poly
( poly: &DensePolynomial<G::ScalarField>, ck: &G, )
secret_sharing_and_dkg/src/feldman_vss.rs:62
↓ 2 callersFunctioncompose
Recreate a field element back from output of `decompose`. Assumes big-endian representation in `decomposed`
saver/src/utils.rs:48
↓ 2 callersFunctioncompute_R_and_u
( base: G::Group, r: &G::ScalarField, e: &G::ScalarField, masked_r: &G::ScalarField, maske
bbs_plus/src/threshold/utils.rs:39
↓ 2 callersMethodcompute_extended
( &self, new_elements: &[G::ScalarField], sk: &SecretKey<G::ScalarField>, )
vb_accumulator/src/kb_universal_accumulator/accumulator.rs:267
↓ 2 callersMethodcompute_for_pairing_check
( &self, challenge: &E::ScalarField, params: &SetMembershipCheckParamsWithPairing<E>,
smc_range_proof/src/cls_range_proof/range_proof.rs:288
↓ 2 callersMethodcompute_for_pairing_check
( &self, challenge: &E::ScalarField, params: &SetMembershipCheckParamsWithPairing<E>,
smc_range_proof/src/ccs_range_proof/perfect_range.rs:280
↓ 2 callersMethodcompute_for_pairing_check
( &self, challenge: &E::ScalarField, params: &SetMembershipCheckParamsWithPairing<E>,
smc_range_proof/src/ccs_range_proof/arbitrary_range.rs:437
← previousnext →501–600 of 2,782, ranked by callers