Documentation ¶
Overview ¶
Package dleq provides zero-knowledge proofs of Discrete-Logarithm Equivalence (DLEQ).
This implementation is compatible with the one used for VOPRFs [1]. It supports batching proofs to amortize the cost of the proof generation and verification.
References:
[1] draft-irtf-cfrg-voprf: https://datatracker.ietf.org/doc/draft-irtf-cfrg-voprf
Index ¶
- type Params
- type Proof
- type Prover
- func (p Prover) Prove(k group.Scalar, a, ka, b, kb group.Element, rnd io.Reader) (*Proof, error)
- func (p Prover) ProveBatch(k group.Scalar, a, ka group.Element, bi, kbi []group.Element, rnd io.Reader) (*Proof, error)
- func (p Prover) ProveBatchWithRandomness(k group.Scalar, a, ka group.Element, bi, kbi []group.Element, rnd group.Scalar) (*Proof, error)
- func (p Prover) ProveWithRandomness(k group.Scalar, a, ka, b, kb group.Element, rnd group.Scalar) (*Proof, error)
- type Verifier
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Proof ¶
type Proof struct {
// contains filtered or unexported fields
}
func (*Proof) MarshalBinary ¶
type Prover ¶
type Prover struct{ Params }
func (Prover) ProveBatch ¶
func (Prover) ProveBatchWithRandomness ¶
Click to show internal directories.
Click to hide internal directories.