qoneway

type Committer struct {
	*RSABased
	Y *big.Int
	// contains filtered or unexported fields
}

type MultiplicationProver struct {
	QOneWayHomomorphism    func(*big.Int) *big.Int
	QOneWayHomomorphismInv func(*big.Int) *big.Int // works only for y^Q, takes y as input
	H                      crypto.Group
	Q                      *big.Int
	Y                      *big.Int
	A                      *big.Int // commitments to a
	B                      *big.Int // commitment to b
	C                      *big.Int // commitment to c = a * b mod Q
	// contains filtered or unexported fields
}

type MultiplicationVerifier struct {
	QOneWayHomomorphism func(*big.Int) *big.Int
	H                   crypto.Group
	Q                   *big.Int
	Y                   *big.Int
	A                   *big.Int
	B                   *big.Int
	C                   *big.Int
	// contains filtered or unexported fields
}

type RSABased struct {
	Group *rsa.Group
	// Q is a random number > Group.N.
	Q *big.Int
	// Homomorphism is q-one-way Homomorphism f: x -> x^Q mod N.
	// It is difficult to compute a preimage of y^i for i < Q, but easy for i = Q.
	// Computing preimage of y^Q for RSA-based q-one-way is trivial: it is y.
	Homomorphism func(*big.Int) *big.Int
	// HomomorphismInv can compute x such that Homomorphism(x) = y^Q, given y^Q.
	// Note: we assume that HomomorphismInv takes y as input, not y^Q.
	// In our case (RSA-based q-one-way), HomomorphismInv is trivial: identity.
	// For other QOneHomomorphisms it might be different.
	HomomorphismInv func(*big.Int) *big.Int
}

type Receiver struct {
	*RSABased
	Y *big.Int
	// contains filtered or unexported fields
}