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

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

Witness indistinguishable and witness hiding protocols

Open access
Feige, U., Shamir, A.·1990·Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90

Abstract

A two party protocol in which party A uses one of several secret witnesses to an NP assertion is witness indistinguishable if party B cannot tell which witness A is actually using.The protocol is witness hiding if by the end of the protocol B cannot compute any new witness which he did not know before the protocol began.Witness hiding is a natural security requirement, and can replace zero knowledge in many cryptographic protocols.We prove two central results: 1.Unlike zero knowledge protocols, witness indistinguishablity is preserved under arbitrary composition of protocols, including parallel execution.2. If a statement has at least two independent witnesses, then any witness indistinguishable protocol for this statement is also witness hiding.part of the paper is devoted to showing that if a protocol is WI, and if w(z) contains at least two independent witnesses, then the protocol must be WH.The WH property is a natural property which is sufficient to guarantee overall security of many cryptographic schemes (nontransitivity of proofs of knowledge, unforgeable proofs of identity etc.).It is natural to compare the concept of WH to that of zero knowledge (ZK [15]).ZK guarantees that no information whatsoever leaks during the execution of

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

Cites

13 of 13 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

Show all 13 references

Cited by

See all 523

Metadata

Authors
Feige, U., & Shamir, A.
Venue
Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90
Publisher
ACM Press
Published
1990
Pages
416-426
OpenAlex
W2142968417
Cited by
523
References
13
FWCI
3.40
Type
conference paper
Language
en
Open access
bronze

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: Witness indistinguishable and witness hiding protocols. https://app.cochat.ai/papers/10.1145/100216.100272
The paper
Feige, U., & Shamir, A. (1990). Witness indistinguishable and witness hiding protocols. Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90. https://doi.org/10.1145/100216.100272

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.