"Adaptively Secure Garbling with Near Optimal Online Complexity."

Sanjam Garg, Akshayaram Srinivasan (2018)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2022-10-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics