Research Article
Practical Frequency-Hiding Order-Preserving Encryption with Improved Update
| | Input: a set of in tree | | | Output: a balanced search tree | | | Initialization: a new empty search tree | | | the number of nodes in | | | Encryption | | | ifthen | | | Encryption | | | ifthen | | | Encryption | | | Encryption | | | ifthen | | | Update | | | Update | | | if End recursively iterate then | | | Call in ascending order | | | Call in ascending order | | | fordo | | | | | | return tree |
|
