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

Fangming Zhao; Yoshiaki Hori; Kouichi Sakurai

doi:10.1109/IPC.2007.27

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

Fangming Zhao, Yoshiaki Hori, Kouichi Sakurai

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

21 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 language	English
Title of host publication	Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007
Pages	299-302
Number of pages	4
DOIs	https://doi.org/10.1109/IPC.2007.27
Publication status	Published - 2007
Event	2007 International Conference on Intelligent Pervasive Computing, IPC 2007 - Jeju Island, Korea, Republic of Duration: Oct 11 2007 → Oct 13 2007

Other

Other	2007 International Conference on Intelligent Pervasive Computing, IPC 2007
Country/Territory	Korea, Republic of
City	Jeju Island
Period	10/11/07 → 10/13/07

All Science Journal Classification (ASJC) codes

Computer Science(all)
Computer Networks and Communications
Software

Access to Document

10.1109/IPC.2007.27

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., 4438444, pp. 299-302, 2007 International Conference on Intelligent Pervasive Computing, IPC 2007, Jeju Island, Korea, Republic of, 10/11/07. https://doi.org/10.1109/IPC.2007.27

@inproceedings{b2a396b95c114be1ab7519005780a472,

title = "Two-servers PIR based DNS query scheme with privacy-preserving",

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.",

author = "Fangming Zhao and Yoshiaki Hori and Kouichi Sakurai",

year = "2007",

doi = "10.1109/IPC.2007.27",

language = "English",

isbn = "0769530060",

pages = "299--302",

booktitle = "Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007",

note = "2007 International Conference on Intelligent Pervasive Computing, IPC 2007 ; Conference date: 11-10-2007 Through 13-10-2007",

}

TY - GEN

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

AU - Zhao, Fangming

AU - Hori, Yoshiaki

AU - Sakurai, Kouichi

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=50249092721&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=50249092721&partnerID=8YFLogxK

U2 - 10.1109/IPC.2007.27

DO - 10.1109/IPC.2007.27

M3 - Conference contribution

AN - SCOPUS:50249092721

SN - 0769530060

SN - 9780769530062

SP - 299

EP - 302

BT - Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007

T2 - 2007 International Conference on Intelligent Pervasive Computing, IPC 2007

Y2 - 11 October 2007 through 13 October 2007

ER -

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

Abstract

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this