On the complexity of decomposable randomized encodings, or: How friendly can a garbling-friendly PRF be?

Marshall Ball, Justin Holmgren, Yuval Ishai, Tianren Liu, Tal Malkin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Fingerprint

Dive into the research topics of 'On the complexity of decomposable randomized encodings, or: How friendly can a garbling-friendly PRF be?'. Together they form a unique fingerprint.

Computer Science

Mathematics