Research Article
Toward Serverless and Efficient Encrypted Deduplication in Mobile Cloud Computing Environments
| Input: p, δi | | Output: DuplicateFound, k | | (1) | Get the root node N0 of a D-tree ∆ | | (2) | DuplicateFound ⟵ False | | (3) | k ⟵ 0 | | (4) | whileNk ! = ⊥ do | | (5) | Get deduplication information δk assigned to Nk. | | (6) | if Test (δi, δk) = True then | | (7) | DuplicateFound ⟵ True | | (8) | break | | (9) | else | | (10) | ifp[k] = = 0 then | | (11) | Nc ⟵ GetChildNode(Nk, Left) | | (12) | else | | (13) | Nc ⟵ GetChildNode(Nk, Right) | | (14) | end if | | (15) | k ⟵ k + 1 | | (16) | Nk ⟵ Nc | | (17) | end if | | (18) | end while | | (19) | return (DuplicateFound, k) |
|
