Paper 2022/836
Authenticated Garbling from Simple Correlations
Abstract
We revisit the problem of constant-round malicious secure two-party computation by considering the use of simple correlations, namely sources of correlated randomness that can be securely generated with sublinear communication complexity and good concrete efficiency.
The current state-of-the-art protocol of Katz et al. (Crypto 2018) achieves malicious security by realizing a variant of the authenticated garbling functionality of Wang et al. (CCS 2017). Given oblivious transfer correlations, the communication cost of this protocol (with 40 bits of statistical security) is comparable to roughly
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Crypto 2022 (To appear)
- Keywords
- Two-party computation authenticated garbling garbled circuits NISC
- Contact author(s)
-
samdittmer @ stealthsoftwareinc com
yuval @ cs technion ac il
steve @ stealthsoftwareinc com
rafail @ cs ucla edu - History
- 2022-06-27: approved
- 2022-06-24: received
- See all versions
- Short URL
- https://ia.cr/2022/836
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/836, author = {Samuel Dittmer and Yuval Ishai and Steve Lu and Rafail Ostrovsky}, title = {Authenticated Garbling from Simple Correlations}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/836}, year = {2022}, url = {https://eprint.iacr.org/2022/836} }