Paper 2025/207
Efficient Mixed Garbling from Homomorphic Secret Sharing and GGM-Tree
Abstract
We present new techniques for garbling mixed arithmetic and boolean circuits, utilizing the homomorphic secret sharing scheme introduced by Roy \& Singh (Crypto 2021), along with the half-tree protocol developed by Guo et al (Eurocrypt 2023). Compared to some two-party interactive protocols, our mixed garbling only requires several times
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A minor revision of an IACR publication in EUROCRYPT 2025
- Keywords
- Garbled circuitMixed circuitsSecure computation
- Contact author(s)
-
guojian @ ntu edu sg
wenjie006 @ e ntu edu sg - History
- 2025-02-12: approved
- 2025-02-11: received
- See all versions
- Short URL
- https://ia.cr/2025/207
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/207, author = {Jian Guo and Wenjie Nan}, title = {Efficient Mixed Garbling from Homomorphic Secret Sharing and {GGM}-Tree}, howpublished = {Cryptology {ePrint} Archive, Paper 2025/207}, year = {2025}, url = {https://eprint.iacr.org/2025/207} }