[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2095536.2095577acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiiwasConference Proceedingsconference-collections
research-article

Preserving privacy on the searchable internet

Published: 05 December 2011 Publication History

Abstract

The Web is the largest repository of information. Personal information is usually scattered on various pages of different websites. Search engines have made it easier to find personal information. An attacker may collect a user's scattered information together via search engines, and infer some privacy information. We call this kind of privacy attack Privacy Inference Attack via Search Engines.
In this paper, we propose a user-side automatic detection service for detecting the privacy leakage before publishing personal information. In the user-side service, we construct a User Information Correlation (UICA) graph to model the association between user information returned by search engines. We map the privacy inference attack into a decision problem of searching a privacy inferring path with the maximal probability in the UICA graph. We propose a Privacy Leakage Detection Probability (PLD-Probability) algorithm to find the privacy inferring path. Extensive experiments indicate that the algorithm is reasonable and effective.

References

[1]
T. McIntosh and J. R. Curran, Weighted Mutual Exclusion Bootstrapping for Domain Independent Lexicon and Template Acquisition, in Proceeding of the Australasian Language Technology Workshop, Hobart, Australia, 2008.
[2]
L. Sweeney, "K-anonymity: A model for protecting privacy," International Journal on uncertainty, Fuzziness and Knowledge-based System, vol. 10, pp. 557--570, 2002.
[3]
P. Samarati and L. Sweeney, "Generalizing data to provide anonymity when disclosing information," in PODS98.
[4]
C. Dwyer and S. R. Hiltz, "Trust and privacy concern within social networking sites: A comparison of facebook and myspace," in Proceedings of AMCIS 2007, Colorado.
[5]
R. Feizy, "An evaluation of identity on online social networking: Myspace (poster)," in ACM Hypertext and Hypermedia (HT), 2007.
[6]
M. Mannan and P. C. van Oorschot, "Privacy-enhanced sharing of personal content on the web," in Proceeding of the 17th international conference on World Wide Web (WWW'08), Beijing, China, 2008, pp. 487--496.
[7]
M. Bellare and C. Namprempre, "Authenticated encryption: Relations among notions and analysis of the generic composition paradigm," in AsiaCrypt, 2000.
[8]
R. Gross and A. Acquisti, "Information revelation and privacy in online social networks," in ACM Workshop on Privacy in the Electronic Society (WPES), 2005.
[9]
G. Luo, C. Tang, and Y. li Tian, "Answering relationship queries on the web," in Proceeding of the 16th international conference on World Wide Web (WWW'07), Banff, Canada, May 2007, pp. 561--570.
[10]
F. L. Sanda Harabagiu and A. Hickl, "Answering complex questions with random walk models," in SIGIR'06, 2006, pp. 220--227.
[11]
V. K. P. Tan and J. Srivastava, "Indirect association: Mining higher order dependencies in data," in PKDD'00, 2000, pp. 632--637.

Cited By

View all
  • (2016)Anonymizing multimedia documentsWorld Wide Web10.1007/s11280-015-0327-319:1(135-155)Online publication date: 1-Jan-2016
  • (2013)de-linkabilityProceedings of the Fifth International Conference on Management of Emergent Digital EcoSystems10.1145/2536146.2536161(68-75)Online publication date: 28-Oct-2013

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
iiWAS '11: Proceedings of the 13th International Conference on Information Integration and Web-based Applications and Services
December 2011
572 pages
ISBN:9781450307840
DOI:10.1145/2095536
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 December 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. inference
  2. privacy
  3. search engines

Qualifiers

  • Research-article

Funding Sources

Conference

MoMM '11

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2016)Anonymizing multimedia documentsWorld Wide Web10.1007/s11280-015-0327-319:1(135-155)Online publication date: 1-Jan-2016
  • (2013)de-linkabilityProceedings of the Fifth International Conference on Management of Emergent Digital EcoSystems10.1145/2536146.2536161(68-75)Online publication date: 28-Oct-2013

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media