On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Marshall Ball, Justin Holmgren, Yuval Ishai, Tianren Liu, Tal Malkin. On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?. In Thomas Vidick, editor, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA. Volume 151 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

This author has not been identified. Look up 'Marshall Ball' in GoogleThis author has not been identified. Look up 'Justin Holmgren' in GoogleThis author has not been identified. Look up 'Yuval Ishai' in GoogleThis author has not been identified. Look up 'Tianren Liu' in GoogleThis author has not been identified. Look up 'Tal Malkin' in Google

runs on WebDSL