CoChat

Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently

Jawurek, Marek, Kerschbaum, Florian, Orlandi, Claudio · 2013 · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13
Cited by 146

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

Abstract

Zero-knowledge protocols are one of the fundamental concepts in modern cryptography and have countless applications. However, after more than 30 years from their introduction, there are only very few languages (essentially those with a group structure) for which we can construct zero-knowledge protocols that are efficient enough to be used in practice.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1145/2508859.2516662

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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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 1 references

Cited by

See all 146

Metadata

Authors
Jawurek, M., Kerschbaum, F., & Orlandi, C.
Venue
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13
Publisher
ACM Press
Published
2013
Pages
955-966
OpenAlex
W2058648304
Cited by
146
References
1
FWCI
5.42
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: Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. https://app.cochat.ai/papers/10.1145/2508859.2516662
The paper
Jawurek, M., Kerschbaum, F., & Orlandi, C. (2013). Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13. https://doi.org/10.1145/2508859.2516662

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.