On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly {PRF} Be?

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

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

Journal title: nnovations in Theoretical Computer Science Conference, ITCS 2020

Journal number: 11

Journal publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"

Published year: 2020

Published pages: 86:1--86:22

DOI identifier: 10.4230/lipics.itcs.2020.86