Paper 2025/2338 Original: eprint.iacr.org/2025/2338 ↗
OHMG: One hot modular garbling
Abstract
We propose a novel mechanism for garbling wires and gates of a logical circuit in a privacy-free environment, focusing on the authenticity of the protocol. It is based on one-hot encodings, tensor products and elliptic curve arithmetic. This scheme is designed to work with arithmetic gates, but we also show gadgets to implement transitions from binary inputs to arithmetic outputs and vice versa. For our scheme, each arithmetic gate takes at most one cyphertext of material to execute its functionality (assuming knowledge of the garbled inputs and their cleartexts). We show an application to blockchain transactions. The security of the scheme is proved in the UC setting.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2026-07-22: last updated
- 2025-12-30: published
- Short URL
- https://ia.cr/2025/2338
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2025/2338,
author = {Ariel Futoransky and Fadi Barbàra and Ramses Fernandez and Gabriel Larotonda and Sergio Demian Lerner},
title = {OHMG: One hot modular garbling},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/2338},
year = {2025},
url = {https://eprint.iacr.org/2025/2338}
}