Two-Servers PIR Based DNS Query Scheme with Privacy-Preserving

In a society preoccupied with gradual erosion of electronic privacy, loss of privacy in current DNS queries is an important issue worth considering. From the definition, the privacy problem is to prove that none of the private data can be inferred from the information which is made public. The privacy disclosure problem in DNS Query was well analyzed by Zhao et al. from MUE 2007. In this paper, we first analyze the "Range Query " from that paper, then by results of that scheme and another well-known client- to-server privacy-preserving query scheme: Two- DBServer Private Information Retrieval theory, we propose a new privacy-preserving DNS Query scheme, which was proved to achieve higher efficiency and theoretic privacy.