TY - GEN
T1 - CRGC
T2 - 19th International Conference on Security and Cryptography, SECRYPT 2022
AU - Harth-Kitzerow, Christopher
AU - Carle, Georg
AU - Fei, Fan
AU - Luckow, Andre
AU - Klepsch, Johannes
N1 - Publisher Copyright:
© 2021 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved.
PY - 2022
Y1 - 2022
N2 - In this work, we introduce two schemes to construct reusable garbled circuits (RGCs) in the semi-honest setting. Our completely reusable garbled circuit (CRGC) scheme allows the generator (party A) to construct and send an obfuscated boolean circuit along with an encoded input to the evaluator (party B). In contrast to Yao’s Garbled Circuit protocol, B can securely evaluate the same CRGC with an arbitrary number of inputs. As a tradeoff, CRGCs predictably leak some input bits of A to B. We also propose a partially reusable garbled circuit (PRGC) scheme that divides a circuit into reusable and non-reusable sections. PRGCs do not leak input bits of A. We benchmark our CRGC implementation against the state-of-the-art garbled circuit libraries EMP SH2PC and TinyGarble2. Using our framework, evaluating a CRGC is up to twenty times faster, albeit with weaker privacy guarantees, than evaluating an equivalent garbled circuit constructed by the two existing libraries. Our open-source library can convert any C++ function to a CRGC at approx. 80 million gates per second and repeatedly evaluate a CRGC at approx. 350 million gates per second. Additionally, a compressed CRGC is approx. 75% smaller in file size than the unobfuscated boolean circuit.
AB - In this work, we introduce two schemes to construct reusable garbled circuits (RGCs) in the semi-honest setting. Our completely reusable garbled circuit (CRGC) scheme allows the generator (party A) to construct and send an obfuscated boolean circuit along with an encoded input to the evaluator (party B). In contrast to Yao’s Garbled Circuit protocol, B can securely evaluate the same CRGC with an arbitrary number of inputs. As a tradeoff, CRGCs predictably leak some input bits of A to B. We also propose a partially reusable garbled circuit (PRGC) scheme that divides a circuit into reusable and non-reusable sections. PRGCs do not leak input bits of A. We benchmark our CRGC implementation against the state-of-the-art garbled circuit libraries EMP SH2PC and TinyGarble2. Using our framework, evaluating a CRGC is up to twenty times faster, albeit with weaker privacy guarantees, than evaluating an equivalent garbled circuit constructed by the two existing libraries. Our open-source library can convert any C++ function to a CRGC at approx. 80 million gates per second and repeatedly evaluate a CRGC at approx. 350 million gates per second. Additionally, a compressed CRGC is approx. 75% smaller in file size than the unobfuscated boolean circuit.
KW - Garbled Circuits
KW - Privacy Enhancing Technologies
KW - Secure Multiparty Computation
UR - http://www.scopus.com/inward/record.url?scp=85178505552&partnerID=8YFLogxK
U2 - 10.5220/0011145300003283
DO - 10.5220/0011145300003283
M3 - Conference contribution
AN - SCOPUS:85178505552
SN - 9789897585906
T3 - Proceedings of the International Conference on Security and Cryptography
SP - 83
EP - 95
BT - SECRYPT 2022 - Proceedings of the 19th International Conference on Security and Cryptography
A2 - De Capitani di Vimercati, Sabrina
A2 - Samarati, Pierangela
PB - Science and Technology Publications, Lda
Y2 - 11 July 2022 through 13 July 2022
ER -