Paper 2021/1453 Original: eprint.iacr.org/2021/1453 ↗
A State-Separating Proof for Yao’s Garbling Scheme
Abstract
Secure multiparty computation enables mutually distrusting parties to compute a public function of their secret inputs. One of the main approaches for designing MPC protocols are garbled circuits whose core component is usually referred to as a garbling scheme. In this work, we revisit the security of Yao’s garbling scheme and provide a modular security proof which composes the security of multiple layer garblings to prove security of the full circuit garbling. We perform our security proof in the style of state-separating proofs (ASIACRYPT 2018).
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2023-10-13: last updated
- 2021-10-29: published
- Short URL
- https://ia.cr/2021/1453
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2021/1453,
author = {Chris Brzuska and Sabine Oechsner},
title = {A State-Separating Proof for Yao’s Garbling Scheme},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/1453},
year = {2021},
url = {https://eprint.iacr.org/2021/1453}
}