Efficient Privacy-Preserving Binary Tree Search

Abstract

Binary search tree is a common structure in computer programming and is currently widely used in many scenarios, such as routing search engine in routers, massive data concurrent query, set/multiset, map in C++ STL, and Linux Such technology is applied to memory management and the like. However, with the development of network technology, people’s demand for privacy protection has gradually increased. The leakage of many key information will cause serious consequences, and also restrict the application and development of network technology. In the process of binary tree search, it is easy to have such a problem: the searched party may only want to provide the location of the searched data without exposing all the data in the entire binary search tree; at the same time, the searcher does not want to expose itself The information you need to find. This leads to issues related to the privacy protection of binary search trees. In response to the above problems, we have proposed a binary tree search solution that can protect privacy, which is used to solve the data leakage problem that may exist during the search process of the binary tree. The feature of the scheme proposed in the text is that it integrates two technologies of binary search tree and obfuscation circuit, so as to effectively protect the binary search tree and perform the search without leaking data. And the security analysis shows that the protocol we proposed is very safe and efficient, which can protect the data beneficially.