DiffieHellmanTupleInteractiveProver

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def computeCommitment(proposition: ProveDHTuple, challenge: Challenge, secondMessage: SecondDiffieHellmanTupleProverMessage): (EcPointType, EcPointType)

The function computes initial prover's commitment to randomness ("a" message of the sigma-protocol, which in this case has two parts "a" and "b") based on the verifier's challenge ("e") and prover's response ("z")

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def firstMessage(publicInput: ProveDHTuple): (BigInteger, FirstDiffieHellmanTupleProverMessage)

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def secondMessage(privateInput: DiffieHellmanTupleProverInput, rnd: BigInteger, challenge: Challenge): SecondDiffieHellmanTupleProverMessage

def simulate(publicInput: ProveDHTuple, challenge: Challenge): (FirstDiffieHellmanTupleProverMessage, SecondDiffieHellmanTupleProverMessage)

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit