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

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

Quantitative Analysis of the Leakage of Confidential Data

Open access
Clark, David, Hunt, Sebastian, Malacaria, Pasquale · 2002 · Electronic Notes in Theoretical Computer Science

Abstract

Basic information theory is used to analyse the amount of confidential information which may be leaked by programs written in a very simple imperative language. In particular, a detailed analysis is given of the possible leakage due to equality tests and if statements. The analysis is presented as a set of syntax-directed inference rules and can readily be automated.

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.1016/s1571-0661(04)00290-7

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

Cites

  • Guessing and entropy

    Massey, J. L. (2002) · Proceedings of 1994 IEEE International Symposium on Information Theory · doi:10.1109/isit.1994.394764 · Cited by 463 · cited 1×

    “The relevance of entropy is then given by the following result, due to James L. Massey [Mas94]: the average number of guesses required to guess the secret is at least (1 / 4)2 n + 1. pairing We write < b , c > for the random variable <f, g> ( a ).”

Show all 1 references

Cited by

See all 167

Metadata

Authors
Clark, D., Hunt, S., & Malacaria, P.
Venue
Electronic Notes in Theoretical Computer Science
Publisher
Elsevier BV
Published
2002-11
Volume
59
Issue
3
Pages
238-251
ISSN
1571-0661 (ISSN-L)
OpenAlex
W2103759928
Cited by
167
References
1
FWCI
5.35
Type
journal article
Language
en
Open access
diamond

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: Quantitative Analysis of the Leakage of Confidential Data. https://app.cochat.ai/papers/10.1016/s1571-0661(04)00290-7
The paper
Clark, D., Hunt, S., & Malacaria, P. (2002). Quantitative Analysis of the Leakage of Confidential Data. Electronic Notes in Theoretical Computer Science. https://doi.org/10.1016/s1571-0661(04)00290-7

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.