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 accessAbstract
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.
Integrity signals
Registry
Cites
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.
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
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Cited by
ABY 3: A Mixed Protocol Framework for Machine Learning
Mohassel, P., & Rindal, P. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243760 · Cited by 432
Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications
Riazi, M. S., Weinert, C., Tkachenko, O., Songhori, E. M., Schneider, T., & Koushanfar, F. (2018) · Proceedings of the 2018 on Asia Conference on Computer and Communications Security · doi:10.1145/3196494.3196522 · Cited by 410
Self-citationObliVM: A Programming Framework for Secure Computation
Liu, C., Wang, X. S., Nayak, K., Huang, Y., & Shi, E. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.29 · Cited by 307
Privacy-preserving distributed linear regression on high-dimensional data
Gascón, A., Schoppmann, P., Balle, B., Raykova, M., Doerner, J., Zahur, S., & Evans, D. (2017) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2017-0053 · Cited by 193
Kim, J., Koo, D., Kim, Y., Yoon, H., Shin, J., & Kim, S. (2018) · ACM Transactions on Privacy and Security · doi:10.1145/3212509 · Cited by 74
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.