Dynamic Outsourced Proofs of Retrievability Enabling Auditing Migration for Remote Storage Security

Algorithm 1

Algorithm for generating proof table .

Proof_Table. With the bv23Tree of levels, and the ordered indices set that appoint

ordered leaves , this algorithm generates the corresponding proof table .

(1)initialize node array by ;

(2) tracks the parent of the current node as

(3); tracks the column of the proof table

(4)whiledo

(5)fordo

(6)ifthen

(7);

(8)else

(9) denote the current tree node stored in

(10)if  node only has one sibling node, which is denoted by then

(11)if exists in , in this casethen

(12); ;

(13)else does not exist in current array

(14);

(15)end if

(16)else has two sibling nodes, which are denoted by

(17) that the sequence of must follow the left-to-right principle as in Figure 2, e.g., two siblings of

node must be denoted by

(18)if  only (or ) exists in then

(19) (or );

(20);

(21)else if both and exist in and , respectively, then

(22); ; ;

(23)else both and do not exist in current array

(24);

(25) end if

(26)end if

(27) the parent node of the current node ;

(28)end if

(29)end for

(30);

(31)end while

(32)return the proof table ;