MCPcopy Create free account

hub / github.com/docknetwork/crypto / functions

Functions2,782 in github.com/docknetwork/crypto

⨍ Functions 2,782◇ Types & classes 723
↓ 5 callersMethodprocess_received_delegated
Run by an entity after receiving a credential from a delegated issuer. It attaches its public key to the orphan signature. Rest is same as `Self::proc
delegatable_credentials/src/msbm/issuance.rs:340
↓ 5 callersMethodprocess_received_from_root
Run by an entity after receiving a credential from the root issuer. See `Self::process_received` for more details.
delegatable_credentials/src/msbm/issuance.rs:296
↓ 5 callersMethodprove
( mut self, rng: &mut R, setup_params: SetupParams<G>, transcript: &mut impl T
bulletproofs_plus_plus/src/range_proof.rs:255
↓ 5 callersMethodrekey_with_witness_bytes
Rekey the transcript using the provided witness data. The `label` parameter is metadata about `witness`.
merlin/src/transcript.rs:302
↓ 5 callersFunctionseek
(mut reader: R, pos: SeekFrom)
legogroth16/src/circom/r1cs_reader.rs:169
↓ 5 callersMethodserialize_for_schnorr_protocol
( &self, mut writer: W, )
smc_range_proof/src/ccs_set_membership/setup.rs:169
↓ 5 callersFunctionsingle
(c: &mut Criterion)
benches/benches/positive_accumulator.rs:173
↓ 5 callersMethodsplit
(&self)
coconut/src/proof/signature_pok/randomized_signature.rs:91
↓ 5 callersMethodsplit_in_half
(&self)
compressed_sigma/src/amortized_linear_form.rs:273
↓ 5 callersMethodupdate_after_addition
Update a membership witness after an element is added to the accumulator. Needs the accumulator before the addition was done.
vb_accumulator/src/witness.rs:493
↓ 5 callersMethodupdate_after_removal
Update a membership witness after an element is removed from the accumulator. Needs the accumulator after the removal was done.
vb_accumulator/src/witness.rs:507
↓ 5 callersMethodupdate_using_public_info_after_multiple_batch_updates
( &self, removals_and_omegas: Vec<(&[E::ScalarField], &Omega<E::G1Affine>)>, )
vb_accumulator/src/kb_positive_accumulator/witness.rs:102
↓ 5 callersMethodverify
( &self, accumulator: &G, witness: &MembershipWitness<G>, member: &G::ScalarFi
vb_accumulator/src/proofs_keyed_verification.rs:177
↓ 5 callersMethodverify
( &self, commitment: &E::G1Affine, challenge: &E::ScalarField, min: u64,
smc_range_proof/src/cls_range_proof/range_proof_cdh.rs:164
↓ 5 callersMethodverify
( &self, challenge: &E::ScalarField, pk: impl Into<E::G2Prepared>, g1: impl In
short_group_sig/src/weak_bb_sig_pok.rs:208
↓ 5 callersMethodverify_schnorr_proof
( &self, accumulator: &G, challenge: &G::ScalarField, )
vb_accumulator/src/proofs_keyed_verification.rs:364
↓ 4 callersMethod_compute_new_post_remove_batch
Compute new accumulated value after batch removals. Described in section 3 of the paper
vb_accumulator/src/positive.rs:263
↓ 4 callersMethodad
(&mut self, data: &[u8], more: bool)
merlin/src/strobe.rs:94
↓ 4 callersMethodadd_many
Add a check of the form `<a, b> = t`. Expects `a` and `b` to be of the same length
utils/src/randomized_mult_checker.rs:79
↓ 4 callersFunctionadd_tau_to_transcript
( transcript: &mut impl Transcript, tau: &CorrelationTag<F>, )
oblivious_transfer/src/ot_based_multiplication/dkls18_mul_2p.rs:306
↓ 4 callersFunctionadd_to_transcript
(transcript: &mut impl Transcript, U: &BitMatrix, rlc: &KOSRLC)
oblivious_transfer/src/ot_based_multiplication/dkls18_mul_2p.rs:300
↓ 4 callersMethodappend_message_with_non_static_label
(&mut self, label: &[u8], message: &[u8])
merlin/src/transcript.rs:105
↓ 4 callersMethodas_ref
(&self)
syra/src/setup.rs:44
↓ 4 callersMethodas_ref
(&self)
short_group_sig/src/weak_bb_sig.rs:62
↓ 4 callersMethodbegin_op
(&mut self, flags: u8, more: bool)
merlin/src/strobe.rs:151
↓ 4 callersMethodbuild_rng
Fork the current [`Transcript`] to construct an RNG whose output is bound to the current transcript state as well as prover's secrets. See the [`Tran
merlin/src/transcript.rs:219
↓ 4 callersFunctioncalculate_d
( pvk: &PreparedVerifyingKey<E>, ciphertext: &Ciphertext<E>, )
saver/src/saver_groth16.rs:152
↓ 4 callersMethodchallenge
( &self, base: u16, num_bits: u16, V: &[G], transcript: &mut impl Tran
bulletproofs_plus_plus/src/range_proof.rs:87
↓ 4 callersMethodchallenge_contribution
( &self, accumulator_value: &E::G1Affine, pk: &PublicKey<E>, params: &SetupPar
vb_accumulator/src/kb_universal_accumulator/proofs.rs:64
↓ 4 callersMethodchallenge_contribution
( &self, accumulator_value: &E::G1Affine, writer: W, )
vb_accumulator/src/kb_universal_accumulator/proofs_cdh.rs:56
↓ 4 callersMethodchallenge_contribution
( &self, accumulator_value: &G, writer: W, )
vb_accumulator/src/kb_universal_accumulator/proofs_keyed_verification.rs:108
↓ 4 callersMethodchallenge_contribution
Assumes that the public commitments and commitment key have already been included in the challenge
equality_across_groups/src/ec/sw_point_addition.rs:153
↓ 4 callersMethodchallenge_contribution
( &self, user_pk: &UserPublicKey<E>, P1: &E::G1Affine, Q: Option<&E::G1Affine>
delegatable_credentials/src/protego/issuance.rs:151
↓ 4 callersMethodchange_rel
ChangeRel from the paper. `insert_at_index` is the 0-based index where the commitment of the given messages should be inserted.
delegatable_credentials/src/msbm/sps_eq_uc_sig.rs:242
↓ 4 callersFunctioncheck
( rng: &mut StdRng, min: u64, max: u64, msg_idx: usize, msg: Fr,
proof_system/tests/bound_check_smc_with_kv.rs:47
↓ 4 callersFunctioncheck
( rng: &mut StdRng, min: u64, max: u64, msg_idx: usize, msg: Fr,
proof_system/tests/bound_check_smc.rs:38
↓ 4 callersFunctioncheck
(max_size: u32)
compressed_sigma/src/amortized_homomorphism.rs:210
↓ 4 callersFunctioncheck
(max_size: u32)
compressed_sigma/src/amortized_linear_form.rs:295
↓ 4 callersFunctioncheck
( rng: &mut StdRng, comm_key: CMG, pk_gen: &PKG, )
secret_sharing_and_dkg/src/abcp_dkg.rs:446
↓ 4 callersFunctioncheck
(num_witnesses: usize)
verifiable_encryption/src/tz_21/dkgith.rs:539
↓ 4 callersMethodcolumn_byte_size
(&self)
oblivious_transfer/src/configs.rs:123
↓ 4 callersMethodcompress
Takes a left and right commitment key and returns a commitment key $left \circ right^{scale} = (left_i*right_i^{scale} ...)$. This is required step du
legogroth16/src/aggregation/key.rs:156
↓ 4 callersMethodcompute_membership_witnesses_for_batch
( &self, members: &[G::ScalarField], sk: &SecretKey<G::ScalarField>, )
vb_accumulator/src/kb_universal_accumulator/accumulator.rs:396
↓ 4 callersFunctioncreate_homomorphisms
Create a homomorphism for each commitment
compressed_sigma/src/partial_knowledge.rs:208
↓ 4 callersFunctioncreate_random_proof_incl_cp_link
( circuit: C, v: E::ScalarField, link_v: E::ScalarField, pk: &ProvingKeyWithLink<E>, rng:
legogroth16/src/prover.rs:32
↓ 4 callersMethoddelegate_with_new_attributes
Credential issued by the a delegated issuer after adding more attributes. The issued credential will have an orphan signature, i.e. the receiver's pub
delegatable_credentials/src/msbm/issuance.rs:84
↓ 4 callersFunctionenc_setup
( chunk_bit_size: u8, rng: &mut R, )
saver/src/encryption.rs:888
↓ 4 callersMethodend_index
Largest 0-based index supported by this update key
delegatable_credentials/src/msbm/keys.rs:189
↓ 4 callersMethodfinish
Mark Phase 1 as over and initialize Phase 2. Call this only when confident that no more complaints will be received or need to be processed. Its assum
secret_sharing_and_dkg/src/gennaro_dkg.rs:132
↓ 4 callersMethodfirst
Returns the first values in the vector of v1 and v2 (respectively w1 and w2). When commitment key is of size one, it's a proxy to get the final values
legogroth16/src/aggregation/key.rs:184
↓ 4 callersMethodgen_partial1_proof
Generate proof when only response for witness1 has to be generated.
schnorr_pok/src/partial.rs:124
↓ 4 callersMethodgen_proof
(mut self, challenge: &E::ScalarField)
syra/src/pseudonym.rs:259
↓ 4 callersMethodgen_proof_contribution_as_struct
( &mut self, challenge: &G::ScalarField, )
proof_system/src/sub_protocols/schnorr.rs:129
↓ 4 callersMethodget_chunked_commitment_gens
( &'a self, setup_params: &'a [SetupParams<E>], st_idx: usize, )
proof_system/src/statement/saver.rs:109
↓ 4 callersFunctionget_link_public_gens
( rng: &mut R, count: u32, )
legogroth16/src/tests.rs:133
↓ 4 callersMethodget_saver_ciphertext_and_proof
( &self, index: usize, )
proof_system/src/verifier.rs:1838
↓ 4 callersFunctioninner_product_poly
Given a vector of polynomials `polys` and scalars `coeffs`, return their inner product `polys[0] * coeffs[0] + polys[1] * coeffs[1] + ...`
utils/src/poly.rs:46
↓ 4 callersMethodinto_iter
(self)
utils/src/extend_some.rs:18
↓ 4 callersMethodis_valid
(&self)
kvac/src/bbdt_2016/setup.rs:129
↓ 4 callersMethodkey
(&mut self, data: &[u8], more: bool)
merlin/src/strobe.rs:104
↓ 4 callersFunctionkey_to_aes_rng
(key: &Key)
oblivious_transfer/src/ot_extensions/alsz_ote.rs:721
↓ 4 callersFunctionkeygen
`g` is the generator used in the scheme to generate public key and ephemeral public key by sender/encryptor
utils/src/elgamal.rs:44
↓ 4 callersMethodlen
(&self)
proof_system/src/meta_statement.rs:91
↓ 4 callersFunctionmodulo_8
(n: T)
oblivious_transfer/src/util.rs:53
↓ 4 callersFunctionmsg_index_map_to_schnorr_response_map
TODO: Document this and rename
utils/src/signature.rs:84
↓ 4 callersMethodpad
(&self, _new_size: u32)
compressed_sigma/src/amortized_linear_form.rs:281
↓ 4 callersMethodrandomize
(&self, randomizer: &G::ScalarField)
vb_accumulator/src/witness.rs:625
↓ 4 callersMethodrandomize
(&self, psi: &E::ScalarField, chi: &E::ScalarField)
delegatable_credentials/src/msbm/keys.rs:112
↓ 4 callersFunctionread_exact
(mut reader: R, buf: &mut [u8])
legogroth16/src/circom/r1cs_reader.rs:159
↓ 4 callersFunctionread_u64
(reader: R)
legogroth16/src/circom/r1cs_reader.rs:153
↓ 4 callersFunctionread_vec
( len: u32, mut r: R, )
legogroth16/src/aggregation/srs.rs:421
↓ 4 callersFunctionrerandomize_proof
Given a LegoGroth16 proof, returns a fresh proof of the same statement. This is not described in the Legosnark paper but inspired from `rerandomize_pr
legogroth16/src/prover.rs:478
↓ 4 callersMethodrun_f
(&mut self)
merlin/src/strobe.rs:111
↓ 4 callersFunctionschnorr_responses_to_msg_index_map
TODO: Document this and rename
utils/src/signature.rs:63
↓ 4 callersMethodself_id
(&self)
secret_sharing_and_dkg/src/gennaro_dkg.rs:183
↓ 4 callersFunctionsig_setup
( rng: &mut R, message_count: u32, )
saver/src/tests.rs:45
↓ 4 callersMethodsplit
Returns the left and right commitment key part. It makes copy.
legogroth16/src/aggregation/key.rs:138
↓ 4 callersMethodstatement_proof
(&self, index: usize)
proof_system/src/prover.rs:1126
↓ 4 callersMethodsub
(self, rhs: Self)
equality_across_groups/src/ec/commitments.rs:110
↓ 4 callersMethodto_keyed_proof
(&self)
vb_accumulator/src/proofs_keyed_verification.rs:384
↓ 4 callersMethodto_projective
(&self)
legogroth16/src/aggregation/srs.rs:145
↓ 4 callersMethodtransform_schnorr_sig
Transform the Schnorr signature received from user (likely from the secure hardware) to be verifiable by the blinded public key.
kvac/src/bbs_sharp/proof.rs:285
↓ 4 callersMethodtry_fill_bytes
(&mut self, dest: &mut [u8])
oblivious_transfer/src/aes_prng.rs:207
↓ 4 callersMethodupdate_using_public_info_after_batch_updates
( &self, removals: &[E::ScalarField], omega: &Omega<E::G1Affine>, )
vb_accumulator/src/kb_positive_accumulator/witness.rs:83
↓ 4 callersFunctionvalidate
Ensures that the given iterator satisfies provided validator for each item. In case of an error, `Err(V::Failure)` will be emitted.
utils/src/iter.rs:37
↓ 4 callersMethodverify
( &self, accumulator_value: &E::G1Affine, challenge: &E::ScalarField, pk: impl
vb_accumulator/src/kb_universal_accumulator/proofs.rs:108
↓ 4 callersMethodverify
( &self, accumulator_value: &E::G1Affine, challenge: &E::ScalarField, pk: impl
vb_accumulator/src/kb_universal_accumulator/proofs_cdh.rs:92
↓ 4 callersMethodverify
( &self, accumulator: &G, secret_key: &SecretKey<G::ScalarField>, challenge: &
vb_accumulator/src/kb_universal_accumulator/proofs_keyed_verification.rs:136
↓ 4 callersMethodverify
Proof that the (transformed) ECDSA signature on the pre-hashed message `hashed_message` can be verified by the committed public key. `comm_public_key`
equality_across_groups/src/pok_ecdsa_pubkey.rs:220
↓ 4 callersMethodverify
Verifies randomized signature. Supplied messages should be indexed same way they were used in the `SignaturePoK`. `indexed_revealed_messages_sorted_by
coconut/src/proof/signature_pok/randomized_signature.rs:47
↓ 4 callersMethodverify
( &self, g: &G, h: &G, y: &G, z: &G, challenge: &G::ScalarFiel
schnorr_pok/src/inequality.rs:518
↓ 4 callersFunctionverify_commitments
Check that the commitments in the proof open to the public inputs and the witnesses but with different bases and randomness. This function is only cal
legogroth16/src/prover.rs:413
↓ 4 callersMethodverify_except_pairing
( &self, resp_for_element: Option<&E::ScalarField>, accumulator_value: E::G1Affine,
vb_accumulator/src/proofs_cdh.rs:481
↓ 4 callersMethodverify_except_pairings
Verify the proof except the pairing equations. This is useful when doing several verifications (of this protocol or others) and the pairing equations
vb_accumulator/src/proofs.rs:1569
↓ 4 callersMethodverify_for_inequality_with_public_value
( &self, commitment: &G, inequal_to: &G::ScalarField, challenge: &G::ScalarFie
schnorr_pok/src/inequality.rs:232
↓ 4 callersFunctionverify_proof_incl_cp_link
Verify a LegoGroth16 proof `proof` against the prepared verification key `pvk`
legogroth16/src/verifier.rs:112
↓ 4 callersMethodverify_with_randomized_pairing_checker
( &self, accumulator_value: &E::G1Affine, challenge: &E::ScalarField, pk: impl
vb_accumulator/src/proofs.rs:1313
↓ 4 callersMethodverify_with_randomized_pairing_checker
( &self, accumulator_value: &E::G1Affine, challenge: &E::ScalarField, pk: impl
vb_accumulator/src/kb_universal_accumulator/proofs.rs:119
↓ 4 callersMethodverify_with_randomized_pairing_checker
( &self, accumulator_value: &E::G1Affine, challenge: &E::ScalarField, pk: impl
vb_accumulator/src/kb_universal_accumulator/proofs_cdh.rs:102
↓ 4 callersFunctionweighted_norm
Weighted inner product of the vector `n` with itself. Calculated as `\sum_{i=0}(n_i * n_i * w^{i+1})`
utils/src/ff.rs:63
← previousnext →301–400 of 2,782, ranked by callers