research

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

Authors
Publication date
1 January 2020
Publisher
LIPIcs - Leibniz International Proceedings in Informatics. 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Doi

    Abstract

    Abstract is not available.

      Similar works

      Full text

      thumbnail-image

      Available Versions

      Dagstuhl Research Online Publication Server

      redirect
      oaioai:drops-oai.dagstuhl.de:1177...
      Last time updated on 18/03/2020