A New Code-Based Linkable Threshold Ring Signature Scheme

Algorithm 5

Proposed threshold GStern’s protocol.

(1)  Parameters: , ,

(2)  Private information: satisfying

(3)  Public information: , , , , where , satisfying

    and

(4)  The prover : chooses , permutation , randomness , , for

   commitments.

   (i)  let , , and .

   (ii)  let , , and

      .

   (iii)   sends , , and to the verifier

(5)  The verifier sends to , who transfers it to all the signers

(6)  The signers

   (i)  : each signer sends to , then sends

       to .

   (ii)  : each signer sends to , then sends

       to .

   (iii)  : each signer sends to , then sends

      , to .

(7)  The verifier

   (i)  : the verifier uses to construct , , verifying that

       is equal to and that is equal to

      .

   (ii)  : the verifier uses to construct , , verifying that

       is equal to and that is equal to

      .

   (iii)  : the verifier uses to construct , , verifying that

       is equal to , is equal to

       and .