If you build a B+ tree in the same way as the plaintext, and all the nodes in the tree are encrypted, then searching through the nodes of the tree will not be fast. I discovered a method called *
blind index
- . Is there any other good method?
If you build a B+ tree in the same way as the plaintext, and all the nodes in the tree are encrypted, then searching through the nodes of the tree will not be fast. I discovered a method called *
blind index