A user sensitive subject protection approach for book search service

In a digital library, book search is one of the most important information services. However, with the rapid development of network technologies such as cloud computing, the server‐side of a digital library is becoming more and more untrusted; thus, how to prevent the disclosure of users' book...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of the Association for Information Science and Technology Ročník 71; číslo 2; s. 183 - 195
Hlavní autoři: Wu, Zongda, Li, Renchao, Zhou, Zhifeng, Guo, Junfang, Jiang, Jionghui, Su, Xinning
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hoboken, USA John Wiley & Sons, Inc 01.02.2020
ISSN:2330-1635, 2330-1643
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In a digital library, book search is one of the most important information services. However, with the rapid development of network technologies such as cloud computing, the server‐side of a digital library is becoming more and more untrusted; thus, how to prevent the disclosure of users' book query privacy is causing people's increasingly extensive concern. In this article, we propose to construct a group of plausible fake queries for each user book query to cover up the sensitive subjects behind users' queries. First, we propose a basic framework for the privacy protection in book search, which requires no change to the book search algorithm running on the server‐side, and no compromise to the accuracy of book search. Second, we present a privacy protection model for book search to formulate the constraints that ideal fake queries should satisfy, that is, (i) the feature similarity, which measures the confusion effect of fake queries on users' queries, and (ii) the privacy exposure, which measures the cover‐up effect of fake queries on users' sensitive subjects. Third, we discuss the algorithm implementation for the privacy model. Finally, the effectiveness of our approach is demonstrated by theoretical analysis and experimental evaluation.
ISSN:2330-1635
2330-1643
DOI:10.1002/asi.24227