Skip to main content
. 2026 Feb 23;26(4):1393. doi: 10.3390/s26041393
Algorithm 3 Verify
  • Input: 

    Transt=(σt,πtvrf,rt,πt,inpt), PP

  • Output: 

    b{0,1}

  •   1:

    Parse inpt as (i,t,pki,pkivrf,Ci,t,opt,θt,yt,Δεt,εt,k,idxt,rect)

  •   2:

    msgtitCi,tytidxtrect

  •   3:

    Step 1: Source authenticity

  •   4:

    if Sign.Verify(pki,σt,msgt)=0 then

  •   5:

        return 0              ▹ Invalid signature

  •   6:

    end if

  •   7:

    Step 2: Index uniqueness

  •   8:

    if VRF.Verify(pkivrf,(i,t),rt,πtvrf)=0 or idxtH(itrt) then

  •   9:

        return 0           ▹ Invalid VRF proof or index

  • 10:

    end if

  • 11:

    Step 3: Computational integrity

  • 12:

    if ZK.Verify(PP,R,inpt,πt)=0 then

  • 13:

        return 0               ▹ Invalid ZK proof

  • 14:

    end if

  • 15:

    return 1