dlnproof

Documentation

Index

• Constants
• type Proof
  • func NewDLNProof(h1, h2, x, p, q, N *big.Int, rand io.Reader) *Proof
  • func UnmarshalDLNProof(bzs [][]byte) (*Proof, error)
  • func (p *Proof) Serialize() ([][]byte, error)
  • func (p *Proof) Verify(h1, h2, N *big.Int) bool

Constants

const Iterations = 128

Iterations is the number of iterations used in the DLN proof for soundness.

Types

type Proof

type Proof struct {
	Alpha,
	T [Iterations]*big.Int
}

Proof is a zero-knowledge proof of knowledge of the discrete logarithm over a safe prime product.

func NewDLNProof

func NewDLNProof(h1, h2, x, p, q, N *big.Int, rand io.Reader) *Proof

NewDLNProof creates a new DLN proof that h2 = h1^x mod N given the factorization N = p*q.

func UnmarshalDLNProof

func UnmarshalDLNProof(bzs [][]byte) (*Proof, error)

UnmarshalDLNProof reconstructs a DLN Proof from a slice of byte slices.

func (*Proof) Serialize

func (p *Proof) Serialize() ([][]byte, error)

Serialize encodes the proof into a slice of byte slices for transmission.

func (*Proof) Verify

func (p *Proof) Verify(h1, h2, N *big.Int) bool

Verify checks whether the DLN proof is valid for the given h1, h2, and modulus N.