modproof

Documentation

Index

• Constants
• type ProofMod
  • func NewProof(Session []byte, N, P, Q *big.Int, rand io.Reader) (*ProofMod, error)
  • func NewProofFromBytes(bzs [][]byte) (*ProofMod, error)
  • func (pf *ProofMod) Bytes() [ProofModBytesParts][]byte
  • func (pf *ProofMod) ValidateBasic() bool
  • func (pf *ProofMod) Verify(Session []byte, N *big.Int) bool

Constants

const (
	// Iterations is the number of iterations used in the modular proof for soundness.
	Iterations = 80
	// ProofModBytesParts is the number of byte parts in a serialized ProofMod.
	ProofModBytesParts = Iterations*2 + 3
)

Types

type ProofMod

type ProofMod struct {
	W *big.Int
	X [Iterations]*big.Int
	A *big.Int
	B *big.Int
	Z [Iterations]*big.Int
}

ProofMod is a zero-knowledge proof that N is a product of two primes (Paillier-Blum modulus proof).

func NewProof

func NewProof(Session []byte, N, P, Q *big.Int, rand io.Reader) (*ProofMod, error)

NewProof generates a new modular proof that N = P*Q where P and Q are safe primes.

func NewProofFromBytes

func NewProofFromBytes(bzs [][]byte) (*ProofMod, error)

NewProofFromBytes reconstructs a ProofMod from a slice of byte slices.

func (*ProofMod) Bytes

func (pf *ProofMod) Bytes() [ProofModBytesParts][]byte

Bytes serializes the proof into a fixed-size array of byte slices.

func (*ProofMod) ValidateBasic

func (pf *ProofMod) ValidateBasic() bool

ValidateBasic checks that all fields of the proof are non-nil.

func (*ProofMod) Verify

func (pf *ProofMod) Verify(Session []byte, N *big.Int) bool

Verify checks whether the modular proof is valid for the given modulus N.