Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 200

The DOI matches its Crossref record.

Practical Multi-party Private Set Intersection from Symmetric-Key Techniques

Kolesnikov, Vladimir, Matania, Naor, Pinkas, Benny, Rosulek, Mike, Trieu, Ni·2017·Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security

Abstract

We present a new paradigm for multi-party private set intersection (PSI) that allows $n$ parties to compute the intersection of their datasets without revealing any additional information. We explore a variety of instantiations of this paradigm. Our protocols avoid computationally expensive public-key operations and are secure in the presence of any number of semi-honest participants (i.e., without an honest majority).

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3133956.3134065

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 200

Metadata

Authors
Kolesnikov, V., Matania, N., Pinkas, B., Rosulek, M., & Trieu, N.
Venue
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security
Publisher
ACM
Published
2017-10-30
Volume
2017
Pages
1257-1272
OpenAlex
W2767023267
Cited by
200
References
0
FWCI
4.83
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Practical Multi-party Private Set Intersection from Symmetric-Key Techniques. https://app.cochat.ai/papers/10.1145/3133956.3134065
The paper
Kolesnikov, V., Matania, N., Pinkas, B., Rosulek, M., & Trieu, N. (2017). Practical Multi-party Private Set Intersection from Symmetric-Key Techniques. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. https://doi.org/10.1145/3133956.3134065

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.