ridm@nrct.go.th   ระบบคลังข้อมูลงานวิจัยไทย   รายการโปรดที่คุณเลือกไว้

Publishing search logs—a comparative study of privacy guarantees

หน่วยงาน Nanyang Technological University, Singapore

รายละเอียด

ชื่อเรื่อง : Publishing search logs—a comparative study of privacy guarantees
นักวิจัย : Gӧtz, Michaela , Machanavajjhala, Ashwin , Wang, Guozhang , Xiao, Xiaokui , Gehrke, Johannes
คำค้น : DRNTU::Engineering::Computer science and engineering.
หน่วยงาน : Nanyang Technological University, Singapore
ผู้ร่วมงาน : -
ปีพิมพ์ : 2555
อ้างอิง : Gӧtz, M., Machanavajjhala, A., Wang, G., Xiao, X., & Gehrke, J. (2012). Publishing Search Logs—A Comparative Study of Privacy Guarantees. IEEE Transactions on Knowledge and Data Engineering, 24(3), 520-532. , 1041-4347 , http://hdl.handle.net/10220/13479 , http://dx.doi.org/10.1109/TKDE.2011.26
ที่มา : -
ความเชี่ยวชาญ : -
ความสัมพันธ์ : IEEE transactions on knowledge and data engineering
ขอบเขตของเนื้อหา : -
บทคัดย่อ/คำอธิบาย :

Search engine companies collect the “database of intentions,” the histories of their users' search queries. These search logs are a gold mine for researchers. Search engine companies, however, are wary of publishing search logs in order not to disclose sensitive information. In this paper, we analyze algorithms for publishing frequent keywords, queries, and clicks of a search log. We first show how methods that achieve variants of k-anonymity are vulnerable to active attacks. We then demonstrate that the stronger guarantee ensured by ε-differential privacy unfortunately does not provide any utility for this problem. We then propose an algorithm ZEALOUS and show how to set its parameters to achieve (ε, δ)-probabilistic privacy. We also contrast our analysis of ZEALOUS with an analysis by Korolova et al. [17] that achieves (ε',δ')-indistinguishability. Our paper concludes with a large experimental study using real applications where we compare ZEALOUS and previous work that achieves k-anonymity in search log publishing. Our results show that ZEALOUS yields comparable utility to k-anonymity while at the same time achieving much stronger privacy guarantees.

บรรณานุกรม :
Gӧtz, Michaela , Machanavajjhala, Ashwin , Wang, Guozhang , Xiao, Xiaokui , Gehrke, Johannes . (2555). Publishing search logs—a comparative study of privacy guarantees.
    กรุงเทพมหานคร : Nanyang Technological University, Singapore.
Gӧtz, Michaela , Machanavajjhala, Ashwin , Wang, Guozhang , Xiao, Xiaokui , Gehrke, Johannes . 2555. "Publishing search logs—a comparative study of privacy guarantees".
    กรุงเทพมหานคร : Nanyang Technological University, Singapore.
Gӧtz, Michaela , Machanavajjhala, Ashwin , Wang, Guozhang , Xiao, Xiaokui , Gehrke, Johannes . "Publishing search logs—a comparative study of privacy guarantees."
    กรุงเทพมหานคร : Nanyang Technological University, Singapore, 2555. Print.
Gӧtz, Michaela , Machanavajjhala, Ashwin , Wang, Guozhang , Xiao, Xiaokui , Gehrke, Johannes . Publishing search logs—a comparative study of privacy guarantees. กรุงเทพมหานคร : Nanyang Technological University, Singapore; 2555.