A New Approach to Garbled Circuits

Anasuya Acharya; Tomer Ashur; Efrat Cohen; Carmit Hazay; Avishay Yanai

doi:10.1007/978-3-031-33491-7_23

A New Approach to Garbled Circuits

Anasuya Acharya, Tomer Ashur, Efrat Cohen, Carmit Hazay, Avishay Yanai

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

A garbling scheme is a fundamental cryptographic building block with a long list of applications. The study of different techniques for garbling a function, towards optimizing computation and communication complexity, has been an area of active research. Most common garbling techniques work by representing each gate in the circuit as a set of ciphertexts that encrypt its truth table row-by-row. In this work we present a new garbling scheme in the random oracle (RO) model that garbles circuits in the gate-by-gate paradigm by capturing the gate functionality (AND, XOR ) as a whole rather than as a set of ciphertexts. The final gate garbling requires 4 κ bits of communication in expectation, 4 RO calls for garbling and 1 RO call for evaluation. We prove that the scheme satisfies privacy in the non-programmable random oracle model and against PPT adversaries. We also show how this scheme can be extended to support free-XOR and garble any gate functionality over binary inputs.

Original language	English
Title of host publication	Applied Cryptography and Network Security - 21st International Conference, ACNS 2023, Proceedings
Editors	Mehdi Tibouchi, XiaoFeng Wang
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	611-641
Number of pages	31
ISBN (Print)	9783031334900
DOIs	https://doi.org/10.1007/978-3-031-33491-7_23
State	Published - 2023
Event	21st International Conference on Applied Cryptography and Network Security, ACNS 2023 - Kyoto, Japan Duration: 19 Jun 2023 → 22 Jun 2023

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13906 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	21st International Conference on Applied Cryptography and Network Security, ACNS 2023
Country/Territory	Japan
City	Kyoto
Period	19/06/23 → 22/06/23

Bibliographical note

Publisher Copyright:
© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Keywords

Garbled Circuits
Gate-by-Gate Garbling
Random Oracles

Access to Document

10.1007/978-3-031-33491-7_23

Cite this

Acharya, A., Ashur, T., Cohen, E., Hazay, C., & Yanai, A. (2023). A New Approach to Garbled Circuits. In M. Tibouchi, & X. Wang (Eds.), Applied Cryptography and Network Security - 21st International Conference, ACNS 2023, Proceedings (pp. 611-641). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13906 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-33491-7_23

Acharya, Anasuya ; Ashur, Tomer ; Cohen, Efrat et al. / A New Approach to Garbled Circuits. Applied Cryptography and Network Security - 21st International Conference, ACNS 2023, Proceedings. editor / Mehdi Tibouchi ; XiaoFeng Wang. Springer Science and Business Media Deutschland GmbH, 2023. pp. 611-641 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5a474c4cdd754de1b8a50c9a86ff081f,

title = "A New Approach to Garbled Circuits",

abstract = "A garbling scheme is a fundamental cryptographic building block with a long list of applications. The study of different techniques for garbling a function, towards optimizing computation and communication complexity, has been an area of active research. Most common garbling techniques work by representing each gate in the circuit as a set of ciphertexts that encrypt its truth table row-by-row. In this work we present a new garbling scheme in the random oracle (RO) model that garbles circuits in the gate-by-gate paradigm by capturing the gate functionality (AND, XOR ) as a whole rather than as a set of ciphertexts. The final gate garbling requires 4 κ bits of communication in expectation, 4 RO calls for garbling and 1 RO call for evaluation. We prove that the scheme satisfies privacy in the non-programmable random oracle model and against PPT adversaries. We also show how this scheme can be extended to support free-XOR and garble any gate functionality over binary inputs.",

keywords = "Garbled Circuits, Gate-by-Gate Garbling, Random Oracles",

author = "Anasuya Acharya and Tomer Ashur and Efrat Cohen and Carmit Hazay and Avishay Yanai",

note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 21st International Conference on Applied Cryptography and Network Security, ACNS 2023 ; Conference date: 19-06-2023 Through 22-06-2023",

year = "2023",

doi = "10.1007/978-3-031-33491-7_23",

language = "אנגלית",

isbn = "9783031334900",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "611--641",

editor = "Mehdi Tibouchi and XiaoFeng Wang",

booktitle = "Applied Cryptography and Network Security - 21st International Conference, ACNS 2023, Proceedings",

address = "גרמניה",

}

Acharya, A, Ashur, T, Cohen, E, Hazay, C & Yanai, A 2023, A New Approach to Garbled Circuits. in M Tibouchi & X Wang (eds), Applied Cryptography and Network Security - 21st International Conference, ACNS 2023, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13906 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 611-641, 21st International Conference on Applied Cryptography and Network Security, ACNS 2023, Kyoto, Japan, 19/06/23. https://doi.org/10.1007/978-3-031-33491-7_23

A New Approach to Garbled Circuits. / Acharya, Anasuya; Ashur, Tomer; Cohen, Efrat et al.
Applied Cryptography and Network Security - 21st International Conference, ACNS 2023, Proceedings. ed. / Mehdi Tibouchi; XiaoFeng Wang. Springer Science and Business Media Deutschland GmbH, 2023. p. 611-641 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13906 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A New Approach to Garbled Circuits

AU - Acharya, Anasuya

AU - Ashur, Tomer

AU - Cohen, Efrat

AU - Hazay, Carmit

AU - Yanai, Avishay

PY - 2023

Y1 - 2023

N2 - A garbling scheme is a fundamental cryptographic building block with a long list of applications. The study of different techniques for garbling a function, towards optimizing computation and communication complexity, has been an area of active research. Most common garbling techniques work by representing each gate in the circuit as a set of ciphertexts that encrypt its truth table row-by-row. In this work we present a new garbling scheme in the random oracle (RO) model that garbles circuits in the gate-by-gate paradigm by capturing the gate functionality (AND, XOR ) as a whole rather than as a set of ciphertexts. The final gate garbling requires 4 κ bits of communication in expectation, 4 RO calls for garbling and 1 RO call for evaluation. We prove that the scheme satisfies privacy in the non-programmable random oracle model and against PPT adversaries. We also show how this scheme can be extended to support free-XOR and garble any gate functionality over binary inputs.

AB - A garbling scheme is a fundamental cryptographic building block with a long list of applications. The study of different techniques for garbling a function, towards optimizing computation and communication complexity, has been an area of active research. Most common garbling techniques work by representing each gate in the circuit as a set of ciphertexts that encrypt its truth table row-by-row. In this work we present a new garbling scheme in the random oracle (RO) model that garbles circuits in the gate-by-gate paradigm by capturing the gate functionality (AND, XOR ) as a whole rather than as a set of ciphertexts. The final gate garbling requires 4 κ bits of communication in expectation, 4 RO calls for garbling and 1 RO call for evaluation. We prove that the scheme satisfies privacy in the non-programmable random oracle model and against PPT adversaries. We also show how this scheme can be extended to support free-XOR and garble any gate functionality over binary inputs.

KW - Garbled Circuits

KW - Gate-by-Gate Garbling

KW - Random Oracles

UR - http://www.scopus.com/inward/record.url?scp=85179761217&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-33491-7_23

DO - 10.1007/978-3-031-33491-7_23

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85179761217

SN - 9783031334900

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 611

EP - 641

BT - Applied Cryptography and Network Security - 21st International Conference, ACNS 2023, Proceedings

A2 - Tibouchi, Mehdi

A2 - Wang, XiaoFeng

PB - Springer Science and Business Media Deutschland GmbH

T2 - 21st International Conference on Applied Cryptography and Network Security, ACNS 2023

Y2 - 19 June 2023 through 22 June 2023

ER -

Acharya A, Ashur T, Cohen E, Hazay C, Yanai A. A New Approach to Garbled Circuits. In Tibouchi M, Wang X, editors, Applied Cryptography and Network Security - 21st International Conference, ACNS 2023, Proceedings. Springer Science and Business Media Deutschland GmbH. 2023. p. 611-641. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-33491-7_23