"On the Exact Round Complexity of Self-Composable Two-Party Computation."

Sanjam Garg, Susumu Kiyoshima, Omkant Pandey (2017)

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