research-article

Public Access

Garbling Gadgets for Boolean and Arithmetic Circuits

Authors:

Mike RosulekAuthors Info & Claims

CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

Pages 565 - 577

https://doi.org/10.1145/2976749.2978410

Published: 24 October 2016 Publication History

Abstract

We present simple, practical, and powerful new techniques for garbled circuits. These techniques result in significant concrete and asymptotic improvements over the state of the art, for several natural kinds of computations. For arithmetic circuits over the integers, our construction results in garbled circuits with free addition, weighted threshold gates with cost independent of fan-in, and exponentiation by a fixed exponent with cost independent of the exponent. For boolean circuits, our construction gives an exponential improvement over the state of the art for threshold gates (including AND/OR gates) of high fan-in.

Our construction can be efficiently instantiated with practical symmetric-key primitives (e.g., AES), and is proven secure under similar assumptions to that of the Free-XOR garbling scheme (Kolesnikov & Schneider, ICALP 2008). We give an extensive comparison between our scheme and state-of-the-art garbling schemes applied to boolean circuits.

References

[1]

Applebaum, B., Avron, J., and Brzuska, C. Arithmetic cryptography: Extended abstract. In ITCS 2015 (Jan. 2015), T. Roughgarden, Ed., ACM, pp. 143--151.

Digital Library

[2]

Applebaum, B., Ishai, Y., and Kushilevitz, E. How to garble arithmetic circuits. In 52nd FOCS (Oct. 2011), R. Ostrovsky, Ed., IEEE Computer Society Press, pp. 120--129.

Digital Library

[3]

Asharov, G., Lindell, Y., Schneider, T., and Zohner, M. More efficient oblivious transfer and extensions for faster secure computation. In ACM CCS 13 (Nov. 2013), A.-R. Sadeghi, V. D. Gligor, and M. Yung, Eds., ACM Press, pp. 535--548.

Digital Library

[4]

Beaver, D. Correlated pseudorandomness and the complexity of private computations. In 28th ACM STOC (May 1996), ACM Press, pp. 479--488.

Digital Library

[5]

Beaver, D., Micali, S., and Rogaway, P. The round complexity of secure protocols (extended abstract). In 22nd ACM STOC (May 1990), ACM Press, pp. 503--513.

Digital Library

[6]

Bellare, M., Hoang, V. T., Keelveedhi, S., and Rogaway, P. Efficient garbling from a fixed-key blockcipher. In 2013 IEEE Symposium on Security and Privacy (May 2013), IEEE Computer Society Press, pp. 478--492.

Digital Library

[7]

Bellare, M., Hoang, V. T., and Rogaway, P. Foundations of garbled circuits. In ACM CCS 12 (Oct. 2012), T. Yu, G. Danezis, and V. D. Gligor, Eds., ACM Press, pp. 784--796.

Digital Library

[8]

Berkeley Verification and Synthesis Research Center. ABC: a system for sequential synthesis and verification. http://www.eecs.berkeley.edu/alanmi/abc/.

[9]

Choi, S. G., Katz, J., Kumaresan, R., and Zhou, H.-S. On the security of the "free-XOR" technique. In TCC 2012 (Mar. 2012), R. Cramer, Ed., vol. 7194 of LNCS, Springer, Heidelberg, pp. 39--53.

Digital Library

[10]

Galois, Inc. Cryptol: The language of cryptography. http://www.cryptol.net/.

[11]

Gueron, S., Lindell, Y., Nof, A., and Pinkas, B. Fast garbling of circuits under standard assumptions. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12--6, 2015 (2015), I. Ray, N. Li, and C. Kruegel, Eds., ACM, pp. 567--578.

Digital Library

[12]

Ishai, Y., Kilian, J., Nissim, K., and Petrank, E. Extending oblivious transfers efficiently. In CRYPTO 2003 (Aug. 2003), D. Boneh, Ed., vol. 2729 of LNCS, Springer, Heidelberg, pp. 145--161.

[13]

Kolesnikov, V., Mohassel, P., and Rosulek, M. FleXOR: Flexible garbling for XOR gates that beats free-XOR. In CRYPTO 2014, Part II (Aug. 2014), J. A. Garay and R. Gennaro, Eds., vol. 8617 of LNCS, Springer, Heidelberg, pp. 440--457.

[14]

Kolesnikov, V., and Schneider, T. Improved garbled circuit: Free xor gates and applications. In Automata, Languages and Programming. Springer, 2008, pp. 486--498.

Digital Library

[15]

Malkin, T., Pastro, V., and shelat, a. An algebraic approach to garbling. Unpublished manuscript. See https://simons.berkeley.edu/talks/tal-malkin-2015-06--10, 2016.

[16]

Naor, M., Pinkas, B., and Sumner, R. Privacy preserving auctions and mechanism design. In Proceedings of the 1st ACM conference on Electronic commerce (1999), ACM, pp. 129--139.

Digital Library

[17]

Nielsen, J. B., and Orlandi, C. LEGO for two-party secure computation. In TCC 2009 (Mar. 2009), O. Reingold, Ed., vol. 5444 of LNCS, Springer, Heidelberg, pp. 368--386.

Digital Library

[18]

Pinkas, B., Schneider, T., Smart, N. P., and Williams, S. C. Secure two-party computation is practical. In ASIACRYPT 2009 (Dec. 2009), M. Matsui, Ed., vol. 5912 of LNCS, Springer, Heidelberg, pp. 250--267.

Digital Library

[19]

Wolf, C. Yosys open synthesis suite. http://www.clifford.at/yosys/.

[20]

Yao, A. C.-C. How to generate and exchange secrets (extended abstract). In 27th FOCS (Oct. 1986), IEEE Computer Society Press, pp. 162--167.

Digital Library

[21]

Zahur, S., Rosulek, M., and Evans, D. Two halves make a whole - reducing data transfer in garbled circuits using half gates. In EUROCRYPT 2015, Part II (Apr. 2015), E. Oswald and M. Fischlin, Eds., vol. 9057 of LNCS, Springer, Heidelberg, pp. 220--250.

Cited By

Lu YZhang BRen K(2025)Load-Balanced Server-Aided MPC in Heterogeneous ComputingIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.349454720(114-128)Online publication date: 2025
https://doi.org/10.1109/TIFS.2024.3494547
Pohle EAbidin APreneel B(2024)Fast Evaluation of S-Boxes With Garbled CircuitsIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.340214519(5530-5544)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3402145
Sarmadi AFu HKrishnamurthy PGarg SKhorrami F(2024)Privacy-Preserving Collaborative Learning Through Feature ExtractionIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2023.326350721:1(486-498)Online publication date: Jan-2024
https://doi.org/10.1109/TDSC.2023.3263507
Show More Cited By

Index Terms

Garbling Gadgets for Boolean and Arithmetic Circuits
1. Security and privacy
  1. Cryptography
    1. Symmetric cryptography and hash functions

Recommendations

Breaking and Fixing Garbled Circuits When a Gate has Duplicate Input Wires
Abstract
Garbled circuits are a fundamental cryptographic primitive that allows two or more parties to securely evaluate an arbitrary Boolean circuit without revealing any information beyond the output using a constant number of communication rounds. ...
Efficient Arithmetic in Garbled Circuits
Advances in Cryptology – EUROCRYPT 2024
Abstract
Garbled Circuit (GC) techniques usually work with Boolean circuits. Despite intense interest, efficient arithmetic generalizations of GC were only known from strong assumptions, such as LWE.
We construct symmetric-key-based arithmetic garbled ... $_{}$ $_{}$ $_{}$ $_{}$ $^{}$ $^{}$
On Multiparty Garbling of Arithmetic Circuits
Advances in Cryptology – ASIACRYPT 2018
Abstract
We initiate a study of garbled circuits that contain both Boolean and arithmetic gates in secure multiparty computation. In particular, we incorporate the garbling gadgets for arithmetic circuits recently presented by Ball, Malkin, and Rosulek (...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

October 2016

1924 pages

ISBN:9781450341394

DOI:10.1145/2976749

General Chairs:
Edgar Weippl
SBA Research, Austria
,
Stefan Katzenbeisser
TU Darmstadt, CYSEC, Germany
,
Program Chairs:
Christopher Kruegel
University of California, Santa Barbara, USA
,
Andrew Myers
Cornell University, USA
,
Shai Halevi
IBM Research, USA

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 October 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

CCS'16

Sponsor:

SIGSAC

CCS'16: 2016 ACM SIGSAC Conference on Computer and Communications Security

October 24 - 28, 2016

Vienna, Austria

Acceptance Rates

CCS '16 Paper Acceptance Rate 137 of 831 submissions, 16%;

Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

38
Total Citations
View Citations
1,312
Total Downloads

Downloads (Last 12 months)201
Downloads (Last 6 weeks)33

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Lu YZhang BRen K(2025)Load-Balanced Server-Aided MPC in Heterogeneous ComputingIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.349454720(114-128)Online publication date: 2025
https://doi.org/10.1109/TIFS.2024.3494547
Pohle EAbidin APreneel B(2024)Fast Evaluation of S-Boxes With Garbled CircuitsIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.340214519(5530-5544)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3402145
Sarmadi AFu HKrishnamurthy PGarg SKhorrami F(2024)Privacy-Preserving Collaborative Learning Through Feature ExtractionIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2023.326350721:1(486-498)Online publication date: Jan-2024
https://doi.org/10.1109/TDSC.2023.3263507
Meyer POrlandi CRoy LScholl P(2024)Rate-1 Arithmetic Garbling From Homomorphic Secret SharingTheory of Cryptography10.1007/978-3-031-78023-3_3(71-97)Online publication date: 3-Dec-2024
https://doi.org/10.1007/978-3-031-78023-3_3
Hristov-Kalamov NFernández-Ruiz Rálvarez-Marquina ANúñez-Vidal EDomínguez-Mateos FPalacios-Alonso D(2024)Comparison of an Accelerated Garble Embedding Methodology for Privacy Preserving in Biomedical Data AnalyticsArtificial Intelligence for Neuroscience and Emotional Systems10.1007/978-3-031-61140-7_28(282-299)Online publication date: 31-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-61140-7_28
Li HLiu T(2024)How to Garble Mixed Circuits that Combine Boolean and Arithmetic ComputationsAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58751-1_12(331-360)Online publication date: 29-Apr-2024
https://doi.org/10.1007/978-3-031-58751-1_12
Hazay CYang Y(2024)Toward Malicious Constant-Rate 2PC via Arithmetic GarblingAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58740-5_14(401-431)Online publication date: 26-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-58740-5_14
Heath D(2024)Efficient Arithmetic in Garbled CircuitsAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58740-5_1(3-31)Online publication date: 26-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-58740-5_1
Yu MMarakkalage DDe Micheli G(2023)Garbled Circuits Reimagined: Logic Synthesis Unleashes Efficient Secure ComputationCryptography10.3390/cryptography70400617:4(61)Online publication date: 23-Nov-2023
https://doi.org/10.3390/cryptography7040061
Beck GGoel AHegde AJain AJin ZKaptchuk GMeng WJensen CCremers CKirda E(2023)Scalable Multiparty GarblingProceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security10.1145/3576915.3623132(2158-2172)Online publication date: 15-Nov-2023
https://dl.acm.org/doi/10.1145/3576915.3623132
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents