Paper 2021/1453
A State-Separating Proof for Yao’s Garbling Scheme
, University of EdinburghAbstract
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
- Published elsewhere. Major revision. CSF 2023
- DOI
- 10.1109/CSF57540.2023.00009
- Keywords
- Yao's garbling schemeYao's garbled circuitsstate-separating proofsfoundationscompositionverificationsecure multiparty computation
- Contact author(s)
-
chris brzuska @ aalto fi
s oechsner @ ed ac uk - History
- 2023-10-13: last of 2 revisions
- 2021-10-29: received
- See all versions
- Short URL
- https://ia.cr/2021/1453
- License
-
CC BY
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},
doi = {10.1109/CSF57540.2023.00009},
note = {\url{https://eprint.iacr.org/2021/1453}},
url = {https://eprint.iacr.org/2021/1453}
}
