@InProceedings{ball_et_al:LIPIcs.ITCS.2020.86,
author = {Ball, Marshall and Holmgren, Justin and Ishai, Yuval and Liu, Tianren and Malkin, Tal},
title = {{On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?}},
booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)},
pages = {86:1--86:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-134-4},
ISSN = {1868-8969},
year = {2020},
volume = {151},
editor = {Vidick, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.86},
URN = {urn:nbn:de:0030-drops-117714},
doi = {10.4230/LIPIcs.ITCS.2020.86},
annote = {Keywords: Randomized Encoding, Private Simultaneous Messages}
}