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

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Secure and private sequence comparisons

Atallah, Mikhail J., Kerschbaum, Florian, Du, Wenliang·2003·Proceedings of the 2003 ACM workshop on Privacy in the electronic society

Abstract

We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other than what can be inferred from the edit distance between their two sequences – which is unavoidable because computing that distance is the purpose of the protocol). The amount of communication done by our protocol is proportional to the time complexity of the best-known algorithm for performing the sequence comparison. The problem of determining the similarity between two sequences arises in a large number of applications, in partic-ular in bioinformatics. In these application areas, the edit distance is one of the most widely used notions of sequence similarity: It is the least-cost set of insertions, deletions, and substitutions required to transform one string into the other. The generalizations of edit distance that are solved by the same kind of dynamic programming recurrence rela-tion as the one for edit distance, cover an even wider domain of applications.

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/1005140.1005147

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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 196

Metadata

Authors
Atallah, M. J., Kerschbaum, F., & Du, W.
Venue
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Publisher
ACM
Published
2003-10-30
Pages
39-44
OpenAlex
W2165785801
Cited by
196
References
1
FWCI
3.44
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: Secure and private sequence comparisons. https://app.cochat.ai/papers/10.1145/1005140.1005147
The paper
Atallah, M. J., Kerschbaum, F., & Du, W. (2003). Secure and private sequence comparisons. Proceedings of the 2003 ACM workshop on Privacy in the electronic society. https://doi.org/10.1145/1005140.1005147

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.