Two-servers PIR based DNS query scheme with privacy-preserving

Fangming Zhao, Yoshiaki Hori, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007
Pages299-302
Number of pages4
DOIs
Publication statusPublished - 2007
Event2007 International Conference on Intelligent Pervasive Computing, IPC 2007 - Jeju Island, Korea, Republic of
Duration: Oct 11 2007Oct 13 2007

Other

Other2007 International Conference on Intelligent Pervasive Computing, IPC 2007
CountryKorea, Republic of
CityJeju Island
Period10/11/0710/13/07

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Computer Networks and Communications
  • Software

Cite this

Zhao, F., Hori, Y., & Sakurai, K. (2007). Two-servers PIR based DNS query scheme with privacy-preserving. In Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007 (pp. 299-302). [4438444] https://doi.org/10.1109/IPC.2007.27