Pith. sign in

REVIEW 2 cited by

On Privacy and Confidentiality of Communications in Organizational Graphs

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 2105.13418 v1 pith:VHBL3LPN submitted 2021-05-27 cs.CR cs.CLcs.LG

classification cs.CRcs.CLcs.LG
keywords privacyconfidentialitycorrelationmodelapproachdifferentiallanguagelearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Machine learned models trained on organizational communication data, such as emails in an enterprise, carry unique risks of breaching confidentiality, even if the model is intended only for internal use. This work shows how confidentiality is distinct from privacy in an enterprise context, and aims to formulate an approach to preserving confidentiality while leveraging principles from differential privacy. The goal is to perform machine learning tasks, such as learning a language model or performing topic analysis, using interpersonal communications in the organization, while not learning about confidential information shared in the organization. Works that apply differential privacy techniques to natural language processing tasks usually assume independently distributed data, and overlook potential correlation among the records. Ignoring this correlation results in a fictional promise of privacy. Naively extending differential privacy techniques to focus on group privacy instead of record-level privacy is a straightforward approach to mitigate this issue. This approach, although providing a more realistic privacy-guarantee, is over-cautious and severely impacts model utility. We show this gap between these two extreme measures of privacy over two language tasks, and introduce a middle-ground solution. We propose a model that captures the correlation in the social network graph, and incorporates this correlation in the privacy calculations through Pufferfish privacy principles.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Composition for Pufferfish Privacy

    cs.CR 2026-02 conditional novelty 7.0 of 10

    Pufferfish mechanisms compose linearly only under DP-style inequalities; any per-entry DP mechanism can be translated to a composable Pufferfish mechanism using the a(b)-influence curve.

  2. SoK: Practical Aspects of Releasing Differentially Private Graphs

    cs.CR 2026-03 accept novelty 6.0 of 10

    The authors provide a systematization of differentially private graph release methods along with an objective-based framework and two illustrative evaluations for social network analysts.

Pith tools