Pith. sign in

REVIEW 1 cited by

Privacy in Open Search: A Review of Challenges and Solutions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.10720 v4 pith:QSLBUFAR submitted 2021-10-20 cs.CR cs.AIcs.IR

classification cs.CRcs.AIcs.IR
keywords privacydatataskschallengesemployedmechanismsopenprivacy-preserving
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Privacy is of worldwide concern regarding activities and processes that include sensitive data. For this reason, many countries and territories have been recently approving regulations controlling the extent to which organizations may exploit data provided by people. Artificial intelligence areas, such as machine learning and natural language processing, have already successfully employed privacy-preserving mechanisms in order to safeguard data privacy in a vast number of applications. Information retrieval (IR) is likewise prone to privacy threats, such as attacks and unintended disclosures of documents and search history, which may cripple the security of users and be penalized by data protection laws. This work aims at highlighting and discussing open challenges for privacy in the recent literature of IR, focusing on tasks featuring user-generated text data. Our contribution is threefold: firstly, we present an overview of privacy threats to IR tasks; secondly, we discuss applicable privacy-preserving mechanisms which may be employed in solutions to restrain privacy hazards; finally, we bring insights on the tradeoffs between privacy preservation and utility performance for IR tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Effective and secure federated online learning to rank

    cs.LG 2024-12 conditional novelty 4.0 of 10

    A thesis shows that a pairwise gradient-based online ranker can be federated as FPDGD, and analyzes non-IID data, poisoning attacks, and unlearning in federated online learning to rank.

Pith tools