Skip to main content
. 2024 Nov 22;10:e2235. doi: 10.7717/peerj-cs.2235

Algorithm 5. Verify.

Input: I,B, TKi,Q, ψ
Output: proof
1:   ψϕ,proof=0.
2:  Using search trapdoors TKi,Q to perform phrase searches same as line 1–line 6 of Algorithm 4.
3:  for iIDB do
4:       hashiB[i],ψ+HH(r,hashi)
5:  end for
6:  if ψ=ψ then
7:       proof=1
8:  end if
9:  The blockchain sends proof to the data user.