An Efficient Verification Way for the Encrypted EMRs Based on Sub_MB Tree

In order to improve the verification efficiency of the Encrypted EMRs, an approach based on Sub_MB is proposed. Firstly, a Merkle B tree is constructed to store the verification information, and the root and the internal nodes are signed. Then the clients could verify the correctness and completeness of data through computing the least verification Sub_MB. Our approach could reduce the cost needed in the process of verification; experiments show that our approach improves 10%-20% in contrast with previous work such as MB, EMB, and so on.