A State-Separating Proof for Yao's Garbling Scheme

Chris Brzuska; Sabine Oechsner

doi:10.1109/CSF57540.2023.00009

A State-Separating Proof for Yao's Garbling Scheme

University of Edinburgh

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

3 Citations (Scopus)

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).

Original language	English
Title of host publication	Proceedings - 2023 IEEE 36th Computer Security Foundations Symposium, CSF 2023
Publisher	IEEE
Pages	137-152
Number of pages	16
ISBN (Electronic)	979-8-3503-2192-0
DOIs	https://doi.org/10.1109/CSF57540.2023.00009
Publication status	Published - 2023
MoE publication type	A4 Conference publication
Event	IEEE Computer Security Foundations Symposium - Haifa, Israel Duration: 9 Jul 2023 → 13 Jul 2023 Conference number: 36

Publication series

Name	Proceedings - IEEE Computer Security Foundations Symposium
Volume	2023-July
ISSN (Print)	1940-1434
ISSN (Electronic)	2374-8303

Conference

Conference	IEEE Computer Security Foundations Symposium
Abbreviated title	CSF
Country/Territory	Israel
City	Haifa
Period	09/07/2023 → 13/07/2023

Keywords

garbling-schemes
modularity
state-separating-proofs

Access to Document

10.1109/CSF57540.2023.00009

https://eprint.iacr.org/2021/1453Licence: CC BY

Cite this

@inproceedings{ad4ad2f1f43144cea3214404f45416f0,

title = "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).",

keywords = "garbling-schemes, modularity, state-separating-proofs",

author = "Chris Brzuska and Sabine Oechsner",

note = "Funding Information: We are grateful to Christoph Egger, Pihla Karanko, Markulf Kohlweiss, Kirthivaasan Puniamurthy, Jan Winkelmann, Luisa Zeppelin, and the participants of the Advanced Topics in Cryptography course 2021 at Aalto University for useful suggestions on the presentation. We thank Franc ois Dupressoir for insightful discussions about the EasyCrypt security proof of Yao s garbled circuits in [2]. Finally, we thank the reviewers of CSF 2022 for their thorough comments and helpful suggestions that significantly improved the article. All remaining shortcomings of this article are, of course, our responsibility. Publisher Copyright: {\textcopyright} 2023 IEEE.; IEEE Computer Security Foundations Symposium, CSF ; Conference date: 09-07-2023 Through 13-07-2023",

year = "2023",

doi = "10.1109/CSF57540.2023.00009",

language = "English",

series = "Proceedings - IEEE Computer Security Foundations Symposium",

publisher = "IEEE",

pages = "137--152",

booktitle = "Proceedings - 2023 IEEE 36th Computer Security Foundations Symposium, CSF 2023",

address = "United States",

}

Brzuska, C & Oechsner, S 2023, A State-Separating Proof for Yao's Garbling Scheme. in Proceedings - 2023 IEEE 36th Computer Security Foundations Symposium, CSF 2023. Proceedings - IEEE Computer Security Foundations Symposium, vol. 2023-July, IEEE, pp. 137-152, IEEE Computer Security Foundations Symposium, Haifa, Israel, 09/07/2023. https://doi.org/10.1109/CSF57540.2023.00009

A State-Separating Proof for Yao's Garbling Scheme. / Brzuska, Chris; Oechsner, Sabine.
Proceedings - 2023 IEEE 36th Computer Security Foundations Symposium, CSF 2023. IEEE, 2023. p. 137-152 (Proceedings - IEEE Computer Security Foundations Symposium; Vol. 2023-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - A State-Separating Proof for Yao's Garbling Scheme

AU - Brzuska, Chris

AU - Oechsner, Sabine

N1 - Conference code: 36

PY - 2023

Y1 - 2023

N2 - 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).

AB - 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).

KW - garbling-schemes

KW - modularity

KW - state-separating-proofs

UR - http://www.scopus.com/inward/record.url?scp=85171987172&partnerID=8YFLogxK

U2 - 10.1109/CSF57540.2023.00009

DO - 10.1109/CSF57540.2023.00009

M3 - Conference article in proceedings

AN - SCOPUS:85171987172

T3 - Proceedings - IEEE Computer Security Foundations Symposium

SP - 137

EP - 152

BT - Proceedings - 2023 IEEE 36th Computer Security Foundations Symposium, CSF 2023

PB - IEEE

T2 - IEEE Computer Security Foundations Symposium

Y2 - 9 July 2023 through 13 July 2023

ER -

A State-Separating Proof for Yao's Garbling Scheme

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

CryptoProSAT: Cryptographic Protocol Efficiency via SAT solving

Cite this

A State-Separating Proof for Yao's Garbling Scheme

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Projects

CryptoProSAT: Cryptographic Protocol Efficiency via SAT solving

Cite this