end for. 6: The server s prepares a series of (d + 1)-qubit GHZ states |GHZ⟩i and shares them with these agent users
end for. With this, each of the verifications can be performed again, to identify the exact instance in the history when the document or its record was tampered with. Any user who can verify the initialization vector used in the previous signature field of the first record can successfully perform auditing of the complete chain. Other users can verify the integrity of the chain beginning from the second record. However, only an auditor can decrypt the symmetric keys stored in the record to further decrypt the U and O fields. In our scheme, each record is related only to its previous and next records. Unlike the Onion scheme, where every record contains the checksum information of the complete preceding chain, our scheme involves agreements with only pairs of records. The verification can also be conducted concurrently for pairs of records along the chain similar to the PKLC scheme. If all records are intact, this improves the verification process. If the verification fails for a particular pair of records, the preceding chain can then be investigated following the process previously described.
end for. 8. For i=k+1 ;i<k+1; i++ do
end for. RRHs to the e-th active ET. Note that only one RRH is serving the e-th active ET and all the beamformers from other RRHs to the e-th ET are set to be zero as per step 6 in the Algorithm 2. Besides, the total amount of energy that can be harvested from surroundings by the z-th idle ET, z ∈ L [idle], is given by G [ET-idle] = η( ∑ |fH wi|2 + ∑ |f ve| ), (4.6) z z z
end for. Security is depending upon two major parts. One as data security and the second is data privacy. In data security we study how data can be securely transmitted and stored and the second part only authorized users can access the patient personal information. In below Fig. 3 is represented the flow chart of secure data communication.
end for. 4. Note that X0 = Xn and Xn+1 = X1. (Round 2):
end for. 9. Note that KR = KL for 1 ≤ i ≤ n − 1, KR = KL and KR = KL. n 1 i+(n−1) i (Key Computation):
end for. 24.Note that Kˆ R = Kˆ L for 1 ≤ i ≤ n − m − 1, Kˆ R = Kˆ L and Kˆ R = Kˆ L. n 1 i+(n−m−1) i (Key Computation):
end for i;z = i;z + 1 UNTIL ( i;z = i OR NOT ExitFor) IF NOT ExitFor THEN
