Research Article
Tree-Based Public Key Encryption with Conjunctive Keyword Search
Algorithm 7
The algorithm for searching each node in the index tree: searchNode (
, , , ).| Input: the public key , a trapdoor for query , an encrypted node , and a matched document set . | | Output:. | | (1) | if is then | | (2) | return | | (3) | end if | | (4) | if is a leaf node then | | (5) | computes ; | | (6) | ifthen | | (7) | adds to the ; | | (8) | end if | | (9) | else This means is an internal node. | | (10) | calls ; | | (11) | ifthen | | (12) | searchNode (, , , ); | | (13) | searchNode (, , , ); | | (14) | end if | | (15) | end if | | (16) | return |
|
