An Autonomous Log Storage Management Protocol with Blockchain Mechanism and Access Control for the Internet of Things

. 2020 Nov 12;20(22):6471. doi: 10.3390/s20226471

Algorithm 10: Private block calculation.

Input:

C T, δ_{I o T}, δ_{G W}, P r e v i o u s H a s h, O p t i o n a l F i e l d s, O t h e r F i e l d s

.
Output:

P r i B

1:
Retrieve previous hash from private blockchain.
2:
${Verify}_{E C D S A} (δ_{G W}, σ_{C T})$ .
3:
if above check holds, then continue with step 5.
4:
otherwise, terminate the session.
5:
Compute $σ_{S r v} = E C D S A (σ_{C T}, σ_{G W}, I P_{S r v}, t_{S r v})$ .
6:
Set $δ_{S r v} = (σ_{S r v}, I P_{S r v}, t_{S r v})$ .
7:
Set $δ_{C T} = (σ_{C T}, I P_{S r v}, t_{C T})$ .
8:
Set initial $N o n c e$ value as 0.
9:
$w h i l e$ $H (N o n c e ∥ PreviousHash ∥ δ_{S r v} ∥ δ_{G W} ∥ δ_{I o T} ∥ δ_{C T} ∥ O p t i o n a l F i e l d s ∥ O t h e r F i e l d s) < D i f f i c u l t y$ do.
10:
$N o n c e = N o n c e + 1$ .
11:
$e n d w h i l e$ .
12:
Generate $P r i B = (δ_{S r v}, δ_{G W}, δ_{I o T}, δ_{C T}, N o n c e, D i f f i c u l t y, O p t i o n a l F i e l d s)$ .
13:
Write $P r i B$ to private blockchain.
14:
Receive $P r i B l o c k N o_{n}$ from private blockchain.