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

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

TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits

Open access
Songhori, Ebrahim M., Hussain, Siam U., Sadeghi, Ahmad-Reza, Schneider, Thomas, Koushanfar, Farinaz·2015·2015 IEEE Symposium on Security and Privacy

Abstract

We introduce Tiny Garble, a novel automated methodology based on powerful logic synthesis techniques for generating and optimizing compressed Boolean circuits used in secure computation, such as Yao's Garbled Circuit (GC) protocol. Tiny Garble achieves an unprecedented level of compactness and scalability by using a sequential circuit description for GC. We introduce new libraries and transformations, such that our sequential circuits can be optimized and securely evaluated by interfacing with available garbling frameworks. The circuit compactness makes the memory footprint of the garbling operation fit in the processor cache, resulting in fewer cache misses and thereby less CPU cycles. Our proof-of-concept implementation of benchmark functions using Tiny Garble demonstrates a high degree of compactness and scalability. We improve the results of existing automated tools for GC generation by orders of magnitude, for example, Tiny Garble can compress the memory footprint required for 1024-bit multiplication by a factor of 4,172, while decreasing the number of non-XOR gates by 67%. Moreover, with Tiny Garble we are able to implement functions that have never been reported before, such as SHA-3. Finally, our sequential description enables us to design and realize a garbled processor, using the MIPS I instruction set, for private function evaluation. To the best of our knowledge, this is the first scalable emulation of a general purpose processor.

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.1109/sp.2015.32

Cites

2 of 2 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 2 references

Cited by

See all 210

Metadata

Authors
Songhori, E. M., Hussain, S. U., Sadeghi, A.-R., Schneider, T., & Koushanfar, F.
Venue
2015 IEEE Symposium on Security and Privacy
Publisher
IEEE
Published
2015-05
Pages
411-428
ISSN
1081-6011 (ISSN-L)
OpenAlex
W1493343761
Cited by
210
References
2
FWCI
17.42
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: TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits. https://app.cochat.ai/papers/10.1109/sp.2015.32
The paper
Songhori, E. M., Hussain, S. U., Sadeghi, A.-R., Schneider, T., & Koushanfar, F. (2015). TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits. 2015 IEEE Symposium on Security and Privacy. https://doi.org/10.1109/sp.2015.32

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.