BitGC: Garbled Circuits with 1 Bit per Gate

Hanlin Liu, Xiao Wang, Kang Yang, Yu Yu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

We present BitGC, a garbling scheme for Boolean circuits with 1 bit per gate communication based on either ring learning with errors (RLWE) or NTRU assumption, with key-dependent message security. The garbling consists of 1) a homomorphically encrypted seed that can be expanded to encryption of many pseudo-random bits and 2) one-bit stitching information per gate to reconstruct garbled tables from the expanded ciphertexts. By using low-complexity PRGs, both the garbling and evaluation of each gate require only O(1) homomorphic addition/multiplication operations without bootstrapping.

Original languageEnglish
Title of host publicationAdvances in Cryptology – EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
EditorsSerge Fehr, Pierre-Alain Fouque
PublisherSpringer Science and Business Media Deutschland GmbH
Pages437-466
Number of pages30
ISBN (Print)9783031910975
DOIs
StatePublished - 2025
Externally publishedYes
Event44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2025 - Madrid, Spain
Duration: 4 May 20258 May 2025

Publication series

NameLecture Notes in Computer Science
Volume15607 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2025
Country/TerritorySpain
CityMadrid
Period4/05/258/05/25

Fingerprint

Dive into the research topics of 'BitGC: Garbled Circuits with 1 Bit per Gate'. Together they form a unique fingerprint.

Cite this