Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently
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.
Integrity signals
Registry
Cites
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.
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
Pinocchio: Nearly Practical Verifiable Computation
Parno, B., Howell, J., Gentry, C., & Raykova, M. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.47 · Cited by 864
Cited by
Practical Secure Aggregation for Privacy-Preserving Machine Learning
Bonawitz, K., Ivanov, V., Kreuter, B., Marcedone, A., McMahan, H. B., Patel, S., Ramage, D., Segal, A., & Seth, K. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3133982 · Cited by 3,956
“Unfortunately, even using the best-known garbled circuit techniques [35], even one such proof would be more costly than the entire protocol.”
BackgroundTwo Halves Make a Whole: Reducing Data Transfer in Garbled Circuits Using Half Gates
Zahur, S., Rosulek, M., & Evans, D. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_8 · Cited by 367
Albrecht, M. R., Rechberger, C., Schneider, T., Tiessen, T., & Zohner, M. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_17 · Cited by 290
Zero trust: Never trust, always verify
Wylde, A. (2021) · 2021 International Conference on Cyber Situational Awareness, Data Analytics and Assessment (CyberSA) · doi:10.1109/cybersa52016.2021.9478244 · Cited by 62
“This procedure is founded on the properties of validity, privacy and fairness/correctness [17].”
BackgroundMethodInfluentialRaziel: Private and Verifiable Smart Contracts on Blockchains
Sánchez, D. C. (2018) · arXiv · doi:10.48550/arxiv.1807.09484 · Cited by 41
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.