Paper 2024/1988 Original: eprint.iacr.org/2024/1988 ↗
BitGC: Garbled Circuits with 1 Bit per Gate
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2025-03-12: last updated
- 2024-12-09: published
- Short URL
- https://ia.cr/2024/1988
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2024/1988,
author = {Hanlin Liu and Xiao Wang and Kang Yang and Yu Yu},
title = {BitGC: Garbled Circuits with 1 Bit per Gate},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1988},
year = {2024},
url = {https://eprint.iacr.org/2024/1988}
}