iam working in searchable encryption. first i make index for set of files, the index is B+ tree , the leaf of this tree is bloom filter which represent the words in each file. each bloom filter represent one file, inner nodes represent XoR of this leaf nodes.last to encrypt this tree, encrypt each leaf node separately but i confused which techniqe used to encrypt inner nodes that facilitate when i make search in this tree